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...
Saved in:
| Main Authors: | Lijue LIU, Shuning LUO, Yan GAO, Meifei CHEN |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2019-02-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/thesisDetails#10.11959/j.issn.1000-436x.2019039 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Floyd-Warshall ve Karınca Kolonisi Optimizasyonu Algoritmaları ile Depo Rota Planlaması
by: Fatih Çavdur, et al.
Published: (2025-04-01) -
HETEROGENIOUS BLOCKED ALL-PAIRS SHORTEST PATHS ALGORITHM
by: A. A. Prihozhy, et al.
Published: (2017-11-01) -
Three-Layer Energy Optimization Strategy for CHP Microgrid Considering Path Loss
by: Kai LING, et al.
Published: (2023-02-01) -
Tuning block-parallel all-pairs shortest path algorithm for efficient multi-core implementation
by: O. N. Karasik, et al.
Published: (2022-12-01) -
Competing all-pairs shortest paths algorithms for sparse / dense graphs: implementation and comparison
by: A. A. Prihozhy, et al.
Published: (2024-12-01)