Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
