Search - Traveling Salesman Problem by GA

Search - Traveling Salesman Problem by GA - List

[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)
Date : 2025-12-19 Size : 3kb User : 阳关
[matlab] TSPMATLAB DL : 0: 遗传算法求解TSP问题的MATLAB实现。这是一篇非常有新意的论文，对于学习遗传算法非常有用-This paper has resolved the traveling salesman problem(TSP) by virtue of geneitc algorithms(GA)
Date : 2025-12-19 Size : 153kb User : 王斌
[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)
Date : 2025-12-19 Size : 10kb User : 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)
Date : 2025-12-19 Size : 4kb User : 赵元
[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
Date : 2025-12-19 Size : 3kb User : XIAOMIN XU
[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.
Date : 2025-12-19 Size : 3kb User : 魏蕖