Publicación:
Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem

Vista sencilla de ítem
dc.citation.journalTitleEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
dc.contributor.authorRivera, J.C.
dc.contributor.authorMurat Afsar, H.
dc.contributor.authorPrins, C.
dc.contributor.departmentUniversidad EAFIT. Departamento de Cienciasspa
dc.contributor.researchgroupMatemáticas y Aplicacionesspa
dc.date.accessioned2021-04-12T14:04:17Z
dc.date.available2021-04-12T14:04:17Z
dc.date.issued2016-02-16
dc.description.abstractThis paper addresses the multitrip Cumulative Capacitated Single-Vehicle Routing Problem (mt-CCSVRP). In this problem inspired by disaster logistics, a single vehicle can perform successive trips to serve a set of affected sites and minimize an emergency criterion, the sum of arrival times. Two mixed integer linear programs, a flow-based model and a set partitioning model, are proposed for small instances with 20 sites. An exact algorithm for larger cases transforms the mt-CCSVRP into a resource-constrained shortest path problem where each node corresponds to one trip and the sites to visit become resources. The resulting problem can be solved via an adaptation of Bellman-Ford algorithm to a directed acyclic graph with resource constraints and a cumulative objective function. Seven dominance rules, two upper bounds and five lower bounds speed up the procedure. Computational results on instances derived from classical benchmark problems for the capacitated VRP indicate that the exact algorithm outperforms a commercial MIP solver on small instances and can solve cases with 40 sites to optimality. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.eng
dc.identifierhttps://eafit.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=1685
dc.identifier.doi10.1016/j.ejor.2015.08.067
dc.identifier.issn03772217
dc.identifier.issn18726860
dc.identifier.otherWOS;000366536400008
dc.identifier.otherSCOPUS;2-s2.0-84948719285
dc.identifier.urihttps://hdl.handle.net/10784/27684
dc.language.isoeng
dc.publisherELSEVIER SCIENCE BV
dc.relation.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84948719285&doi=10.1016%2fj.ejor.2015.08.067&partnerID=40&md5=d7ab7610f73371d213c02cab28a1d04e
dc.rightshttps://v2.sherpa.ac.uk/id/publication/issn/0377-2217
dc.sourceEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
dc.subject.keywordMultitrip cumulative capacitatedeng
dc.subject.keywordSingle-vehicle routing problemeng
dc.subject.keywordDisaster logisticseng
dc.subject.keywordResource constrained shortest path problemeng
dc.titleMathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem
dc.typeinfo:eu-repo/semantics/article
dc.type.coarversionhttp://purl.org/coar/resource_type/c_6501
dc.type.localArtículospa
dc.type.redcolhttp://purl.org/redcol/resource_type/ARTREF
dc.type.versioninfo:eu-repo/semantics/publishedVersion
dspace.entity.typePublication

Archivos

Bloque original
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
1-s2.0-S0377221715008267-main.pdf
Tamaño:
647.7 KB
Formato:
Adobe Portable Document Format
Descripción:
Descargar

Colecciones

Artículos