A memetic algorithm for the pickup and delivery problem with time windows using selective route exchange crossover

Authors:
Yuichi Nagata;Shigenobu Kobayashi
Affiliations:
Interdisciplinary Graduate School of Science and Engineering, Tokyo Institute of Technology, Yokohama, Kanagawa, Japan;Interdisciplinary Graduate School of Science and Engineering, Tokyo Institute of Technology, Yokohama, Kanagawa, Japan
Venue:
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Year:
2010

Citing 10
Cited 1

Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
A Metaheuristic for the Pickup and Delivery Problem with Time Windows

ICTAI '01 Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
Active guided evolution strategies for large-scale vehicle routing problems with time windows

Computers and Operations Research
A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows

Computers and Operations Research
A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows

Computers and Operations Research
A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows

Networks - Route 2007
Efficient local search limitation strategies for vehicle routing problems

EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Guided ejection search for the pickup and delivery problem with time windows

EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows

Discrete Optimization

The pickup and delivery problem with cross-docking opportunity

ICCL'11 Proceedings of the Second international conference on Computational logistics

Quantified Score

Hi-index	0.01

Visualization

Abstract

The pickup and delivery problem with time windows (PDP TW) is a variant of the vehicle routing problem. In this paper, we present an memetic algorithm (MA) for the PDPTW. Particular attention is paid to the design of the crossover because it is usually very hard to design an effective crossover operator for tightly constrained problems such as the PDPTW. Experimental results on Li and Lim's benchmarks demonstrate that our MA is competitive with existing approaches and improves 146 best-known solutions out of 298 instances.