Show simple item record

dc.contributor.authorNucamendi-Guillén, Samueles
dc.date.accessioned2017-10-24T22:37:16Z
dc.date.available2017-10-24T22:37:16Z
dc.date.issued2016
dc.identifier.issn0160-5682
dc.identifier.urihttps://hdl.handle.net/20.500.12552/849
dc.identifier.urihttp://dx.doi.org/10.1057/jors.2015.113
dc.description.abstractIn this paper, we study a k-Travelling Repairmen Problem where the objective is to minimize the sum of clients waiting time to receive service. This problem is relevant in applications that involve distribution of humanitarian aid in disaster areas, delivery and collection of perishable products and personnel transportation, where reaching demand points to perform service, fast and fair, is a priority. This paper presents a new mixed integer formulation and a simple and efficient metaheuristic algorithm. The proposed formulation consumes less computational time and allows solving to optimality more than three times larger data instances than the previous formulation published in literature, even outperforming a recently published Branch and Price and Cut algorithm for this problem. The proposed metaheuristic algorithm solved to optimality 386 out of 389 tested instances in a very short computational time. For larger instances, the algorithm was assessed using the best results reported in the literature for the Cumulative Capacitated Vehicle Routing Problem. © 2016 Operational Research Society Ltd. All rights reserved.en
dc.description.statementofresponsibilityEstudiantes
dc.description.statementofresponsibilityMaestros
dc.language.isoeng
dc.rights.urihttp://www.sherpa.ac.uk/romeo/search.php
dc.titleA mixed integer formulation and an efficient metaheuristic procedure for the k-Travelling Repairmen Problem
dc.typeArticles


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