Show simple item record

dc.contributor.authorOnder, Gozde
dc.contributor.authorKara, Imdat
dc.contributor.authorDerya, Tusan
dc.date.accessioned2019-06-12T07:07:39Z
dc.date.available2019-06-12T07:07:39Z
dc.date.issued2017
dc.identifier.issn2352-1465
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S2352146517301771?via%3Dihub
dc.identifier.urihttp://hdl.handle.net/11727/3473
dc.description.abstractThe multiple traveling repairman problem (kTRP) is a generalization of the traveling repairman problem which is also known as the minimum latency problem and the deliveryman problem. In these problems, waiting time or latency of a customer is defined as the time passed from the beginning of the travel until this customer's service completed. The objective is to find a Hamiltonian Tour or a Hamiltonian Path that minimizes the total waiting time of customers so that each customer is visited by one of the repairmen. In this paper, we propose a new mixed integer linear programming formulation for the multiple traveling repairman problem where each repairman starts from the depot and finishes the journey at a given node. In order to see the performance of the proposed formulation against existing formulations, we conduct computational analysis by solving benchmark instances appeared in the literature. Computational results show that proposed model is extremely effective than the others in terms of CPU times. (C) 2016 The Authors. Published by Elsevieren_US
dc.language.isoengen_US
dc.relation.isversionof10.1016/j.trpro.2017.03.042en_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectTraveling repairmenen_US
dc.subjectTraveling salesmanen_US
dc.subjectMinimum latencyen_US
dc.subjectRoutingen_US
dc.subjectModelingen_US
dc.titleNew integer programming formulation for multiple traveling repairmen problemen_US
dc.typeconferenceObjecten_US
dc.relation.journal19TH EURO WORKING GROUP ON TRANSPORTATION MEETING (EWGT2016)en_US
dc.identifier.volume22en_US
dc.identifier.startpage355en_US
dc.identifier.endpage361en_US
dc.identifier.wos000404633300036


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record