An efficient GRASP+VND metaheuristic for the traveling repairman problem

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

Working Papers from University of Antwerp, Faculty of Business and Economics

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. To the best of our knowledge, this paper presents one of the first metaheuristic approaches for the traveling repairman problem.

Keywords: Traveling repairman problem; Minimum latency problem; Variable neighborhood descent; GRASP (search for similar items in EconPapers)
Pages: 17 pages
Date: 2008-05
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
https://repository.uantwerpen.be/docman/irua/ddc6e2/6efd51c8.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ant:wpaper:2008008

Access Statistics for this paper

More papers in Working Papers from University of Antwerp, Faculty of Business and Economics Contact information at EDIRC.
Bibliographic data for series maintained by Joeri Nys ().