grefenstette

TSP问题中的Grefenstette解码部分

#include <stdio.h>

int main(int argc, char* argv[])
{
    int i,j;
    int a[12]={10, 9, 10, 9, 3, 3, 1, 1, 4, 3, 1, 1};
    
    for(i = 11; i >= 0; i--)
    {
        for  (j=i-1 ;j >= 0; j--)
        {
            if  (a[j] <= a[i]) 
                a[i]++;
        }
        for (int s = 0; s < 12; s++)   
        printf("%3d",a[s]);
        printf("\n");
    }
    
    return  0;
}