Sergio Luis Pérez-Pérez, Luis Eduardo Urbán Rivero, R. López-Bracho, F. Martínez
{"title":"A fast 4-approximation algorithm for the traveling repairman problem on a line","authors":"Sergio Luis Pérez-Pérez, Luis Eduardo Urbán Rivero, R. López-Bracho, F. Martínez","doi":"10.1109/ICEEE.2014.6978272","DOIUrl":null,"url":null,"abstract":"The traveling repairman problem is a scheduling problem in which a repairman is supposed to visit some customers at their locations to perform some jobs. Each customer has a time window during which the repairman is allowed to arrive to perform the jobs. The goal is to maximize the number of visited locations. In this work we deal with a special case in which the locations are on a line, the processing time of each job is zero, and the time window length is unitary. Although the general TRP is NP-Hard, the complexity of this special case remains unknown. We introduce a quadratic 4-approximation algorithm based on the 8-approximation algorithm proposed in 2005 by R. Bar-Yehuda, G. Even, and S. Shahar.","PeriodicalId":6661,"journal":{"name":"2014 11th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE)","volume":"1 1","pages":"1-4"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 11th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEEE.2014.6978272","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
The traveling repairman problem is a scheduling problem in which a repairman is supposed to visit some customers at their locations to perform some jobs. Each customer has a time window during which the repairman is allowed to arrive to perform the jobs. The goal is to maximize the number of visited locations. In this work we deal with a special case in which the locations are on a line, the processing time of each job is zero, and the time window length is unitary. Although the general TRP is NP-Hard, the complexity of this special case remains unknown. We introduce a quadratic 4-approximation algorithm based on the 8-approximation algorithm proposed in 2005 by R. Bar-Yehuda, G. Even, and S. Shahar.
旅行修理工问题是一个安排问题，在这个问题中，修理工应该去客户所在的地方拜访一些客户，完成一些工作。每个客户都有一个时间窗口，在此期间，修理工被允许到达并执行工作。目标是最大化访问地点的数量。在本工作中，我们处理了一种特殊情况，其中位置在一条线上，每个作业的处理时间为零，时间窗口长度是酉的。虽然一般的TRP是NP-Hard，但这种特殊情况的复杂性仍然未知。在R. Bar-Yehuda、G. Even和S. Shahar 2005年提出的8近似算法的基础上，引入了一种二次4近似算法。
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
