Search - TSP eil51

Search - TSP eil51 - List

[Other resource] ACS DL : 0: 基本蚁群算法用于解决eil51 TSP问题代码，开发环境是VC-basic ant colony algorithm is used to solve eil51 TSP code development environment is VC
Update : 2008-10-13 Size : 6.45kb Publisher : 王红
[Other] eil51 DL : 2: 在http://elib.zib.de/pub/Packages/mp-testdata/tsp/tsplib/tsp/上下载eil51地图，以eil51.tsp与源程序存在一起-at http : / / elib.zib.de / pub / Packages / mp - testdata / t sp / tsplib / tsp / eil51 download maps, eil51.tsp to exist together with the source
Update : 2008-10-13 Size : 2.8kb Publisher : huanxong
[Other] tspsimulator DL : 0: 解决TSP eil51问题的小程序，C＋＋编制，可以直接运行，详见程序-solve the TSP eil51 small programs, C + +, and can directly run, as detailed procedures
Update : 2008-10-13 Size : 1.5mb Publisher : huanxong
[Other resource] MAOS_TSP DL : 0: 用于求解TSP(Traveling salesman problem，旅行商问题)问题，基本执行见run.bat, 其它详见其中的readme.txt。（实例为TSPLIB格式，见myprojects目录，包括eil51, d198, lin318等小型问题，以及1000到3000城市之间的例子，基本能得到最优解）-for TSP (Traveling salesman problem, TSP), the implementation of basic run.bat see, see the other readme.txt. (Example format for the ACS, see myprojects catalogs, including eil51, d198. lin318 other small-scale, and from 1000 to 3000 among cities example, can be the optimal solution)
Update : 2008-10-13 Size : 229.08kb Publisher : caqi
[Other resource] Tsp DL : 0: 使用蚁群算法解决旅行商问题，mfc应用程序，城市数目及坐标在eil51.tsp里-use ant algorithm to solve the traveling salesman problem, and mfc applications, The number of cities and coordinates the eil51.tsp Lane
Update : 2008-10-13 Size : 44.07kb Publisher : pj
[MPI] ACS DL : 0: 基本蚁群算法用于解决eil51 TSP问题代码，开发环境是VC-basic ant colony algorithm is used to solve eil51 TSP code development environment is VC
Update : 2025-02-17 Size : 6kb Publisher :
[Other] eil51 DL : 0: 在http://elib.zib.de/pub/Packages/mp-testdata/tsp/tsplib/tsp/上下载eil51地图，以eil51.tsp与源程序存在一起-at http :// elib.zib.de/pub/Packages/mp- testdata/t sp/tsplib/tsp/eil51 download maps, eil51.tsp to exist together with the source
Update : 2025-02-17 Size : 3kb Publisher : huanxong
[Other] tspsimulator DL : 0: 解决TSP eil51问题的小程序，C＋＋编制，可以直接运行，详见程序-solve the TSP eil51 small programs, C++, and can directly run, as detailed procedures
Update : 2025-02-17 Size : 1.5mb Publisher : huanxong
[AI-NN-PR] MAOS_TSP DL : 0: 用于求解TSP(Traveling salesman problem，旅行商问题)问题，基本执行见run.bat, 其它详见其中的readme.txt。（实例为TSPLIB格式，见myprojects目录，包括eil51, d198, lin318等小型问题，以及1000到3000城市之间的例子，基本能得到最优解）-for TSP (Traveling salesman problem, TSP), the implementation of basic run.bat see, see the other readme.txt. (Example format for the ACS, see myprojects catalogs, including eil51, d198. lin318 other small-scale, and from 1000 to 3000 among cities example, can be the optimal solution)
Update : 2025-02-17 Size : 435kb Publisher : caqi
[AI-NN-PR] Tsp DL : 0: 使用蚁群算法解决旅行商问题，mfc应用程序，城市数目及坐标在eil51.tsp里-use ant algorithm to solve the traveling salesman problem, and mfc applications, The number of cities and coordinates the eil51.tsp Lane
Update : 2025-02-17 Size : 44kb Publisher : pj
[Mathimatics-Numerical algorithms] GeoTrans DL : 0: //基本蚁群算法程序 //程序在vc++6.0下面同过，对原来的做了一点修改 eil51.tsp是一个调用文件，相当于各个城市的坐标值，所以你可以试着自己做个类似的数据，城市坐标x，y。-//Basic ant colony algorithm program// program in vc++6.0 with the following over, the original point made was a call to file amended eil51.tsp, equivalent to the coordinates of each city, so you can try their own to be a similar data, the city coordinates x, y.
Update : 2025-02-17 Size : 2kb Publisher : 李可文
[AI-NN-PR] City DL : 0: 蚁群算法，解决最短路径的NP难问题，数据采用国际通用的 eil51.tsp -Ant colony algorithm
Update : 2025-02-17 Size : 9kb Publisher : 刘炫
[Windows Develop] dirxctly-small DL : 0: 解决TSP eil51问题的小程序,C＋＋编制,可以直接运行,详见程序(The small program to solve the problem of TSP eil51, c + + prepared, can be run directly, as shown in the program)
Update : 2025-02-17 Size : 1.46mb Publisher : Hayku
[Windows Develop] CSP DL : 0: 解决TSP eil51问题的小程序,C＋＋编制,可以直接运行,详见程序(The small program to solve the problem of TSP eil51, c++ prepared, can be run directly, as shown in the program)
Update : 2025-02-17 Size : 1.46mb Publisher : kalucxd