.png){kind=icon}
返回
Solving shortest path problem using particle swarm optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2008.01.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents the investigations on the application of particle swarm optimization (PSO) to solve shortest path (SP) routing problems. A modified priority-based encoding incorporating a heuristic operator for reducing the possibility of loop-formation in the path construction process is proposed for particle representation in PSO. Simulation experiments have been carried out on different network topologies for networks consisting of 15-70 nodes. It is noted that the proposed PSO-based approach can find the optimal path with good success rates and also can find closer sub-optimal paths with high certainty for all the tested networks. It is observed that the performance of the proposed algorithm surpasses those of recently reported genetic algorithm based approaches for this problem. (c) 2008 Elsevier B.V. All rights reserved.
Keyword:
shortest path problem
particle swarm optimization
path encoding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
分享收藏Variation of series resistance with temperature and illumination level in diffused junction poly- and single-crystalline silicon solar cells扩散结多晶硅和单晶硅太阳能电池中串联电阻随温度和照度的变化
PREAI
分享收藏Metabolism of bifenthrin, β-cyfluthrin, λ-cyhalothrin, cyphenothrin and esfenvalerate by rat and human cytochrome P450 and carboxylesterase enzymes.png)
Xenobiotica
XenobioticaIF0
PREAI
分享收藏
The particle swarm - Explosion, stability, and convergence in a multidimensional complex space多维复杂空间中的粒子群爆炸，稳定性和收敛性
PREAI
分享收藏SUBSTITUENT EFFECTS ON THE31P NMR CHEMICAL SHIFTS OF 1-AMINO- AND 1-HYDROXY-ALKYLPHOSPHONIC ACIDS
PREAI
分享收藏 没有更多内容
没有更多内容