A Column Generation Based Heuristic for the Dial-A-Ride Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

A Column Generation Based Heuristic for the Dial-A-Ride Problem

Abstract

The Dial-a-Ride Problem is a variant of the pickup and delivery problem with time windows, where the user inconvenience must be taken into account. In this paper, ride time and customer waiting time are modeled through both constraints and an associated penalty in the objective function. We develop a column generation approach, dynamically generating feasible vehicle routes. Handling ride time constraints explicitly in the pricing problem solver requires specific developments. Our dynamic programming approach for pricing problem makes use of a heuristic dominance rule and a heuristic enumeration procedure, which in turns implies that our overall branch-and-price procedure is a heuris-tic. However, in practice our heuristic solutions are experimentally very close to exact solutions and our approach is numerically competitive in terms of computation times.
Fichier principal
Vignette du fichier
ILSDarpHeu20.pdf (133.82 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01425755 , version 1 (03-01-2017)

Identifiers

  • HAL Id : hal-01425755 , version 1

Cite

Nastaran Rahmani, Boris Detienne, Ruslan Sadykov, François Vanderbeck. A Column Generation Based Heuristic for the Dial-A-Ride Problem. International Conference on Information Systems, Logistics and Supply Chain (ILS), Jun 2016, Bordeaux, France. ⟨hal-01425755⟩
489 View
269 Download

Share

Gmail Facebook Twitter LinkedIn More