New formulations for the traveling repairman problem with time windows

作者：

Highlights：

• Four new models for Traveling Repairman Problem with time windows are developed.

• Existing and new developed formulations are solved using symmetric and asymmetric benchmark instances.

• The results of existing and new formulations are compared in terms of CPU times and optimality gap values.

• Proposed formulations can optimally solve more benchmark instances.

摘要

•Four new models for Traveling Repairman Problem with time windows are developed.•Existing and new developed formulations are solved using symmetric and asymmetric benchmark instances.•The results of existing and new formulations are compared in terms of CPU times and optimality gap values.•Proposed formulations can optimally solve more benchmark instances.

论文关键词：Traveling repairman problem,Minimum latency problem,Routing,Time windows

论文评审过程：Received 3 October 2019, Revised 27 February 2021, Accepted 4 March 2021, Available online 10 March 2021, Version of Record 31 March 2021.

论文官网地址：https://doi.org/10.1016/j.eswa.2021.114863