ls.c

ACO解决TSP问题(蚁群优化)源码!!!

                                    j = 0;
                                h_tour[i] = tour[j];
                                n1++;
                            }

                            /* First copy partial tour 3 in new position */
                            j = pos[h6];
                            i = pos[h2];
                            tour[j] = tour[i];
                            pos[tour[i]] = j;
                            while ( i != pos_c2)
                            {
                                i++;
                                if ( i >= n )
                                    i = 0;
                                j++;
                                if ( j >= n )
                                    j = 0;
                                tour[j] = tour[i];
                                pos[tour[i]] = j;
                            }

                            /* Now copy stored part from h_tour */
                            j++;
                            if ( j >= n )
                                j = 0;
                            for ( i = 0; i<n1 ; i++ )
                            {
                                tour[j] = h_tour[i];
                                pos[h_tour[i]] = j;
                                j++;
                                if ( j >= n )
                                    j = 0;
                            }
                            tour[n] = tour[0];
                        }
                        else if ( h == 2 )
                        {
                            /* copy part from pos[h2] to pos[h3]
                               direkt kopiert: Teil von pos[h4] to pos[h5], it
                               remains the part from pos[h6] to pos[h1] */
                            j = pos[h2];
                            h = pos[h3];
                            i = 0;
                            h_tour[i] = tour[j];
                            n1 = 1;
                            while ( j != h)
                            {
                                i++;
                                j++;
                                if ( j  >= n )
                                    j = 0;
                                h_tour[i] = tour[j];
                                n1++;
                            }

                            /* First copy partial tour 3 in new position */
                            j = pos[h2];
                            i = pos[h4];
                            tour[j] = tour[i];
                            pos[tour[i]] = j;
                            while ( i != pos_c3)
                            {
                                i++;
                                if ( i >= n )
                                    i = 0;
                                j++;
                                if ( j >= n )
                                    j = 0;
                                tour[j] = tour[i];
                                pos[tour[i]] = j;
                            }

                            /* Now copy stored part from h_tour */
                            j++;
                            if ( j >= n )
                                j = 0;
                            for ( i = 0; i<n1 ; i++ )
                            {
                                tour[j] = h_tour[i];
                                pos[h_tour[i]] = j;
                                j++;
                                if ( j >= n )
                                    j = 0;
                            }
                            tour[n] = tour[0];
                        }
                    }
                    else if ( move_flag == 1 )
                    {

                        if ( pos_c3 < pos_c2 )
                            n1 = pos_c2 - pos_c3;
                        else
                            n1 = n - (pos_c3 - pos_c2);
                        if ( pos_c3 > pos_c1 )
                            n2 = pos_c3 - pos_c1 + 1;
                        else
                            n2 = n - (pos_c1 - pos_c3 + 1);
                        if ( pos_c2 > pos_c1 )
                            n3 = n - (pos_c2 - pos_c1 + 1);
                        else
                            n3 = pos_c1 - pos_c2 + 1;

                        /* n1: length h6 - h3, n2: length h5 - h2, n2: length h1 - h3 */
                        val[0] = n1;
                        val[1] = n2;
                        val[2] = n3;
                        /* Now order the partial tours */
                        h = 0;
                        help = LONG_MIN;
                        for ( g = 0; g <= 2; g++)
                        {
                            if ( help < val[g] )
                            {
                                help = val[g];
                                h = g;
                            }
                        }
                        /* order partial tours according length */

                        if ( h == 0 )
                        {

                            /* copy part from pos[h5] to pos[h2]
                               (inverted) and from pos[h4] to pos[h1] (inverted)
                               it remains the part from pos[h6] to pos[h3] */
                            j = pos[h5];
                            h = pos[h2];
                            i = 0;
                            h_tour[i] = tour[j];
                            n1 = 1;
                            while ( j != h )
                            {
                                i++;
                                j--;
                                if ( j < 0 )
                                    j = n-1;
                                h_tour[i] = tour[j];
                                n1++;
                            }

                            j = pos[h1];
                            h = pos[h4];
                            i = 0;
                            hh_tour[i] = tour[j];
                            n2 = 1;
                            while ( j != h)
                            {
                                i++;
                                j--;
                                if ( j < 0 )
                                    j = n-1;
                                hh_tour[i] = tour[j];
                                n2++;
                            }

                            j = pos[h4];
                            for ( i = 0; i< n2 ; i++ )
                            {
                                tour[j] = hh_tour[i];
                                pos[hh_tour[i]] = j;
                                j++;
                                if (j >= n)
                                    j = 0;
                            }

                            /* Now copy stored part from h_tour */
                            for ( i = 0; i< n1 ; i++ )
                            {
                                tour[j] = h_tour[i];
                                pos[h_tour[i]] = j;
                                j++;
                                if ( j >= n )
                                    j = 0;
                            }
                            tour[n] = tour[0];
                        }
                        else if ( h == 1 )
                        {

                            /* copy part from h3 to h6 (wird inverted) erstellen : */
                            j = pos[h3];
                            h = pos[h6];
                            i = 0;
                            h_tour[i] = tour[j];
                            n1 = 1;
                            while ( j != h)
                            {
                                i++;
                                j--;
                                if ( j  < 0 )
                                    j = n-1;
                                h_tour[i] = tour[j];
                                n1++;
                            }

                            j = pos[h6];
                            i = pos[h4];

                            tour[j] = tour[i];
                            pos[tour[i]] = j;
                            while ( i != pos_c1)
                            {
                                i++;
                                j++;
                                if ( j >= n)
                                    j = 0;
                                if ( i >= n)
                                    i = 0;
                                tour[j] = tour[i];
                                pos[tour[i]] = j;
                            }

                            /* Now copy stored part from h_tour */
                            j++;
                            if ( j >= n )
                                j = 0;
                            i = 0;
                            tour[j] = h_tour[i];
                            pos[h_tour[i]] = j;
                            while ( j != pos_c1 )
                            {
                                j++;
                                if ( j >= n )
                                    j = 0;
                                i++;
                                tour[j] = h_tour[i];
                                pos[h_tour[i]] = j;
                            }
                            tour[n] = tour[0];
                        }

                        else if ( h == 2 )
                        {

                            /* copy part from pos[h2] to pos[h5] and
                               from pos[h3] to pos[h6] (inverted), it
                               remains the part from pos[h4] to pos[h1] */
                            j = pos[h2];
                            h = pos[h5];
                            i = 0;
                            h_tour[i] =  tour[j];
                            n1 = 1;
                            while ( j != h )
                            {
                                i++;
                                j++;
                                if ( j >= n )
                                    j = 0;
                                h_tour[i] = tour[j];
                                n1++;
                            }
                            j = pos_c2;
                            h = pos[h6];
                            i = 0;
                            hh_tour[i] = tour[j];
                            n2 = 1;
                            while ( j != h)
                            {
                                i++;
                                j--;
                                if ( j < 0 )
                                    j = n-1;
                                hh_tour[i] = tour[j];
                                n2++;
                            }

                            j = pos[h2];
                            for ( i = 0; i< n2 ; i++ )
                            {
                                tour[j] = hh_tour[i];
                                pos[hh_tour[i]] = j;
                                j++;
                                if ( j >= n)
                                    j = 0;
                            }

                            /* Now copy stored part from h_tour */
                            for ( i = 0; i< n1 ; i++ )
                            {
                                tour[j] = h_tour[i];
                                pos[h_tour[i]] = j;
                                j++;
                                if ( j >= n )
                                    j = 0;
                            }
                            tour[n] = tour[0];
                        }
                    }
                    else if ( move_flag == 2 )
                    {

                        if ( pos_c3 < pos_c1 )
                            n1 = pos_c1 - pos_c3;
                        else
                            n1 = n - (pos_c3 - pos_c1);
                        if ( pos_c3 > pos_c2 )
                            n2 = pos_c3 - pos_c2;
                        else
                            n2 = n - (pos_c2 - pos_c3);
                        if ( pos_c2 > pos_c1 )
                            n3 = pos_c2 - pos_c1;
                        else
                            n3 = n - (pos_c1 - pos_c2);

                        val[0] = n1;
                        val[1] = n2;
                        val[2] = n3;
                        /* Determine which is the longest part */
                        h = 0;
                        help = LONG_MIN;
                        for ( g = 0; g <= 2; g++)
                        {
                            if ( help < val[g] )
                            {
                                help = val[g];
                                h = g;
                            }
                        }
                        /* order partial tours according length */

                        if ( h == 0 )
                        {

                            /* copy part from pos[h3] to pos[h2]
                               (inverted) and from pos[h5] to pos[h4], it
                               remains the part from pos[h6] to pos[h1] */
                            j = pos[h3];
                            h = pos[h2];
                            i = 0;
                            h_tour[i] = tour[j];
                            n1 = 1;
                            while ( j != h )
                            {
                                i++;
                                j--;
                                if ( j < 0 )