Guided ejection search for the pickup and delivery problem with time windows

Authors:
Yuichi Nagata;Shigenobu Kobayashi
Affiliations:
Tokyo Institute of Technology, Interdisciplinary Graduate School of Science and Engineering, Kanagawa, Japan;Tokyo Institute of Technology, Interdisciplinary Graduate School of Science and Engineering, Kanagawa, Japan
Venue:
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
Year:
2010

Citing 7
Cited 2

Pickup and Delivery with Time Windows: Algorithms and Test Case Generation

ICTAI '01 Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence
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
A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows

INFORMS Journal on Computing
Guided Ejection Search for the Job Shop Scheduling Problem

EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows

Computers and Operations Research
A powerful route minimization heuristic for the vehicle routing problem with time windows

Operations Research Letters

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

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
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.00

Visualization

Abstract

This paper presents an efficient route minimization heuristic for the pickup and delivery problem with time windows (PDPTW) based on guided ejection search (GES). GES is a recently proposed metaheuristc framework and was first applied to the vehicle routing problem with time windows. The existence of the pickup and delivery constraint makes the feasible solution space tightly constrained and then makes the design of effective metaheuristics more difficult. We demonstrate that GES can be successfully applied to such an complicated problem. Experimental results on the Li and Lim's benchmarks demonstrate that the proposed GES algorithm outperforms existing algorithms and is able to improve 105 best-known solutions out of 298 instances.