A visual interactive approach to vehicle routing

Computers and Operations Research

Volumn 30, Issue 3, 2003, Pages 321-337

  Baker, Barrie M ^a   Carreto, Carlos A C ^b  

^a Institute for Clean Growth and Future Mobility   (United Kingdom)

^b POLYTECHNIC INSTITUTE OF GUARDA   (Portugal)

Author keywords

GRASP; Heuristics; Routing

Indexed keywords

GRAPHICAL USER INTERFACES; HEURISTIC METHODS; PROBLEM SOLVING; VEHICLES;

VEHICLE ROUTING PROBLEMS (VRP);

OPERATIONS RESEARCH;

FREIGHT TRANSPORT; PLANNING METHOD; ROUTING; TRAFFIC MANAGEMENT; VISUAL ANALYSIS;

EID: 0037647744     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(01)00099-5     Document Type: Article

References (19)

1. Laporte G. The vehicle routing problem: an overview of exact and approximate algorithms. European Journal of Operational Research 1992;59:345-58.
2. Laporte G, Osman IH. Routing problems: a bibliography. Annals of Operations Research 1995;61:227-62.
3. Osman IH. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Operations Research 1993;41:421-51.
4. Taillard É. Parallel iterative search methods for vehicle routing problems. Networks 1993;23:661-73.
5. Gendreau M, Hertz A, Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science 1994;40:1276-90.
6. Rochat Y, Taillard É. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1995;1:147-67.
7. Hiquebran DT, Alfa AS, Shapiro A, Gittoes DH. A revised simulated annealing and cluster-first route-second algorithm applied to the vehicle routing problem. Engineering Optimization 1994;22:77-107.
8. Fisher ML, Jaikumar R. A generalized assignment heuristic for vehicle routing. Networks 1981;11:109-24.
9. Baker BM. Further improvements to vehicle routing heuristics. Journal of the Operational Research Society 1992;43:1009-12.
10. Baker BM, Sheasby JE. Extensions to the generalized assignment heuristic for vehicle routing. European Journal of Operational Research 1999;119:147-57.
11. Lin S. Computer solutions of the travelling salesman problem. Bell Systems Technical Journal 1965;44:2245-69.
12. Yellow PC. A computational modification to the savings method for vehicle scheduling. Operational Research Quarterly 1970;21(2):281-3.
13. Friedman M. The use of ranks to avoid the assumption of normality implicit in the analysis of variance. Journal of the American Statistical Association 1937;32:675-701.
14. Wilcoxon F. Individual comparison by ranking methods. Biometrics 1945;1:80-3.
15. Zar J. Biostatistical analysis, 4th ed. Englewood Cliffs, NJ: Prentice Hall, 1998.
16. Christofides N, Mingozzi A, Toth P. The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P, Sandi C, editors. Combinatorial optimization. New York: Wiley, 1979, p. 315-338.
17. Beasley JE. OR-library: distributing test problems by electronic mail. Journal of the Operational Research Society 1990;41:1069-72.
18. Hjorring CA. The vehicle routing problem and local search metaheuristics. PhD thesis, University of Auckland, 1995.
19. Carreto CAC. Visual interactive methods for vehicle routing. PhD thesis, Coventry University, UK, 2000.