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 条
  • [41] Improving the shortest path finding algorithm in Apache Spark GraphX
    Trung Phan
    Phuc Do
    2ND INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND SOFT COMPUTING (ICMLSC 2018), 2015, : 67 - 71
  • [42] A Shortest Path Problem
    JIA Zhengsheng(Mathematics and Mechanics Department of Taiyuan University of technology Taiyuan 030024)FAN Hui(Foundation Department Shan Xi Mining Industry institute
    JournalofSystemsScienceandSystemsEngineering, 1996, (04) : 496 - 499
  • [43] A new algorithm for the discrete fuzzy shortest path problem in a network
    Chuang, TN
    Kung, JY
    APPLIED MATHEMATICS AND COMPUTATION, 2006, 174 (01) : 660 - 668
  • [44] Models and algorithm for generalized shortest path problem in uncertain environment
    Li, Fei
    Proceedings of the Fifth International Conference on Information and Management Sciences, 2006, 5 : 377 - 382
  • [45] An exact algorithm for the robust shortest path problem with interval data
    Montemanni, R
    Gambardella, LM
    COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (10) : 1667 - 1680
  • [46] A genetic algorithm for shortest path routing problem and the sizing of populations
    Ahn, CW
    Ramakrishna, RS
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (06) : 566 - 579
  • [47] A SHORTEST AUGMENTING PATH ALGORITHM FOR THE SEMI-ASSIGNMENT PROBLEM
    KENNINGTON, J
    WANG, Z
    OPERATIONS RESEARCH, 1992, 40 (01) : 178 - 187
  • [48] A genetic algorithm for the fuzzy shortest path problem in a fuzzy network
    Lin, Lihua
    Wu, Chuzheng
    Ma, Li
    COMPLEX & INTELLIGENT SYSTEMS, 2021, 7 (01) : 225 - 234
  • [49] A Fast Exact Algorithm for the Resource Constrained Shortest Path Problem
    Ahmadi, Saman
    Tack, Guido
    Harabor, Daniel
    Kilby, Philip
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 12217 - 12224
  • [50] A heuristic genetic algorithm for the single source shortest path problem
    Hasan, Basela S.
    Khamees, Mohammad A.
    Mahmoud, Ashraf S. Hasan
    2007 IEEE/ACS INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS, VOLS 1 AND 2, 2007, : 187 - +
12345