Afficher la notice abrégée

hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorRAHMANI, Nastaran
dc.date.created2014
dc.date.conference2014-02-26
dc.description.abstractEn<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>
dc.language.isofr
dc.title.enA Branch-and-Price Approach for the Dial-a-Ride Problem
dc.typeCommunication dans un congrès
dc.subject.halInformatique [cs]/Recherche opérationnelle [cs.RO]
bordeaux.conference.titleROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision
bordeaux.countryFR
bordeaux.conference.cityBordeaux
bordeaux.peerReviewedoui
hal.identifierhal-00946283
hal.version1
hal.invitednon
hal.proceedingsnon
hal.conference.organizerSociété française de recherche opérationnelle et d'aide à la décision
hal.conference.end2014-02-28
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00946283v1
bordeaux.COinSctx_ver=Z39.88-2004&amp;rft_val_fmt=info:ofi/fmt:kev:mtx:journal&amp;rft.au=RAHMANI,%20Nastaran&amp;rft.genre=unknown


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée