Search - Travelling salesman

Search - Travelling salesman - List

[Console] travelingsalesman DL : 0: 用动态规划法求解旅行商问题已经加入注释欢迎批评指正-dynamic programming method for the traveling salesman problem has joined Notes welcome criticism correction
Update : 2025-02-17 Size : 413kb Publisher : 卢林
[JSP/Java] Knap12121 DL : 0: 用动态规划算法编写的有关旅行商问题的java程序-dynamic programming algorithm used in the preparation of the Traveling Salesman Problem java programs
Update : 2025-02-17 Size : 2kb Publisher :
[GUI Develop] HuoLangDanProblem DL : 0: 分支限界法实现货郎担问题，开发工具eclipse-branch and bound Method traveling salesman problem, development tools eclipse
Update : 2025-02-17 Size : 16kb Publisher : EllenGong
[Algorithm] tspsa DL : 0: 旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) is a well-known field of mathematics problems. Assuming there is a travel business to visit n cities, he must choose which path to go, via the restriction is to visit each city only once and the last to go back to the original departure city. Path selection objective is to get the path distance for all paths are the minimum.
Update : 2025-02-17 Size : 1.17mb Publisher : 吴昆
[Other] tsp DL : 0: tsp问题俗称旅行商问题，一个商人从一个城市出发，经过所有的城市一次且仅一次回到出发的城市，问旅行商应当如何选择路径使总路径最短。本程序是用lingo软件编写的，只需要更改城市的数目以及距离矩阵即可。-tsp problem commonly known as the traveling salesman problem, a businessman from a city of departure, after all of the city once and only once returned to the starting city TSP question should be how to choose the shortest path so that the total path. This procedure is used lingo software programmers only need to change the number of cities as well as the distance matrix can be.
Update : 2025-02-17 Size : 1kb Publisher : 雷浩
[AI-NN-PR] TSP DL : 0: 这是一个用遗传算法来求解旅行商问题（TSP问题：Travelling Salesman Problem）的源代码，学习遗传算法，演化计算的很值得一看！-This is a genetic algorithm to solve the traveling salesman problem (TSP problems: Travelling Salesman Problem) source code, learning genetic algorithm, evolutionary computation is very worth a visit!
Update : 2025-02-17 Size : 70kb Publisher : 郭肇禄
[Data structs] huishufa DL : 0: 用分支限界法求界旅行商问题，用Ｃ＋＋语言编程实现-Using branch and bound method profession traveling salesman problem, using C Language Programming
Update : 2025-02-17 Size : 181kb Publisher : yangyang
[Mathimatics-Numerical algorithms] dp_tsp DL : 0: TSP问题的动态规划求解。问题描述：旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -TSP dynamic programming to solve the problem. Description of the problem: traveling salesman problem, namely TSP problem (Travelling Salesman Problem) is a well-known field of mathematics problems. Assuming there is a travel businessmen to visit n cities, he must choose which path to go, via the restriction is to visit each city only once and the last to go back to the original departure city. Path selection objective is to get the path distance for all paths are the minimum.
Update : 2025-02-17 Size : 1021kb Publisher : 黄艺敏
[AI-NN-PR] tsp-ga.m DL : 0: sovling TSP(Travelling Salesman Problem) with GAs -sovling TSP (Travelling Salesman Problem) with GAs
Update : 2025-02-17 Size : 2kb Publisher : li
[Windows Develop] TSM DL : 0: This program gives solution to the Travelling Salesman problem (TSP). I use genetic algorithm, tabu search, exhaustive search. It all combine in a windows application.
Update : 2025-02-17 Size : 59kb Publisher : yyavuz
[Mathimatics-Numerical algorithms] SA_TSP DL : 0: 旅行商问题（Travelling Salesman Problem, 简记TSP，亦称货郎担问题)：设有n个城市和距离矩阵D=[dij]，其中dij表示城市i到城市j的距离，i，j=1，2 … n，则问题是要找出遍访每个城市恰好一次的一条回路并使其路径长度为最短。-TSP (Travelling Salesman Problem, Jane Hutchison TSP, also known as the traveling salesman problem): with n cities and the distance matrix D = [dij], which said dij city i to city j the distance, i, j = 1, 2 ... n, the problem is to identify each city exactly once visited a loop and make it to the shortest path length.
Update : 2025-02-17 Size : 262kb Publisher : 章为到
[Algorithm] algorithm02 DL : 0: heuristic algotrihm for travelling salesman problem
Update : 2025-02-17 Size : 3kb Publisher : sadi
[AI-NN-PR] NNHTSP DL : 0: a nearest neighbor heuristic solving travelling salesman problem. it is great. h-a nearest neighbor heuristic solving travelling salesman problem. it is great. hehehhehehhee
Update : 2025-02-17 Size : 1kb Publisher : albert
[AI-NN-PR] mtspf_ga DL : 0: Genetic Algorithm that solves te Multiple Travelling Salesman Problem. This algorithm uses fixed start and end points
Update : 2025-02-17 Size : 3kb Publisher : jacobdeboer33
[Algorithm] noising_method_articles DL : 0: Great articles on noising method algorithm for travelling salesman problem-Great articles on noising method algorithm for travelling salesman problem
Update : 2025-02-17 Size : 531kb Publisher : Othwal
[matlab] TSP DL : 0: 利用遗传算法求解旅行商问题旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -Traveling salesman problem using genetic algorithm traveling salesman problem, namely, the problem TSP (Travelling Salesman Problem) is one of the famous field of mathematics. Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths.
Update : 2025-02-17 Size : 7kb Publisher : yanzhongyuan
[AI-NN-PR] New-Folder DL : 0: Modified Hopfield Neural Network for Travelling Salesman Problem
Update : 2025-02-17 Size : 93kb Publisher : shiva
[JSP/Java] src DL : 0: An implementation of ant colony for travelling salesman problem
Update : 2025-02-17 Size : 6kb Publisher : ddt_doublet
[Other] Travelling-salesman-problem-algorithm DL : 0: The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
Update : 2025-02-17 Size : 2kb Publisher : ramin
[GUI Develop] Travelling-Salesman-Problem-from-mathwork DL : 0: Travelling salesman problem
Update : 2025-02-17 Size : 24kb Publisher : dnie

« 12 3 4 5 6 7 8 9 10 »