Multi-point shortest path planning based on an Improved Discrete Bat Algorithm

• Published in: Applied soft computing Vol. 95; p. 106498
• Main Authors: Liu, Lijue, Luo, Shuning, Guo, Fan, Tan, Shiyang
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.10.2020
• Subjects: Bat algorithm; Floyd–Warshall algorithm; Incomplete connected graph; Multi-point path planning; Floyd–Warshall algorithm; Bat algorithm; Incomplete connected graph; Multi-point path planning
• ISSN: 1568-4946
• DOI: 10.1016/j.asoc.2020.106498

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. •Multi-point shortest path planning problem is solved by using an improved discrete bat algorithm (IDBA).•An incomplete connected graph is first converted into a complete graph.•The bats’ foraging and obstacle avoidance process are then simulated to find the shortest path in the complete graph.•The path is finally transferred to the original incomplete graph to get the solution.