Portal de Periódicos da CAPES

Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem

2011; Springer Science+Business Media; Volume: 9; Issue: 2 Linguagem: Inglês

10.1007/s10288-011-0153-0

1619-4500

Amir Salehipour, Kenneth Sörensen, Peter Goos, Olli Bräysy,

Optimization and Packing Problems

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.