Description: This program is using Genetic Algorithm to solve the Travlling
Salesman Problem. It gives the best path route within a specified
time.
usage: java Evolver <seconds> <city file> <config file>
Author: Liu Yang
Platform: |
Size: 9122 |
Author:liu yang |
Hits:
Description: % MTSPF_GA Fixed Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA) % Finds a (near) optimal solution to a variation of the M-TSP by setting % up a GA to search for the shortest route (least distance needed for % each salesman to travel from the start location to individual cities % and back to the original starting place) Platform: |
Size: 4058 |
Author:5501018333@qq.com |
Hits:
Description: This program is using Genetic Algorithm to solve the Travlling
Salesman Problem. It gives the best path route within a specified
time.
usage: java Evolver <seconds> <city file> <config file>
Author: Liu Yang
-This program is using Genetic Algorithm to solve the Travlling Salesman Problem. It gives the best path route within a specified time. Usage: java Evolver <seconds> <city file> <config file> Author: Liu Yang Platform: |
Size: 9216 |
Author: |
Hits:
Description: MTSP_GA Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
Finds a (near) optimal solution to the M-TSP by setting up a GA to search
for the shortest route (least distance needed for the salesmen to travel to each city exactly once and return to their starting locations) Platform: |
Size: 4096 |
Author:gao |
Hits:
Description: SP_GA Traveling Salesman Problem (TSP) Genetic Algorithm (GA)
Finds a (near) optimal solution to the TSP by setting up a GA to search
for the shortest route (least distance for the salesman to travel to
each city exactly once and return to the starting city)
-SP_GA Traveling Salesman Problem (TSP) Genetic Algorithm (GA)
Finds a (near) optimal solution to the TSP by setting up a GA to search
for the shortest route (least distance for the salesman to travel to
each city exactly once and return to the starting city)
Platform: |
Size: 3072 |
Author:gao |
Hits:
Description: 用遗传算法解迷宫问题，让Bob从迷宫的起点走到迷宫的终点，绕开迷宫中的障碍物，找到一体条通往目的地的路径。-Genetic Algorithm for the maze problem, so Bob walked from the starting point of the maze maze in the end, bypassing the maze of obstacles, to find one route to the destination path. Platform: |
Size: 8192 |
Author:王光军 |
Hits:
Description: 基于差分算法的路由算法，可以搜索网络中的最佳路由路径，差分算法优越于传统遗传算法，寻优目的性更强-Difference algorithm-based routing algorithm, the best route in the search network, differential algorithm is superior to the traditional genetic algorithm optimization purpose more Platform: |
Size: 3072 |
Author:肖刚 |
Hits:
Description: 多旅行商问题的遗传算法 环形 固定节点- MTSPOFS_GA Fixed Start Open Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
Finds a (near) optimal solution to a variation of the "open" M-TSP by
setting up a GA to search for the shortest route (least distance needed
for each salesman to travel from the start location to unique individual
cities without returning to the starting location)
Platform: |
Size: 10240 |
Author:pxl |
Hits:
Description: 基于遗传算法(GA)的多变量旅行商问题(TSP) ，MTSPV_GA Variable Multiple Traveling Salesman Problem (M-TSP) Genetic Algorithm (GA)
Finds a (near) optimal solution to a variation of the M-TSP (that has a
variable number of salesmen) by setting up a GA to search for the
shortest route (least distance needed for the salesmen to travel to
each city exactly once and return to their starting locations)
-Based on genetic algorithm (GA) multivariate traveling salesman problem (TSP), MTSPV_GA Variable Multiple Traveling Salesman Problem (M-TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to a variation of the M-TSP (that has a variable number of salesmen) by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exactly once and return to their starting locations) Platform: |
Size: 4096 |
Author:赵元 |
Hits:
Description: TSP_GA Traveling Salesman Problem (TSP) Genetic Algorithm (GA)
Finds a (near) optimal solution to the TSP by setting up a GA to search
for the shortest route (least distance for the salesman to travel to
each city exactly once and return to the starting city)
Summary:
1. A single salesman travels to each of the cities and completes the
route by returning to the city he started from
2. Each city is visited by the salesman exactly once- TSP_GA Traveling Salesman Problem (TSP) Genetic Algorithm (GA)
Finds a (near) optimal solution to the TSP by setting up a GA to search
for the shortest route (least distance for the salesman to travel to
each city exactly once and return to the starting city)
Summary:
1. A single salesman travels to each of the cities and completes the
route by returning to the city he started from
2. Each city is visited by the salesman exactly once Platform: |
Size: 3072 |
Author:XIAOMIN XU |
Hits:
Description: 遗传算法解决旅行家问题，列有城市坐标，最后算出最佳路线。-Traveler genetic algorithm to solve the problem, list of city coordinates, finally calculate the best route.
Platform: |
Size: 338944 |
Author:John |
Hits:
Description: 建立了带约束条件的物流配送问题的数学模型，运用蚁群算法解决物流配送路径
优化问题，并将遗传算法的复制、交叉、变异等遗传算子引入蚁群算法，同时改进信息素的
更新方式、客户点选择策略，以提高算法的收敛速度和全局搜索能力。经过多次实验和计算 ，证明了用改进的蚁群算法优化物流配送线路，可以有效而快速地求得问题的最优解或近似最
优解。-A mathematical model with the constraints of logistics and distribution issues, the use of ant colony algorithm to solve the problem of logistics distribution route optimization, replication and genetic algorithms, crossover and mutation genetic operators to introduce ant colony algorithm, while improving the way pheromone update customer point selection strategy to improve the convergence speed and global search capability. After several experiments and calculations prove that the optimal solution with improved ant colony algorithm to optimize logistics and distribution lines, can effectively and quickly determined the problem or near optimal solution. Platform: |
Size: 16384 |
Author:低调惜缘 |
Hits:
Description: 遗传算法计算多旅行商问题：多个商人从多个城市出发各自返回自己的出发城市。-MTSPF_GA Fixed Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to a variation of the M-TSP by setting up a GA to search for the shortest route (least distance needed for three salesmen to travel the start location to individual cities
and back to the original starting place) Platform: |
Size: 6144 |
Author:jiweijie |
Hits:
Description: 遗传算法求解二维地图最佳路径。控制台显示。用vc6.0编译。可以求出最佳路径。-Genetic Algorithm for a two-dimensional map of the best route. Platform: |
Size: 52224 |
Author:海德光明 |
Hits:
Description: 用遗传算法求解固定起始点的闭环最短旅游路线问题-Fixed starting point for solving the shortest travel route closed loop problem by Genetic Algorithm Platform: |
Size: 1024 |
Author:liluyan |
Hits:
Description: Energy is one of the most important items to determine the network lifetime due to low power energy nodes included in the network. Generally, data aggregation tree concept is used to find an energy efficient solution. However, even the best aggregation tree does not share the load of data packets to the transmitting nodes fairly while it is consuming the lowest possible energy of the network. Therefore, after some rounds, this problem causes to consume the whole energy of some heavily loaded nodes and hence results in with the death of the network. In this paper, by using the Genetic Algorithm (GA), we investigate the energy efficient data collecting spanning trees to find a suitable route which balances the data load throughout the network and thus balances the residual energy in the network in addition to consuming totally low power of the network. Using an algorithm which is able to balance the residual energy among the nodes can help the network to withstand more and consequently extend its own lifetime. In this work, we calculate all possible routes represented by the aggregation trees through the genetic algorithm. GA finds the optimum tree which is able to balance the data load and the energy in the network. Simulation results show that this balancing operation practically increases the network lifetime. Platform: |
Size: 342534 |
Author:atrakpc@yahoo.com |
Hits:
Search - genetic algorithm route