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

Métadonnées

Licence d’utilisation du document

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]

Langue

Communication dans un congrès

Ce document a été publié dans

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

Résumé en anglais

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.< Réduire

Mots clés en anglais

static dial-a-ride problem

column generation

dynamic programming

Métadonnées

Partager cette publication !

Licence d’utilisation du document

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

Langue

Ce document a été publié dans

Résumé en anglais

Mots clés en anglais

URI

Origine

Unités de recherche