RAHMANI, Nastaran

Métadonnées

Afficher la notice complète

Licence d’utilisation du document

RAHMANI, Nastaran
Institut de Mathématiques de Bordeaux [IMB]

Langue

Communication dans un congrès

Ce document a été publié dans

ROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, 2014-02-26, Bordeaux.

Résumé en anglais

<p>The Dial-a-Ride Problem (DARP) is a variant of the pickup and delivery problem where people has to be transported between an origin and a destination. In the transportation of people, not only the operational costs are minimized, but also the user inconvenience. The door-to-door transportation services for elderly and disabled people together with the shuttle bus service connecting airports and customer homes are some applications of DARP. In this talk, we consider two mathematical formulations of the problem and their solution using a branch-and-price algorithm. We discuss different dynamic programming approaches to solve the pricing problem and some stabilization techniques. Our contribution is in the comparative performance analysis.</p> <p> </p>< Réduire

Origine

Importé de hal

Unités de recherche

Institut de Mathématiques de Bordeaux (IMB) - UMR 5251