The grocery superstore vehicle scheduling problem

Journal of the Operational Research Society

Volumn 56, Issue 8, 2005, Pages 902-911

  Eglese, R W ^a,c   Mercer, A ^a   Sohrabi, B ^b  

^a LANCASTER UNIVERSITY MANAGEMENT SCHOOL   (United Kingdom)

^b UNIVERSITY OF TEHRAN   (Iran)

^c LANCASTER UNIVERSITY   (United Kingdom)

Author keywords

Retail distribution; Simulated annealing; Vehicle routeing

Indexed keywords

ALGORITHMS; COSTS; MATHEMATICAL PROGRAMMING; OPERATIONS RESEARCH; SIMULATED ANNEALING; VEHICLES;

DISTRIBUTION COSTS; REGIONAL DISTRIBUTION CENTER (RDC); RETAIL DISTRIBUTION; VEHICLE ROUTERING PROBLEM (VRP);

SCHEDULING;

EID: 22744448491     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601907     Document Type: Review

References (11)

1. Danzig GB and Ramser JH (1959). The truck dispatching problem. Mngt Sci 6: 80-91.
2. Knight K and Hofer J (1968). Vehicle scheduling with timed and connected calls. Opl Res Q 19: 299-310.
3. Clarke G and Wright JV (1964). Scheduling of vehicles from a central depot to a number of delivery points. Opns Res 12: 568-581.
4. Dief I and Bodin LD (1984). Extension of the Clarke and Wright algorithm for solving the vehicle routing problem with backhauling. In: Kidder A (ed). Proceedings of the Babson College Conference on Software Uses in Transportation and Logistic Management. Babson Park, MA, pp 75-96.
5. Goetschalckx M and Jacobs-Blecha C (1989). The vehicle routing problem with backhauls. Eur J Opl Res 42: 39-51.
6. Toth P and Vigo D (eds) (2002). The Vehicle Routing Problem. SIAM Monographs: Philadelphia, PA.
7. Osman IH (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Opns Res 41: 421-451.
8. Christofides N, Mingozzi A and Toth P (1979). The vehicle routing problem. In: Christofides N et al (eds). Combinational Optimisation. Wiley, Chichester, pp 315-338.
9. Taillard ED (1993). Parallel iterative search methods for vehicle routing problems. Networks 23: 661-673.
10. Gendreau M, Laporte G and Potvin J-Y (2002). Metaheuristics for the capacitated VRP. In: Toth P and Vigo D (eds). The Vehicle Routing Problem. SIAM Monographs, Philadelphia, PA, pp 129-154.
11. Brandâo 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.