An efficient GRASP+VND metaheuristic for the traveling repairman problem
AbstractThe 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by University of Antwerp, Faculty of Applied Economics in its series Working Papers with number 2008008.
Length: 17 pages
Date of creation: May 2008
Date of revision:
Contact details of provider:
Postal: Prinsstraat 13, B-2000 Antwerpen
Web page: https://www.uantwerp.be/en/faculties/applied-economic-sciences/
More information through EDIRC
Traveling repairman problem; Minimum latency problem; Variable neighborhood descent; GRASP;
This paper has been announced in the following NEP Reports:
- NEP-ALL-2008-06-21 (All new papers)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Zhang, Zizhen & Qin, Hu & Zhu, Wenbin & Lim, Andrew, 2012. "The single vehicle routing problem with toll-by-weight scheme: A branch-and-bound approach," European Journal of Operational Research, Elsevier, Elsevier, vol. 220(2), pages 295-304.
- Yu, Mingzhu & Qi, Xiangtong, 2014. "A vehicle routing problem with multiple overlapped batches," Transportation Research Part E: Logistics and Transportation Review, Elsevier, Elsevier, vol. 61(C), pages 40-55.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joeri Nys).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.