Location:
Search - MTSP Problem
Search list
Description: 使用遗传算法解决MTSP问题的一种新的染色体设计-The use of genetic algorithms to solve the MTSP problem the design of a new chromosome
Platform: |
Size: 191488 |
Author: pengchao |
Hits:
Description: 任务均分的多旅行商问题的解决办法（很有价值）-Divided equally between the mission of the multi-traveling salesman problem solution (very valuable)
Platform: |
Size: 169984 |
Author: pengchao |
Hits:
Description: lingo 多旅行商问题的求解代码
每人限制运货为50-multi-lingo code for solving the traveling salesman problem restricted shipments of 50 per person
Platform: |
Size: 1024 |
Author: phoebe |
Hits:
Description: 由matlab解决多旅行商问题，并且包括矩阵计算等功能-From matlab to solve multi-traveling salesman problem, and includes features such as matrix calculation
Platform: |
Size: 3072 |
Author: zxf |
Hits:
Description: 多旅行商问题(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
Platform: |
Size: 247808 |
Author: liqiubin |
Hits:
Description: MTSP 问题其实与单
旅行商问题(Traveling Salesperson Problem ,简称TSP) 相似,但是由于添加了任何城市只要被某一旅行商访问到即可这个附加条
件,因而增加了问题复杂度。在以前使用遗传算法(GA) 研究解决MTSP 问题时,通常采用标准的TSP 染色体和处理方法。-M any app licat ions are invo lved w ith mult ip le salesmen each of w hom visits a subgroup
cit ies and returns the same start ing city. The to tal length of all subtours is required to be m ini2
mum. Th is is calledM ult ip le T raveling Salesmen P roblem (M TSP). There are various heurist ic
methods to obtain op t imal o r near2op t imal so lut ions fo r the TSP p roblem. But to the M ult ip le
T raveling Salesmen P roblem , there are no t much app roaches to so lveM TSP. In th is paper, a hy2
brid genet ic algo rithm to so lve TSP and M TSP is p resented. Th is algo rithm combines GA and
heurist ics. N umerical experiments show that the new algo rithm is very efficient and effect ive.
Platform: |
Size: 217088 |
Author: liqiubin |
Hits:
Description: 基于混合算法的均衡路程MTSP研究
给出了MTSP的整数线性规划模型、分类, 提出了均衡各旅行商访问路程和均衡各旅行商访问人数的多目标
问题针对均衡各旅行商访问路程的设计了相应的求解算法, 求解算法为遗传算法和一的混合算法给出了相应
的示例和实验结果, 并对实验结果的有效性进行了研究-Hybrid algorithm based on a balanced study of MTSP given distance of the MTSP integer linear programming model, the classification of a traveling salesman to visit all balanced and balanced way to visit the traveling salesman problem of the number of multi-target traveling salesman for the balance of the journey to visit the design of the the corresponding algorithm, algorithm for genetic algorithm and a hybrid algorithm of the corresponding sample and experimental results, experimental results and the validity of the study
Platform: |
Size: 254976 |
Author: Notics |
Hits:
Description: 这是一篇关于多旅行商问题的学术论文，非常有新意，非常有利于我们深入了解mtsp问题的本质-This is a multi-traveling salesman problem on the papers, very fresh, very beneficial to our in-depth understanding of the nature of the problem mtsp
Platform: |
Size: 49152 |
Author: 王斌 |
Hits:
Description: Mstp问题的相关论文，可以针对MSTP问题的解决提供参考-Mstp issues related papers for the MSTP solution to the problem can provide a reference
Platform: |
Size: 961536 |
Author: 李杰 |
Hits:
Description: This gives source code of traveling salesman problem. The algorithm used is tabu search.
Platform: |
Size: 9216 |
Author: Roger |
Hits:
Description: 旅行商问题（TravelingSalesmanProblem，TSP）是经典的组合优化问题，而一些实际应用问题不能归纳为经典TSP，其中涉及到多个（项）任务的分派与优化，问题演变为多（人）旅行商问题（multipleTravelingSalesmanProblem，mTSP）-The traveling salesman problem (TravelingSalesmanProblem TSP) is a classic combinatorial optimization problem, and some practical application issues can not be summed up as a classic TSP, which involves multiple () task distribution and optimization problem evolved for more (people) traveling salesman problem(multipleTravelingSalesmanProblem MTSP)
Platform: |
Size: 1024 |
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: 蚁群算法实现最短路径，一个起点一个终点的问题-Ant colony algorithm shortest path problem, a starting point for an end
Platform: |
Size: 10240 |
Author: 周江 |
Hits:
Description: 应用启发式算法-粒子群算法PSO，解决物流配送中心选址问题，结果好的解决了上述问题，值得参考。-PSO Particle Swarm algorithm using heuristic algorithm to address the logistics distribution center location problems, resulting in a good solution for this problem, it is also useful.
Platform: |
Size: 16384 |
Author: chaihongjian |
Hits:
Description: 遗传算法解决5种多旅行商问题（mtsp）的matlab程序
分别为以下5中情况：
1.从不同起点出发回到起点（固定旅行商数量）
2.从不同起点出发回到起点（旅行商数量根据计算可变）
3.从同一起点出发回到起点
4.从同一起点出发不会到起点
5.从同一起点出发回到同一终点（与起点不同）-5 kinds of genetic algorithms to solve multiple traveling salesman problem (mtsp) matlab program
5, respectively, the following situations:
1. Back to the starting point a different starting point (TSP fixed amount)
2. Back to the starting point a different starting point (TSP amount calculated variable)
3. Starting the same starting point back to the beginning
4. Starting the same starting point to the starting point is not
5. Starting the same starting point back to the same end point (with different starting points)
Platform: |
Size: 21504 |
Author: dou |
Hits:
Description: 基于蚁群—粒子群的TSP求解，可以解决蚁群算法陷入局部最优解的问题，更好求出TSP问题-Based on ACO- pso MTSP solving the problem can be solved ant colony algorithm into local optimal solution, obtaining better TSP problem
Platform: |
Size: 8192 |
Author: tong |
Hits:
Description: 多人员行走的路径规划问题模型的求解源代码。可以对应很多模型。非常不错。-more people route planning problem.it is very good
Platform: |
Size: 4096 |
Author: 武子龙 |
Hits:
Description: 多旅行商MTSP问题遗传算法应用遗传算法求解多旅行商问题的算法设计,并将其与模拟退火算法比较与结合,有效提高了运算的速度和效率。-Multi traveling salesman MTSP problem genetic algorithm genetic algorithm to solve the problem of multiple traveling salesman problem algorithm design, and it is compared with the simulated annealing algorithm and the combination, effectively improve the speed and efficiency of the operation.
Platform: |
Size: 1646592 |
Author: zhch78 |
Hits:
Description: 使用ga算法，通过八种评价机制解决多旅行商问题(The GA algorithm is used to solve the multiple traveling salesman problem via eight evaluation mechanisms)
Platform: |
Size: 4096 |
Author: jyw
|
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)(Multiple Traveling Salesmen Problem - Genetic Algorithm)
Platform: |
Size: 6144 |
Author: mokangxin |
Hits: