Show simple item record

The capacitated vehicle routing problem with reloads

dc.contributor.authorKerivin, Hervé
dc.contributor.authorLacroix, Mathieu
HAL ID: 741352
ORCID: 0000-0001-8385-3890
dc.contributor.authorMahjoub, Ali Ridha
dc.contributor.authorQuilliot, Alain
dc.date.accessioned2011-04-06T10:32:41Z
dc.date.available2011-04-06T10:32:41Z
dc.date.issued2006
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/5940
dc.language.isoenen
dc.subjectbranch-and-cuten
dc.subjectmetric inequalitiesen
dc.subjectmulticommodity flowen
dc.subjectmixed integer linear programen
dc.subjectTransportation problemen
dc.subject.ddc003en
dc.titleThe capacitated vehicle routing problem with reloadsen
dc.typeCommunication / Conférence
dc.description.abstractenIn this paper, we consider a variant of the transportation problem where any demand may be dropped off elsewhere than at its destination, picked up later by the same or another vehicle, and so on until it has reached its destination. We present two mixed integer linear programming formulations based on a space-time graph. We also develop a branch-and-cut algorithm for the problem and present some computational results.en
dc.identifier.citationpages1513-1518en
dc.relation.ispartoftitleInternational Conference on Service Systems and Service Management, 2006en
dc.relation.ispartofpublnameIEEEen
dc.relation.ispartofdate2006
dc.description.sponsorshipprivateouien
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.ispartofisbn1-4244-0450-9en
dc.relation.conftitleIEEE International Conference on Service Systems and Service Management (ICSSSM’06)en
dc.relation.confdate2006-10
dc.relation.confcityTroyesen
dc.relation.confcountryFranceen
dc.identifier.doihttp://dx.doi.org/10.1109/ICSSSM.2006.320748


Files in this item

Thumbnail
Name:
capacitated.PDF
Size:
98.61Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record