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
相关论文
共 50 条
  • [31] A SUCCESSIVE SHORTEST-PATH ALGORITHM FOR THE ASSIGNMENT PROBLEM
    ENGQUIST, M
    INFOR, 1982, 20 (04) : 370 - 384
  • [32] An efficient algorithm for linear fractional shortest path problem
    Roan, J
    PROCEEDINGS OF THE TWENTY-SEVENTH ANNUAL MEETING OF THE WESTERN DECISION SCIENCES INSTITUTE, 1998, : 639 - 643
  • [33] An Improved Physarum polycephalum Algorithm for the Shortest Path Problem
    Zhang, Xiaoge
    Wang, Qing
    Adamatzky, Andrew
    Chan, Felix T. S.
    Mahadevan, Sankaran
    Deng, Yong
    SCIENTIFIC WORLD JOURNAL, 2014,
  • [34] A Parallel Genetic Algorithm for Shortest Path Routing Problem
    Yussof, Salman
    Razali, Rina Azlin
    See, Ong Hang
    INTERNATIONAL CONFERENCE ON FUTURE COMPUTER AND COMMUNICATIONS, PROCEEDINGS, 2009, : 268 - 273
  • [35] Developing a Genetic Algorithm for Solving Shortest Path Problem
    Behzadi, Saeed
    Alesheikh, Ali A.
    NEW ASPECTS OF URBAN PLANNING AND TRANSPORTATION, 2008, : 28 - 32
  • [36] SUCCESSIVE SHORTEST PATH ALGORITHM FOR THE ASSIGNMENT PROBLEM.
    Engquist, Michael
    INFOR Journal, 1982, 20 (04): : 370 - 384
  • [37] An incremental algorithm for a generalization of the shortest-path problem
    Ramalingam, G
    Reps, T
    JOURNAL OF ALGORITHMS, 1996, 21 (02) : 267 - 305
  • [38] An Efficient Algorithm for the Shortest Path Problem with Forbidden Paths
    Hsu, Chiun-Chieh
    Chen, Da-Ren
    Ding, Hua-Yuan
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PROCEEDINGS, 2009, 5574 : 638 - +
  • [39] A new exact algorithm for the shortest path problem: An optimized shortest distance matrix
    Yuan, Huilin
    Hu, Jianlu
    Song, Yufan
    Li, Yanke
    Du, Jie
    COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 158
  • [40] Improving the Performance of Arrival on Time in Stochastic Shortest Path Problem
    Wu, Yaoxin
    Chen, Wei
    Zhang, Xuexi
    Liao, Guangjun
    2016 IEEE 19TH INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS (ITSC), 2016, : 2346 - 2353
12345