The multi-trip vehicle routing problem

Journal of the Operational Research Society

Volumn 49, Issue 8, 1998, Pages 799-805

  BrandaO J C S ^a   Mercer, A ^b  

^a UNIVERSITY OF MINHO   (Portugal)

^b LANCASTER UNIVERSITY   (United Kingdom)

Author keywords

Multiple trips; Tabu search; Vehicle routing

Indexed keywords

ALGORITHMS; CALCULATIONS; COMPUTER SIMULATION; COSTS; HEURISTIC METHODS; PLANNING; SCHEDULING; TRANSPORTATION ROUTES;

LOAD PLANNING ALGORITHMS; OBJECTIVE FUNCTION; VEHICLE ROUTING PROBLEM;

OPERATIONS RESEARCH;

EID: 0032141410     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600595     Document Type: Article

References (16)

1. Hommes P, Howe ER and Pape CS (1989). Burton’s Biscuits: a study of the load planning operation at the new depot at Risley. M.Sc. Dissertation, Lancaster University.
2. Brandao J (1994). A decision support system and algorithms for the vehicle routing and scheduling problem. Ph.D. Thesis, Lancaster University.
3. Brandao J and Mercer A (1997). A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. Eur J Opl Res 100: 180-191.
4. Fleischmann B (1990). The vehicle routing problem with multiple use of vehicles.Working paper, Fachbereich Wirtschaftswissenschaften, Universität Hamburg.
5. Taillard E, Laporte G and Gendreau M (1996). Vehicle routeing with multiple use of vehicles. J Op Res Soc 47: 1065-1070.
6. Christofides N, Mingozzi A and Toth P (1979). The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P and Sandi C (eds). Combinatorial Optimization. Wiley: Chichester, pp 313-318.
7. Fisher ML (1994). Optimal solution of vehicle routing problems using minimum k-trees. Opns Res 42: 626-642.
8. Kelly M, Golden B and Assad A (1993). Large-scale controlled rounding using tabu search with strategic oscillation. In: Glover F, Laguna M, Taillard E and Werra JCD (eds). Annals of Operations Research (41).
9. Baltzer AG, Science Publishers: Basel, Switzerland, pp 69-84.
10. Mooney EL and Rardin RL (1993). Tabu search for a class of scheduling problems. In: Glover F, Laguna M, Taillar E and Werra JCD (eds). Annals of Operations Research (41).
11. Baltzar AG, Science Publishers: Basel, Switzerland, pp 3-28.
12. Gendreau M, Hertz A and Laporte G (1994). A tabu search heuristic for the vehicle routing. Mgmt Sci 40: 1276-1290.
13. Gendreau M, Hertz A and Laporte G (1992). New insertion and post-optimization procedures for the traveling salesman problem. Opns Res 40: 1086-1094.
14. Taillard E (1991). Robust tabu search for the quadratic assignment problem. Parallel Comput 17: 443-455.
15. Rochat Yand Taillard E (1995). Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1: 147-167.
16. Dongara JJ (1998). Performance of various computers using standard linear equations software. Report CS-89-85, University of Tennessee.