An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows

• Published in: Engineering applications of artificial intelligence Vol. 23; no. 2; pp. 188 - 195
• Main Authors: Mingyong, Lai, Erbao, Cao
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.03.2010
• Subjects: Distribution management; Improved differential evolution (IDE); Integer programming; Optimization; Reverse logistics; VRP-SPDTW; VRP-SPDTW; Integer programming; Distribution management; Improved differential evolution (IDE); Optimization; Reverse logistics
• ISSN: 0952-1976; 1873-6769
• DOI: 10.1016/j.engappai.2009.09.001

The vehicle routing problem with simultaneous pickups and deliveries and time windows (VRP-SPDTW) is the problem of optimally integrating forward (good distribution) and reverse logistics (returning materials) for cost saving and environmental protection. We constructed a general mixed integer programming model of VRP-SPDTW. The model contained some classical vehicle routing problems as special cases. We proposed an improved differential evolution algorithm (IDE) for solving this problem. In the algorithm, we firstly adopted the novel decimal coding to construct an initial population, then used some improved differential evolution operators unlike the existing algorithm, and in mutation operation, we used an integer order criterion based on natural number coding method. We introduced a penalty technical to publish the infeasible solution. In addition, in the crossover operation, we designed a self-adapting crossover probability that varied with iteration. We did some numerical experiments, and the results showed that the proposed method is effective for solving VRP-SPDTW.