DocumentCode
3713112
Title
An ILP approach for the traveling repairman problem with unit time windows
Author
Yani Miguel-Pilar;Guillermo Morales-Luna;Feli? Sagols Troncoso;Francisco Javier Zaragoza Mart?nez
Author_Institution
Computer Science Department, CINVESTAV-IPN, Mexico City, Mexico
fYear
2015
Firstpage
1
Lastpage
5
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.
Keywords
"Mathematical model","Cities and towns","Integer linear programming","Linear programming","Approximation methods","Approximation algorithms","Yttrium"
Publisher
ieee
Conference_Titel
Electrical Engineering, Computing Science and Automatic Control (CCE), 2015 12th International Conference on
Type
conf
DOI
10.1109/ICEEE.2015.7357940
Filename
7357940
Link To Document