RAHMANI, Nastaran; DETIENNE, Boris; SADYKOV, Ruslan; VANDERBECK, François

Metadatos

Licencia de uso del documento

RAHMANI, Nastaran
Kedge Business School [Talence]
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]

DETIENNE, Boris
Reformulations based algorithms for Combinatorial Optimization [Realopt]

SADYKOV, Ruslan
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]

Idioma

Communication dans un congrès

Este ítem está publicado en

International Conference on Information Systems, Logistics and Supply Chain (ILS), 2016-06-01, Bordeaux. 2016-04-10

Resumen en inglés

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.< Leer menos

Palabras clave en inglés

static dial-a-ride problem

column generation

dynamic programming

Metadatos

Compartir este ítem

Licencia de uso del documento

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

Idioma

Este ítem está publicado en

Resumen en inglés

Palabras clave en inglés

URI

Orígen

Centros de investigación