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

Authors:
Lai Mingyong;Cao Erbao
Affiliations:
College of Economics and Trade, Hunan University, Changsha 410079, China and Hunan Province Laboratory of Logistics Information and Simulation Technology, Changsha 410079, China;College of Economics and Trade, Hunan University, Changsha 410079, China and Hunan Province Laboratory of Logistics Information and Simulation Technology, Changsha 410079, China
Venue:
Engineering Applications of Artificial Intelligence
Year:
2010

Citing 7
Cited 3

Vehicle routing with pick-up and delivery: tour-partitioning heuristics

Computers and Industrial Engineering
Mechanical engineering design optimization by differential evolution

New ideas in optimization
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection

Transportation Science
Models and branch-and-cut algorithms for pickup and delivery problems with time windows

Networks
An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers

Computers and Operations Research
A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service

Computers and Operations Research

An effective and efficient differential evolution algorithm for the integrated stochastic joint replenishment and delivery model

Knowledge-Based Systems
A statistical study of discrete differential evolution approaches for the capacitated vehicle routing problem.

Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
RFID technology investment evaluation model for the stochastic joint replenishment and delivery problem

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.