Abstract
This paper presents four new enhanced DE-based algorithms for solving multi-depot vehicle routing problem with multiple pickup and delivery requests (GVRP-MDMPDR). Two enhanced DE algorithms are based on subgrouping idea and two are based on the idea of strategy switching. The four enhanced algorithms are: subgrouping mutation differential evolution (SGMDE), subgrouping crossover differential evolution (SGCDE), switching mutation differential evolution (SWMDE), and switching crossover differential evolution (SWCDE). All enhanced algorithms are compared to the classical DE algorithm for solving GVRP-MDMPDR by using published benchmark test problems. The results show that algorithms SGMDE, SGCDE and SWCDE outperform classical DE algorithm. Furthermore, it found that the enhancement in the crossover process is more effective for improving DE performance than enhancement in the mutation process. The combination of the solution representations SD1 and SD3 with the DE-based algorithms also found new best known solutions in 25 out of 30 test problem instances.
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 callMore From: International Journal of Services and Operations Management
Disclaimer: 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.
