data1.txt

有时间约束的车辆数优化的C程序（遗传算法）

#dWorkTime={10.0,13.0,16.0,14.0,10.0,12.0,14.0,11.0}                /* 每个网点卸钱箱的时间，即停留时间 */
#dSiteWeight={10.0,10.0,10.0,10.0,10.0,10.0,10.0,10.0}              /* 每个网点的钱箱数(个数) */
#dCarCapacity={100.0,100.0,100.0,100.0,100.0,100.0,100.0,100.0,100.0,100.0}   /* 每台车的容量(钱箱个数) */
#dRunTime={{0,  20, 30, 38, 45, 100, 50, 80, 40}
	   {20,  0,  33, 20, 50, 25,  38, 55, 50},
           {30,  33, 0,  38, 50, 50,  38, 38, 38},
           {38,  20, 38, 0,  50, 25,  45, 45, 75},
           {45,  50, 50, 50, 0,  50,  38, 38, 50},
           {100, 25, 50, 25, 50, 0,   35, 45, 38},
           {50,  38, 38, 45, 38, 35,  0,  35, 50},
           {80,  55, 38, 45, 38, 45,  35, 0,  50},
           {40,  50, 38, 75, 50, 38,  50, 50, 0}}  /* 网点之间的行程时间值 */