New enhanced differential evolution algorithms for solving multi-depot vehicle routing problem with multiple pickup and delivery requests
by Siwaporn Kunnapapdeelert; Voratas Kachitvichyanukul
International Journal of Services and Operations Management (IJSOM), Vol. 31, No. 3, 2018

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.

Online publication date: Thu, 11-Oct-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Services and Operations Management (IJSOM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com