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 条
  • [1] An Approximation Algorithm for an Assisted Shortest Path Problem
    Montez, Christopher
    Rathinam, Sivakumar
    Darbha, Swaroop
    Casbeer, David
    Manyam, Satyanarayana Gupta
    2021 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA 2021), 2021, : 8024 - 8030
  • [2] Models and algorithm for stochastic shortest path problem
    Ji, XY
    APPLIED MATHEMATICS AND COMPUTATION, 2005, 170 (01) : 503 - 514
  • [3] Discussion on a Simplified Algorithm for the Shortest Path Problem
    Cuiyan
    Litong
    Renshupo
    2008 INTERNATIONAL WORKSHOP ON INFORMATION TECHNOLOGY AND SECURITY, 2008, : 66 - 69
  • [4] An optimized floyd algorithm for the shortest path problem
    Wei D.
    Journal of Networks, 2010, 5 (12) : 1496 - 1504
  • [5] Models and algorithm for Stochastic shortest path problem
    Ji, Xiaoyu
    Proceedings of the Third International Conference on Information and Management Sciences, 2004, 3 : 320 - 325
  • [6] Solving a shortest path problem by ant algorithm
    Fan, H
    Hua, Z
    Li, JJ
    Yuan, D
    PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 3174 - 3177
  • [7] Research on algorithm for K shortest path problem
    Zhang, Yongmei
    Han, Yan
    Bo, Chengwei
    Journal of Information and Computational Science, 2004, 1 (03): : 435 - 439
  • [8] A New Practical Algorithm for the Shortest Path Problem
    Liu, Pan
    Kou, Miao Huai
    Ping, Yu Guo
    Liang, Yin
    2008 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-23, 2008, : 4120 - +
  • [9] AN APPROXIMATION ALGORITHM FOR A SHORTEST DUBINS PATH PROBLEM
    Rathinam, Sivakumar
    Khargonekar, Pramod
    PROCEEDINGS OF THE ASME 9TH ANNUAL DYNAMIC SYSTEMS AND CONTROL CONFERENCE, 2016, VOL 2, 2017,
  • [10] A new algorithm for the shortest path problem with constraints
    Leng, Hong-ze
    Xie, Zheng
    Chen, Zhi
    Xu, Zhen
    PROCEEDINGS OF FIRST INTERNATIONAL CONFERENCE OF MODELLING AND SIMULATION, VOL II: MATHEMATICAL MODELLING, 2008, : 320 - 325
12345