Multi-point path planning based on the algorithm of colony-particle swarm optimization
The problem of multi-point path planning is a NP-hard problem,which is equivalent to finding the shortest path of a starting point and some specific node.Aiming at the problem of multi-point path planning,a retrospective ant colony-particle swarm optimization algorithm was proposed.This algorithm us...
Hauptverfasser: | Lijue LIU, Shuning LUO, Yan GAO, Meifei CHEN |
---|---|
Format: | Artikel |
Sprache: | zho |
Veröffentlicht: |
Editorial Department of Journal on Communications
2019-02-01
|
Schriftenreihe: | Tongxin xuebao |
Schlagworte: | |
Online Zugang: | http://www.joconline.com.cn/thesisDetails#10.11959/j.issn.1000-436x.2019039 |
Ähnliche Einträge
Ähnliche Einträge
-
Multi-point path planning based on the algorithm of colony-particle swarm optimization
von: Lijue LIU, et al.
Veröffentlicht: (2019-02-01) -
Comparison Analysis of Graph Theory Algorithms for Shortest Path Problem
von: Yosefina Finsensia Riti, et al.
Veröffentlicht: (2023-11-01) -
Evaluation of Shortest Paths in Road Network
von: Farrukh Shehzad, et al.
Veröffentlicht: (2009-06-01) -
Z-Score and Floyd Warshall Algorithms for Determining Alternative Routes of Mugging-Prone Areas in Medan City, Indonesia
von: Rozzi Kesuma Dinata, et al.
Veröffentlicht: (2023-12-01) -
Non-crossing Rectilinear Shortest Minimum Bend Paths in the Presence of Rectilinear Obstacles
von: Shylashree Nagaraja
Veröffentlicht: (2018-09-01)