Show simple item record

dc.contributor.authorRodríguez-Martín, I.en_US
dc.contributor.authorSalazar-González, J. -J.en_US
dc.contributor.authorYaman, Handeen_US
dc.date.accessioned2020-01-31T18:13:44Z
dc.date.available2020-01-31T18:13:44Z
dc.date.issued2019en_US
dc.identifier.issn0377-2217
dc.identifier.urihttp://hdl.handle.net/11693/52966
dc.description.abstractThe Periodic Vehicle Routing Problem is a generalization of the classical capacitated vehicle routing problem in which routes are determined for a planning horizon of several days. Each customer has an associated set of allowable visit schedules, and the objective of the problem is to design a set of minimum cost routes that give service to all the customers respecting their visit requirements. In this paper we study a new variant of this problem in which we impose that each customer should be served by the same vehicle/driver at all visits. We call this problem the Periodic Vehicle Routing Problem with Driver Consistency. We present an integer linear programming formulation for the problem and derive several families of valid inequalities. We solve it using an exact branch-and-cut algorithm, and show computational results on a wide range of randomly generated instances.en_US
dc.language.isoEnglishen_US
dc.source.titleEuropean Journal of Operational Researchen_US
dc.relation.isversionofhttps://dx.doi.org/10.1016/j.ejor.2018.08.032en_US
dc.subjectRoutingen_US
dc.subjectPeriodic vehicle routingen_US
dc.subjectDriver consistencyen_US
dc.subjectValid inequalitiesen_US
dc.subjectBranch-and-cuten_US
dc.titleThe periodic vehicle routing problem with driver consistencyen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage575en_US
dc.citation.epage584en_US
dc.citation.volumeNumber273en_US
dc.citation.issueNumber2en_US
dc.identifier.doi10.1016/j.ejor.2018.08.032en_US
dc.publisherElsevieren_US
dc.contributor.bilkentauthorYaman, Hande
dc.embargo.release2021-03-01


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record