dc.contributorUniversidad EAFIT. Departamento de Ciencias
dc.contributorMatemáticas y Aplicaciones
dc.creatorRivera, J.C.
dc.creatorMurat Afsar, H.
dc.creatorPrins, C.
dc.creatorRivera, J.C.
dc.creatorMurat Afsar, H.
dc.creatorPrins, C.
dc.date.accessioned2021-04-12T14:04:17Z
dc.date.accessioned2022-09-23T21:26:49Z
dc.date.available2021-04-12T14:04:17Z
dc.date.available2022-09-23T21:26:49Z
dc.date.created2021-04-12T14:04:17Z
dc.date.issued2016-02-16
dc.identifier03772217
dc.identifier18726860
dc.identifierWOS;000366536400008
dc.identifierSCOPUS;2-s2.0-84948719285
dc.identifierhttp://hdl.handle.net/10784/27684
dc.identifier10.1016/j.ejor.2015.08.067
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/3529903
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.
dc.languageeng
dc.publisherELSEVIER SCIENCE BV
dc.relationhttps://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.subjectMultitrip cumulative capacitated
dc.subjectSingle-vehicle routing problem
dc.subjectDisaster logistics
dc.subjectResource constrained shortest path problem
dc.titleMathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem
dc.typearticle
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typepublishedVersion


Este ítem pertenece a la siguiente institución