Abstract | ||
---|---|---|
In this paper, we study an extension of the PVRP where the vehicles can renew their capacity at some intermediate facilities. Each vehicle returns to the depot only when its work shift is over. For this problem we propose a tabu search (TS) algorithm and present computational results on a set of randomly generated instances and on a set of PVRP instances taken from the literature. |
Year | DOI | Venue |
---|---|---|
2002 | 10.1016/S0377-2217(01)00206-5 | European Journal of Operational Research |
Keywords | Field | DocType |
Periodic vehicle routing,Intermediate facilities,Renewable capacity,Heuristics,Tabu search | Mathematical optimization,Periodic vehicle routing problem,Work shift,Heuristics,Tabu search,Mathematics,Operations management | Journal |
Volume | Issue | ISSN |
137 | 2 | 0377-2217 |
Citations | PageRank | References |
66 | 3.92 | 11 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Enrico Angelelli | 1 | 291 | 20.58 |
Maria Grazia Speranza | 2 | 1217 | 77.86 |