Investigating the use of metaheuristics for solving single vehicle routing problems with time-varying traversal costs

Journal of the Operational Research Society

Volumn 64, Issue 1, 2013, Pages 34-47

  Harwood, K ^a   Mumford, C ^a   Eglese, R ^b  

^a CARDIFF UNIVERSITY   (United Kingdom)

^b LANCASTER UNIVERSITY MANAGEMENT SCHOOL   (United Kingdom)

Author keywords

2 Opt; congestion; Road Timetable; time varying; vehicle routing

Indexed keywords

ITERATIVE METHODS; ROADS AND STREETS; SIMULATED ANNEALING; TABU SEARCH; TRAFFIC CONGESTION; TRAVELING SALESMAN PROBLEM; VEHICLES;

2-OPT; CONGESTION; ITERATIVE IMPROVEMENTS; META HEURISTIC ALGORITHM; ROAD TIMETABLE; TIME VARYING; TRAVELLING SALESMAN PROBLEM; VEHICLE ROUTING PROBLEMS;

VEHICLE ROUTING;

EID: 84870715130     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2012.17     Document Type: Article

References (11)

1. Dijkstra EW (1959). A note on two problems in connexion with graphs. Numerische Mathematik 1(1): 269-271.
2. Dreyfus SE (1969). An appraisal of some shortest-path algorithms. Operations Research 17(3): 395-412.
3. Eglese R, Maden W and Slater A (2006). A road timetablet to aid vehicle routing and scheduling. Computers & Operations Research 33(12): 3508-3519.
4. Fisher ML, Greenfield AJ, Jaikuman R and Lester JT (1982). A computerized vehicle routing application. Interfaces 12(4): 42-52.
5. Hill A, Mabert V and Montgomory D (1988). A decision support system for the courier vehicle scheduling problem. Omega International Journal of Management Science 16(4): 333-345.
6. Horn MET (2000). Efficient modeling of travel in networks with time-varying link speeds. Networks 36(2): 80-90.
7. Ichoua S, Gendreau M and Potvin JY (2003). Vehicle dispatching with time-dependent travel times. European Journal of Operations Research 144(2): 379-396.
8. Kaufman DE and Smith RL (1993). Fastest paths in timedependent networks for intelligent vehicle-highway systems application. Journal of Intelligent Transportation Systems 1(1): 1-11.
9. Kok AL, Hans EW and Schutten JMJ (2009). Vehicle routing under time dependent travel times: The impact of congestion avoidance. Internal Report, University of Twente.
10. Malandraki C and Dial RB (1996). A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem. European Journal of Operations Research 90(1): 45-55.
11. Sung K, Bell MGH, Seong M and Park S (2000). Shortest paths in a network with time-dependent flow speeds. European Journal of Operations Research 121(1): 32-39.