A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem

By Jean-François Cordeau, Gilbert Laporte. 2002

728 citations recorded by the source corpus.

Subfields: Automotive Engineering, Building and Construction, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/a877bcbc18fadbed769403388eecf1705859e0c8

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Automotive Engineering

In Building and Construction

In Industrial and Manufacturing Engineering

Citations in the corpus

T-share: A large-scale dynamic taxi ridesharing service (2013, methodology): “As in [8][16], here we assume that the order of points in the current schedule remains intact when inserting a new query to the schedule.”
The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms (2003, background): “The latest heuristic on the multi-vehicle static DARP is due to Cordeau and Laporte (2002).”
Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows (2007, neutral): “We present in Table 6 the solution values and computing times for the Cordeau and Laporte [7] tabu search heuristic for the DARP.”
Static pickup and delivery problems: a classification scheme and survey (2007, background): “ Cordeau and Laporte (2003b) have developed a tabu search heuristic for the DARP with time windows, where the objective is to minimize routing costs.”
Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies (2003, background): “Customers can book a trip one day in advance (static customers) [17] or make a request at short notice (dynamic customers) [18,19].”
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem (2006, methodology): “For recent overviews of the DARP and VRPPD, the reader is referred to the surveys of Cordeau and Laporte (2003a) and Desaulniers et al. (2002), respectively.”
Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care (2013, neutral): “…1986), (Madsen, et al., 1995), (Diana and Dessouky, 2004), (Lu and Dessouky, 2006) presented various insertion-based heuristics for solving the PDPTW. ( P. Toth and Vigo, 1997b) (Nanry and Wesley Barnes, 2000) (J.-F. Cordeau and Laporte, 2003) solved the PDPTW by means of tabu search heuristics.”