返回
Two phase heuristic algorithm for the multiple-travelling salesman problem
DOI:10.1007/s00500-017-2705-5.png)
摘要
En 中文
The multiple-travelling salesman problem (MTSP) is a computationally complex combinatorial optimisation problem, with several theoretical and real-world applications. However, many state-of-the-art heuristic approaches intended to specifically solve MTSP, do not obtain satisfactory solutions when considering an optimised workload balance. In this article, we propose a method specifically addressing workload balance, whilst minimising the overall travelling salesman's distance. More specifically, we introduce the two phase heuristic algorithm (TPHA) for MTSP, which includes an improved version of the K-means algorithm by grouping the visited cities based on their locations based on specific capacity constraints. Secondly, a route planning algorithm is designed to assess the ideal route for each above sets. This is achieved via the genetic algorithm (GA), combined with the roulette wheel method with the elitist strategy in the design of the selection process. As part of the validation process, a mobile guide system for tourists based on the Baidu electronic map is discussed. In particular, the evaluation results demonstrate that TPHA achieves a better workload balance whilst minimising of the overall travelling distance, as well as a better performance in solving MTSP compared to the route planning algorithm solely based on GA.
Keyword:
Multiple-travelling salesman problem
Route planning
Heuristic algorithm
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
Association of androgen receptor gene CAG and GGN repeat polymorphism with cryptorchidism: A meta-analysis雄激素受体基因CAG和GGN重复序列多态性与隐睾症的相关性:一项Meta分析
Andrologia
IF0
Identification of the Underlying Androgen Receptor Defect in the Dallas Reifenstein Family鉴定达拉斯·里芬斯坦家族中潜在雄激素受体缺陷
A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms用遗传算法求解多旅行商问题的一种新的交叉方法

