.png){kind=icon}
返回
Multi-point shortest path planning based on an Improved Discrete Bat Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2020.106498.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Multi-point shortest path planning problem is a typical problems in discrete optimization. The bat algorithm is a nature-inspired metaheuristic optimization algorithm that is used in a wide range of fields. However, there is one problem with the BA, which is easy to premature. To solve multi-point shortest path planning problem, an improved discrete bat algorithm (IDBA) is proposed in this paper. In this algorithm, the Floyd-Warshall algorithm is first used to transform an incomplete connected graph into a complete graph whose vertex set consists of a start point and necessary points. Then the algorithm simulates the bats' foraging and obstacle avoidance process to find the shortest path in the complete graph to satisfy the constraints. Finally, the path is transferred to the original incomplete graph to get the solution. In order to overcome the premature phenomenon of a discrete bat algorithm, the modified neighborhood operator is proposed. To prove the effectiveness of our method, we compared its performance in 26 instances with the results obtained by three different algorithms: DBA, IBA and GSA-ACS-PSOT. We also performed a sensitivity analysis on the parameters. The results indicate that the improved bat algorithm outperforms all the other alternatives in most cases. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Multi-point path planning
Bat algorithm
Floyd-Warshall algorithm
Incomplete connected graph
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
Research of biogeography particle swarm optimization for robot path planning.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏
A tabu search heuristic for the undirected selective travelling salesman problem无向选择性旅行商问题的禁忌搜索启发式
PREAI
分享收藏
分享收藏
查看更多内容