Title
|
|
|
|
Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
|
|
Author
|
|
|
|
|
|
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. |
|
|
Language
|
|
|
|
English
|
|
Source (journal)
|
|
|
|
4 OR : a quarterly journal of operations research. - Berlin, 2003, currens
|
|
Publication
|
|
|
|
Berlin
:
Springer
,
2011
|
|
ISSN
|
|
|
|
1619-4500
[print]
1614-2411
[online]
|
|
DOI
|
|
|
|
10.1007/S10288-011-0153-0
|
|
Volume/pages
|
|
|
|
9
:2
(2011)
, p. 189-209
|
|
ISI
|
|
|
|
000290795100005
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|
Full text (publisher's version - intranet only)
|
|
|
|
|
|