Improving Solutions of Shortest Path Problem with MGHS Algorithm

被引：0

作者：

Wang, Lei ^{[1
]}

Wang, Xin ^{[2
]}

Yi, Yufeng ^{[3
]}

机构：

[1] Natl Police Univ China, Dept Publ Order, Shenyang, Peoples R China

[2] Natl Police Univ China, Dept Publ Secur Intelligence, Shenyang, Peoples R China

[3] China Elect Technol Grp Corp, Acad Opt Elect, Tianjin, Peoples R China

来源：

2016 8TH INTERNATIONAL CONFERENCE ON INTELLIGENT HUMAN-MACHINE SYSTEMS AND CYBERNETICS (IHMSC), VOL. 2 | 2016年

关键词：

MGHS; shortest path; PSO; network topologies;

D O I：

10.1109/IHMSC.2016.268

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The modified global harmony search algorithm (MGHS) is designed to solve the shortest path problem. The dynamic gene mutation rate is defined to add into harmony search algorithm to avoid producing local optimal solutions. The path is constructed based on priority value of corresponding node in harmony vector with dynamic priority value encoding rule, and the shortest path is obtained by updating harmony memory. Finally, experiments are simulated on 20 to 100 nodes of network topology. Three performance indicators are designed to analyzing performance of IGHS, HS and PSO. Experimental results show the proposed algorithm is superior to HS and PSO for the shortest path problem.

引用

页码：152 / 155

页数：4

共 8 条

[1] Shortest path planning for a tethered robot
Brass, Peter
Vigan, Ivo
Xu, Ning
[J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2015, 48 (09): : 732 - 742
[2] On the complexity of the shortest-path broadcast problem
Crescenzi, Pierluigi
Fraigniaud, Pierre
Halldorsson, Magnus
Harutyunyan, Hovhannes A.
Pierucci, Chiara
Pietracaprina, Andrea
Pucci, Geppino
[J]. DISCRETE APPLIED MATHEMATICS, 2016, 199 : 101 - 109
[3] AN EFFICIENT ALGORITHM TO FIND A SHORTEST-PATH FOR - A CAR-LIKE ROBOT
DESAULNIERS, G
SOUMIS, F
[J]. IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1995, 11 (06): : 819 - 828
[4] A genetic algorithm for finding the k shortest paths in a network
Hamed, Ahmed Younes
[J]. EGYPTIAN INFORMATICS JOURNAL, 2010, 11 (02) : 75 - 79
[5] Implementing parallel shortest path for parallel transportation applications
Hribar, MR
Taylor, VE
Boyce, DE
[J]. PARALLEL COMPUTING, 2001, 27 (12) : 1537 - 1568
[6] A model of resilient supply chain network design: A two-stage programming with fuzzy shortest path
Kristianto, Yohanes
Gunasekaran, Angappa
Helo, Petri
Hao, Yuqiuqe
[J]. EXPERT SYSTEMS WITH APPLICATIONS, 2014, 41 (01) : 39 - 49
[7] Solving shortest path problem using particle swarm optimization
Mohemmed, Ammar W.
Sahoo, Nirod Chandra
Geok, Tan Kim
[J]. APPLIED SOFT COMPUTING, 2008, 8 (04) : 1643 - 1653
[8] Dynamic and stochastic shortest path in transportation networks with two components of travel time uncertainty
Pattanamekar, P
Park, D
Rilett, LR
Lee, J
Lee, C
[J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2003, 11 (05) : 331 - 354

← 1 →