학술논문
An ILP approach for the traveling repairman problem with unit time windows
Document Type
Conference
Source
2015 12th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE) Electrical Engineering, Computing Science and Automatic Control (CCE), 2015 12th International Conference on. :1-5 Oct, 2015
Subject
Language
Abstract
We introduce an integer linear programming formulation for the Traveling Repairman Problem with unit time windows, which produces approximate solutions within a factor of 4 to the optimal solution. We analyze empirically the required time to solve this formulation using a state-of-the-art MIP solver. Finally, we discuss an extension to our approach to windows of arbitrary length.