Modified differential evolution algorithm for solving minimum spanning tree
Sanjay Jain Sandeep Kumar, Vivek Kumar Sharma, Ramesh Chandra Poonia, Narendra Pal Lamba · Journal of Information and Optimization Sciences · 2020
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.