Show simple item record

dc.contributor.authorKerivin, Hervé
dc.contributor.authorLacroix, Mathieu
dc.contributor.authorMahjoub, Ali Ridha
dc.contributor.authorQuilliot, Alain
dc.date.accessioned2009-10-02T13:12:31Z
dc.date.available2009-10-02T13:12:31Z
dc.date.issued2008
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/2085
dc.language.isoenen
dc.subjectReloadsen
dc.subjectPDPen
dc.subjectPickup and delivery problemen
dc.subjectBranch-and-cuten
dc.subjectMetric inequalitiesen
dc.subjectMulticommodity flowen
dc.subjectMixed-integer linear programen
dc.subjectTransportation problemsen
dc.subject.ddc003en
dc.titleThe splittable pickup and delivery problem with reloadsen
dc.typeArticle accepté pour publication ou publié
dc.contributor.editoruniversityotherUniversite Blaise Pascal – Clermont-Ferrand II;France
dc.description.abstractenIn this paper, we consider a variant of the Pickup and Delivery Problem (PDP), where any demand may be dropped off elsewhere other than its destination, picked up later by the same or another vehicle, and so on until it has reached its destination. We discuss the complexity of this problem and present two mixed-integer linear programming formulations based on a space-time graph. We describe some valid inequalities for the problem along with separation routines. Based on these results, we develop a branch-and-cut algorithm for the problem, and present some computational results.en
dc.relation.isversionofjnlnameEuropean Journal of Industrial Engineering
dc.relation.isversionofjnlvol2en
dc.relation.isversionofjnlissue2en
dc.relation.isversionofjnldate2008
dc.relation.isversionofjnlpages112-133en
dc.relation.isversionofdoihttp://dx.doi.org/10.1504/EJIE.2008.017347en
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherInderscience Enterprises Limiteden
dc.subject.ddclabelRecherche opérationnelleen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record