Mostrar el registro sencillo del ítem

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

hal.structure.identifierKedge Business School [Talence]
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
dc.contributor.authorRAHMANI, Nastaran
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
dc.contributor.authorDETIENNE, Boris
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorSADYKOV, Ruslan
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
dc.contributor.authorVANDERBECK, François
dc.date.accessioned2024-04-04T03:11:58Z
dc.date.available2024-04-04T03:11:58Z
dc.date.issued2016-04-10
dc.date.conference2016-06-01
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/193819
dc.description.abstractEnThe 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.
dc.language.isoen
dc.subject.enstatic dial-a-ride problem
dc.subject.encolumn generation
dc.subject.endynamic programming
dc.title.enA Column Generation Based Heuristic for the Dial-A-Ride Problem
dc.typeCommunication dans un congrès
dc.subject.halInformatique [cs]/Recherche opérationnelle [cs.RO]
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleInternational Conference on Information Systems, Logistics and Supply Chain (ILS)
bordeaux.countryFR
bordeaux.conference.cityBordeaux
bordeaux.peerReviewedoui
hal.identifierhal-01425755
hal.version1
hal.invitednon
hal.proceedingsoui
hal.conference.end2016-06-04
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-01425755v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2016-04-10&rft.au=RAHMANI,%20Nastaran&DETIENNE,%20Boris&SADYKOV,%20Ruslan&VANDERBECK,%20Fran%C3%A7ois&rft.genre=unknown


Archivos en el ítem

ArchivosTamañoFormatoVer

No hay archivos asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem