Search - Traveling Salesman Problem by GA

Search - Traveling Salesman Problem by GA - List

[Other resource] TravelingSalesmanProblemwithGeneticAlgorithm DL : 0: this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checking included 2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value
Update : 2008-10-13 Size : 3.95kb Publisher : 宏姬
[Other resource] TravelingSalesmanProblemGeneticAlgorithm DL : 0: Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Update : 2008-10-13 Size : 3.13kb Publisher : 阳关
[Mathimatics-Numerical algorithms] 旅行商问题 DL : 0: % 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)
Update : 2011-03-06 Size : 3.96kb Publisher : 5501018333@qq.com
[AI-NN-PR] TravelingSalesmanProblemwithGeneticAlgorithm DL : 0: this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checking included 2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value -this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checking included2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter, value
Update : 2025-02-17 Size : 4kb Publisher : 宏姬
[matlab] TravelingSalesmanProblemGeneticAlgorithm DL : 0: Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Update : 2025-02-17 Size : 3kb Publisher : 阳关
[Books] MTSPranseti DL : 0: 　多旅行商问题(Multiple Traveling Salesperson Problem ,简称MTSP) 讨论的是如何安排m( > 1 ) 位旅行商访问n( > m ) 座城市,要求每个城市只允许被访问一次时,求解所有旅行商花费的费用和是最小(或最大) 的问题。MTSP 问题其实与单旅行商问题(Traveling Salesperson Problem ,简称TSP) 相似,但是由于添加了任何城市只要被某一旅行商访问到即可这个附加条件,因而增加了问题复杂度。在以前使用遗传算法(GA) 研究解决MTSP 问题时,通常采用标准的TSP 染色体和处理方法。现为解决MTSP 问题给出了一种新的染色体设计和相关的处理方法,并与以往的理论设计和计算性能进行比较。计算测试显示,新的方法能够获得较小的查找空间,在许多方面,新的方法产生的解空间更好。-Multi-Traveling Salesman Problem (Multiple Traveling Salesperson Problem, referred to as MTSP) discussed the arrangements for the m (> 1)-bit traveling salesman visits n (> m) cities to require each city to allow only visited once, the solution of traveling salesman to spend all the costs and the smallest (or largest) problems. In fact, with the single issue of MTSP TSP (Traveling Salesperson Problem, referred to as TSP) is similar to, but added any city as long as the visit by a traveling salesman to be attached to the Pieces, thus increasing the complexity of the problem. The use of genetic algorithms in the past (GA) to study and solve the issue of MTSP, usually a standard chromosome and the TSP approach. Is MTSP problem to solve is given a new design and associated chromosome approach and the theory of the previous design and to compare performance. Calculation of the test significantly Show that the new method can find a smaller space, in many respects, the new met
Update : 2025-02-17 Size : 242kb Publisher : liqiubin
[matlab] TSPMATLAB DL : 0: 遗传算法求解TSP问题的MATLAB实现。这是一篇非常有新意的论文，对于学习遗传算法非常有用-This paper has resolved the traveling salesman problem(TSP) by virtue of geneitc algorithms(GA)
Update : 2025-02-17 Size : 153kb Publisher : 王斌
[AI-NN-PR] tsp_ga DL : 0: 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)
Update : 2025-02-17 Size : 3kb Publisher : gao
[AI-NN-PR] GA-TSP DL : 0: use Genetic algorithms to solve Traveling salesman problem by C-use Genetic algorithms to solve Traveling salesman problem by C++
Update : 2025-02-17 Size : 16kb Publisher : 林谷謙
[AI-NN-PR] TSP-GA.zip DL : 0: 旅行商问题（TSP）是一个经典的优化组合问题，本个案列采用遗传算法来求解TSP问题，进行了选择、交叉、变异算子的设计，并通过MATLAB对算法进行了实现，附有详细的说明和代码。,The traveling salesman problem (TSP) is a classic combination optimization problem, in this case the column using a genetic algorithm to solve TSP problem selection, crossover and mutation operator design and realization by MATLAB algorithm, with detailed description and code.
Update : 2025-02-17 Size : 867kb Publisher : ZHENG
[matlab] mtsp DL : 0: 多旅行商问题的遗传算法环形固定节点- 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)
Update : 2025-02-17 Size : 10kb Publisher : pxl
[matlab] mtspv_ga DL : 0: 基于遗传算法(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)
Update : 2025-02-17 Size : 4kb Publisher : 赵元
[matlab] tsp_ga DL : 0: 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
Update : 2025-02-17 Size : 3kb Publisher : XIAOMIN XU
[Algorithm] mdmtspv_ga DL : 0: This code is aimed at solving the multiple depots multiple traveling salesman problem by using genetic algorithm.Finding 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). The salesmen originate a set of fixed locations, called depots.-This code is aimed at solving the multiple depots multiple traveling salesman problem by using genetic algorithm.Finding 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). The salesmen originate a set of fixed locations, called depots.
Update : 2025-02-17 Size : 5kb Publisher : 魏蕖
[matlab] GA-TSP DL : 0: This code uses the genetic algorithm to solve the traveling salesman problem by using the exchange,cross and mutation operators to change the route and calculate the fitness(distance) of each route.
Update : 2025-02-17 Size : 3kb Publisher : 魏蕖
[simulation modeling] GA for TSP - Final DL : 0: 用遗传算法实现旅行商问题，可选择城市数量(Traveling salesman problem is realized by genetic algorithm, and the number of cities can be selected.)
Update : 2025-02-17 Size : 3kb Publisher : tianyunong
[Other] GA-tsp DL : 0: 使用遗传算法解决了旅行商问题，采用C++做实现(The traveling salesman problem is solved by genetic algorithm, and implemented by C++.)
Update : 2025-02-17 Size : 2kb Publisher : derek__z
[Other] 6. TSP Prog DL : 0: 遗传算法解决旅行商问题，可以解决N个城市最短路程问题并画图表示，给出迭代次数和最短距离(Solving the traveling salesman problem by genetic algorithm)
Update : 2025-02-17 Size : 3kb Publisher : ZDYTR