A heuristic method for the open vehicle routing problem

Journal of the Operational Research Society

Volumn 51, Issue 5, 2000, Pages 564-573

  Sariklis, D ^a   Powell, S ^a  

^a LONDON SCHOOL OF ECONOMICS   (United Kingdom)

Author keywords

Distribution management; Heuristics; Open vehicle routing problem

Indexed keywords

COMPUTATIONAL METHODS; DECISION THEORY; HEURISTIC METHODS; PROBLEM SOLVING; RESOURCE ALLOCATION; STRATEGIC PLANNING; TREES (MATHEMATICS); VALUE ENGINEERING;

OPEN VEHICLE ROUTING; SPANNING TREES;

OPERATIONS RESEARCH;

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

References (14)

1. Schrage L (1981). Formulation and structure of more complex/ realistic routing and scheduling problems. Networks11: 229-232.
2. Bodin LD and Golden BL (1981). Classification in vehicle routing and scheduling. Networks11: 97-108.
3. Ronen D (1988). Perspectives on practical aspects of truck routing and scheduling. Eur J Opl Res35: 137-145.
4. Desrochers M, Lenstra JK and Savelsbergh MWP (1990). A classification scheme for vehicle routing and scheduling problems. Eur J Opl Res46: 322-332.
5. Sariklis D (1997). Open Vehicle Routing Problem: Description Formulations and Heuristic Methods. Ph.D. Thesis, University of London.
6. Prim RC (1957). Shortest connection networks and some generalizations. Bell Sys Tech J36: 1389-1401.
7. Salford Software Ltd (1996). FTN77 User’s Guide. Salford: United Kingdom.
8. Laporte G and Nobert Y (1983). A branch and bound algorithm for the capacitated vehicle routing problem. Opns Res Spektrum5: 77-85.
9. Laporte G, Nobert Yand Desrochers M (1985). Optimal routing under capacity and distance restrictions. Opns Res33: 1050-1073.
10. Laporte G, Mercure H and Nobert Y (1986). An exact algorithm for the asymmetrical capacitated vehicle routing problem. Networks16: 33-46.
11. Laporte G, Mercure H and Nobert Y (1992). A branch and bound algorithm for a class of asymmetrical vehicle routing problems. J Opl Res Soc43: 469-481.
12. Lin S and Kernighan BW (1973). An effective heuristic algorithm for the traveling salesman problem. Opns Res21: 498-516.
13. Eilon S, Watson-Gandy CDT and Christofides N (1971). Vehicle scheduling. In: Distribution Management: Mathematical Modelling and Practical Analysis. Griffin: London, pp 180-233.
14. Christofides N, Mingozzi A and Toth P (1979). The vehicle routing problem. In: Christofides N et al (eds). Combinatorial Optimization. Wiley: London, pp 315-338.