Modified differential evolution algorithm for solving minimum spanning tree

被引：4
|
作者：
Jain, Sanjay [1 ]
Kumar, Sandeep [1 ]
Sharma, Vivek Kumar [2 ]
Poonia, Ramesh C. [3 ]
Lamba, Narendra Pal [4 ]
机构：
[1] Amity Univ Jaipur, Dept Comp Sci & Engn, Jaipur 302002, Rajasthan, India
[2] Jagannath Univ, Dept Engn & Technol, Jaipur 303901, Rajasthan, India
[3] Norwegian Univ Sci & Technol, Fac Informat Technol & Elect Engn, Dept ICT & Nat Sci, Cyber Phys Syst Lab, Alesund, Norway
[4] Amity Univ Jaipur, Dept Chem, Jaipur 302002, Rajasthan, India
来源：
JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES | 2020年 / 41卷 / 02期
关键词：
Evolutionary intelligence; Optimization; Path planning; Nature inspired algorithm;
D O I：
10.1080/02522667.2020.1733195
中图分类号：
G25 [图书馆学、图书馆事业]; G35 [情报学、情报工作];
学科分类号：
1205 ; 120501 ;
摘要：
Differential evolution (DE) is a stochastic approach based on the concept of natural evolution. It is very simple and robust evolutionary algorithm. DE has three simple steps and it is easy to implement. It is a popular meta-heuristics that efficiently solved various complex optimization problems. This paper addressed the minimum spanning tree problem. Here a new variant of DE with new scaling factor inspired by peregrine preying pattern. In addition to new scaling factor it make use of global best solution for updating current solution. Results shows that modified DE performs significantly better than other competitive algorithms for considered minimum spanning tree.
引用
收藏
页码：633 / 639
页数：7
相关论文
共 50 条
  • [1] A Memetic Algorithm for Solving the Generalized Minimum Spanning Tree Problem
    Pop, Petrica
    Matei, Oliviu
    Sabo, Cosmin
    [J]. SOFT COMPUTING IN INDUSTRIAL APPLICATIONS, 2011, 96 : 187 - 194
  • [2] A Parallel Genetic Algorithm for Solving the Probabilistic Minimum Spanning Tree Problem
    Wang, Zhurong
    Yu, Changqing
    Hei, Xinhong
    Zhang, Bin
    [J]. 2013 9TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2013, : 61 - 65
  • [3] Solving degree-constrained minimum spanning tree with a new algorithm
    Ning Ai-bing
    Ma Liang
    Xiong Xiao-hua
    [J]. PROCEEDINGS OF 2007 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING (14TH) VOLS 1-3, 2007, : 381 - 386
  • [4] Distributed minimum spanning tree differential evolution for multimodal optimization problems
    Zi-Jia Wang
    Zhi-Hui Zhan
    Jun Zhang
    [J]. Soft Computing, 2019, 23 : 13339 - 13349
  • [5] Solving the Quadratic Minimum Spanning Tree Problem
    Cordone, Roberto
    Passeri, Gianluca
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2012, 218 (23) : 11597 - 11612
  • [6] Distributed minimum spanning tree differential evolution for multimodal optimization problems
    Wang, Zi-Jia
    Zhan, Zhi-Hui
    Zhang, Jun
    [J]. SOFT COMPUTING, 2019, 23 (24) : 13339 - 13349
  • [7] An algorithm for solving the minimum vertex ranking spanning tree problem on interval graphs
    Nakayama, SI
    Masuyama, S
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2003, E86A (05): : 1019 - 1026
  • [8] A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
    Ursulenko, Oleksii
    Butenko, Sergiy
    Prokopyev, Oleg A.
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2013, 56 (03) : 1029 - 1043
  • [9] A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
    Oleksii Ursulenko
    Sergiy Butenko
    Oleg A. Prokopyev
    [J]. Journal of Global Optimization, 2013, 56 : 1029 - 1043
  • [10] Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
    Haouari, M
    Chaouachi, J
    Dror, M
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2005, 56 (04) : 382 - 389
12345