2011-06-01
Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
Publication
Publication
4OR , Volume 9 - Issue 2 p. 189- 209
The traveling repairman problem is a customer-centric routing problem, in which the total waiting time of the customers is minimized, rather than the total travel time of a vehicle. To date, research on this problem has focused on exact algorithms and approximation methods. This paper presents the first metaheuristic approach for the traveling repairman problem.
| Additional Metadata | |
|---|---|
| , , , , | |
| doi.org/10.1007/s10288-011-0153-0, hdl.handle.net/1765/26306 | |
| 4OR | |
| Organisation | Erasmus School of Economics |
|
Salehipour, A., Sörensen, K., Goos, P., & Bräysy, O. (2011). Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem. 4OR, 9(2), 189–209. doi:10.1007/s10288-011-0153-0 |
|
