A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem

Authors:
Gerardo Berbeglia;Jean-François Cordeau;Gilbert Laporte
Affiliations:
HEC Montréal, Montréal, Québec H3T 2A7, Canada;Department of Operations Management and Logistics, HEC Montréal, Montréal, Québec H3T 2A7, Canada;Department of Management Sciences, HEC Montréal, Montréal, Québec H3T 2A7, Canada
Venue:
INFORMS Journal on Computing
Year:
2012

Citing 11
Cited 1

Constraint satisfaction in logic programming

Constraint satisfaction in logic programming
A tabu search heuristic for the vehicle routing problem

Management Science
Tabu Search

Tabu Search
Optimal On-Line Algorithms for Single-Machine Scheduling

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Hybrid Exact Algorithm for the TSPTW

INFORMS Journal on Computing
Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem

Parallel Computing
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem

Operations Research
The Dynamic Assignment Problem

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

Networks
Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming

Transportation Science
A parallel iterated tabu search heuristic for vehicle routing problems

Computers and Operations Research

Large neighborhood search for dial-a-ride problems

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a hybrid algorithm for the dynamic dial-a-ride problem in which service requests arrive in real time. The hybrid algorithm combines an exact constraint programming algorithm and a tabu search heuristic. An important component of the tabu search heuristic consists of three scheduling procedures that are executed sequentially. Experiments show that the constraint programming algorithm is sometimes able to accept or reject incoming requests, and that the hybrid method outperforms each of the two algorithms when they are executed alone.