Skip to main content
Journal ArticleOPEN ACCESS

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

4OR (2011) 9(2) 189-209
DOI: 10.1007/s10288-011-0153-0
105Citations
Citations of this article
70Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © 2011 The Author(s).

Author supplied keywords

Cite

CITATION STYLE

APA

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. https://doi.org/10.1007/s10288-011-0153-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free