Vehicle routing with soft time windows and Erlang travel times

Journal of the Operational Research Society

Volumn 59, Issue 9, 2008, Pages 1220-1228

  Russell, R A ^a   Urban, T L ^a  

^a UNIVERSITY OF TULSA   (United States)

Author keywords

Metaheuristics; Stochastic vehicle routing; Time window constraints

Indexed keywords

STOCHASTIC SYSTEMS; TABU SEARCH; VEHICLE ROUTING; VEHICLES;

COMPUTATIONAL RESULTS; GAMMA DISTRIBUTION; META HEURISTICS; SOFT TIME WINDOWS; STOCHASTIC VEHICLE ROUTING; TABU SEARCH META-HEURISTIC; TIME WINDOW CONSTRAINT; VEHICLE ROUTING PROBLEMS;

TRAVEL TIME;

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

References (29)

1. Balakrishnan N (1993). Simple heuristics for the vehicle routeing problem with soft time windows. J Opl Res Soc 44: 279-287.
2. Bräysy O and Gendreau M (2005a). Vehicle routing problem with time windows, Part I: Route construction and local search algorithms. Transport Sci 39: 104-118.
3. Bräysy O and Gendreau M (2005b). Vehicle routing problem with time windows, Part II: Metaheuristics. Transport Sci 39: 119-139.
4. Chiang WC and Russell RA (1997). A reactive tabu search metaheuristic for the vehicle routeing problem with time windows. INFORMS J Comput 9: 417-430.
5. Chiang WC and Russell RA (2004). A metaheuristic for the vehicle routeing problem with soft time windows. J Opl Res Soc 55: 1298-1310.
6. Chiang YS and Roberts PO (1980). A note on transit time and reliability for regular-route trucking. Transport Res 14B(1-2): 59-65.
7. Cook TM and Russell RA (1978). A simulation and Statistical analysis of stochastic vehicle routing with timing constraints. Decis Sci 9: 673-687.
8. Dumas Y, Soumis F and Desrosiers J (1990). Optimizing the schedule for a fixed vehicle path with convex inconvenience costs. Transport Sci 24: 145-152.
9. Evans JR and Lindsay WM (2002). The Management and Control of Quality, 5th edn. South-Western: Cincinnati.
10. Ferland JA and Fortin L (1989). Vehicles scheduling with sliding time windows. Eur J Opl Res 38: 213-226.
11. Gendreau M, Guertin F, Potvin JY and Taillard É(1999). Parallel tabu search for real-time vehicle routing and dispatching. Transport Sci 33: 381-390.
12. Gendreau M, Laporte G and Séguin R (1996). Stochastic vehicle routing. Eur J Opl Res 88: 3-12.
13. Golden BL and Assad AA (1988). Vehicle Routing: Methods and Studies. North-Holland: Amsterdam.
14. Hill T (1994). Manufacturing Strategy: Text and Cases, 2nd edn. Irwin: Burr Ridge, IL.
15. Ibaraki T, Imahori S, Kubo M, Masuda T, Uno T and Yagiura M (2005). Effective local search algorithms for routing and scheduling problems with general time-window constraints. Transport Sci 39: 206-232.
16. Ioannou G, Kritikos M and Prastacos G (2003). A problem generator-solver heuristic for vehicle routing with soft time windows. Omega 31(1): 41-53.
17. Johnson NL, Kotz S and Balakrishnan N (1994). Continuous Univariate Distributions, Volume 1, 2nd edn. John Wiley & Sons: New York.
18. Kenyon AA and Morton DP (2003). Stochastic vehicle routing with random travel times. Transport Sci 37: 69-82.
19. Koskosidis YA, Powell WB and Solomon MM (1992). An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints. Transport Sci 26: 69-85.
20. Lambert V, Laporte G and Louveaux F (1993). Designing collection routes through bank branches. Comput Opl Res 20: 783-791.
21. Laporte G, Louveaux F and Mercure H (1992). The vehicle routing problem with stochastic travel times. Transport Sci 26: 161-170.
22. Mak KL and Guo ZG (2004). A genetic algorithm for vehicle routing problems with stochastic demand and soft time windows. In: Jones MH, Patek SD and Tawney BE (eds). Proceedings of the 2004 Systems and Information Engineering Design Symposium. Department of Systems and Information Engineering, University of Virginia: pp 183-190.
23. Min H (1991). A multiobjective vehicle routing problem with soft time windows: The case of a public library distribution system. Socio-Econ Plann Sci 25: 179-188.
24. Noland RB and Polak JW (2002). Travel time variability: A review of theoretical and empirical issues. Transport Rev 22: 39-54.
25. Osman IH (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Opns Res 41: 421-451.
26. Sexton TR and Choi YM (1986). Pickup and delivery of partial loads with 'soft' time windows. Am J Math Mngt Sci 6(3-4): 369-398.
27. Solomon MM (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Opns Res 35: 254-265.
28. Stevens DP and Baker RC (1994). A generalized loss function for process optimization. Decis Sci 25: 41-56.
29. Taillard É, Badeau P, Gendreau M, Guertin F and Potvin JY (1997). A tabu search heuristic for the vehicle routing problem with soft time windows. Transport Sci 31: 170-186.