An efficient GRASP+VND metaheuristic for the traveling repairman problem
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.
|Date of creation:||May 2008|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: https://www.uantwerp.be/en/faculties/applied-economic-sciences/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:ant:wpaper:2008008. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joeri Nys)
If references are entirely missing, you can add them using this form.