Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem

Authors:
Andrea Attanasio;Jean-François Cordeau;Gianpaolo Ghiani;Gilbert Laporte
Affiliations:
Centro di Eccellenza sul Calcolo ad Alte Prestazioni, Università degli Studi della Calabria, 87030 Rende (CS), Italy;Canada Research Chair in Distribution Management, HEC Montréal 3000 Chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7;Dipartimento di Ingegneria dell'Innovazione, Università degli Studi di Lecce, 73100 Lecce, Italy;Canada Research Chair in Distribution Management, HEC Montréal 3000 Chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7
Venue:
Parallel Computing
Year:
2004

Citing 1
Cited 9

MPI-The Complete Reference, Volume 1: The MPI Core

MPI-The Complete Reference, Volume 1: The MPI Core

Dynamic vehicle routing using genetic algorithms

Applied Intelligence
Collective intelligence for demand-responsive transportation systems: a self organization model

NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
Online scheduling of pick-up and delivery tasks in hospitals

Journal of Biomedical Informatics
Bringing Robustness to Patient Flow Management Through Optimized Patient Transports in Hospitals

Interfaces
A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery

Computers and Operations Research
Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports

Computers and Operations Research
Local search heuristics for the probabilistic dial-a-ride problem

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

INFORMS Journal on Computing
Analysis and evaluation of the slugging form of ridesharing

Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the Dial-a-Ride problem (DARP) users specify transportation requests between origins and destinations to be served by vehicles. In the dynamic DARP, requests are received throughout the day and the primary objective is to accept as many requests as possible while satisfying operational constraints. This article describes and compares a number of parallel implementations of a Tabu search heuristic previously developed for the static DARP, i.e., the variant of the problem where all requests are known in advance. Computational results show that the proposed algorithms are able to satisfy a high percentage of user requests.