A Stochastic Vehicle Routing Problem with Travel Time Uncertainty: Trade-Off Between Cost and Customer Service

Networks and Spatial Economics

Volumn 13, Issue 4, 2013, Pages 471-496

  Zhang, Junlong ^a   Lam, William H K ^a   Chen, Bi Yu ^a,b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b WUHAN UNIVERSITY   (China)

Author keywords

Customer service; Discrete approximation; Stochastic programming; Tabu search; Time window; Vehicle routing

Indexed keywords

ARRIVAL-TIME DISTRIBUTIONS; CUSTOMER SERVICE LEVELS; CUSTOMER SERVICES; DISCRETE APPROXIMATION; STOCHASTIC PROGRAMMING MODEL; STOCHASTIC VEHICLE ROUTING; TIME WINDOWS; TRAVEL TIME UNCERTAINTY;

COSTS; HEURISTIC ALGORITHMS; NETWORK ROUTING; ROUTING ALGORITHMS; SHIPS; STOCHASTIC PROGRAMMING; STOCHASTIC SYSTEMS; TABU SEARCH; VEHICLE ROUTING;

SALES;

EID: 84888433635     PISSN: 1566113X     EISSN: 15729427     Source Type: Journal    
DOI: 10.1007/s11067-013-9190-x     Document Type: Article

References (49)

1. Ando N, Taniguchi E (2006) Travel time reliability in vehicle routing and scheduling with time windows. Netw Spat Econ 6: 293-311.
2. Balakrishnan N (1993) Simple heuristics for the vehicle routing problem with soft time windows. J Oper Res Soc 44: 279-287.
3. Bertsimas DJ, van Ryzin G (1991) A stochastic and dynamic vehicle routing problem in the Euclidean plane. Oper Res 39: 601-615.
4. Bozkaya B, Yanik S, Balcisoy S (2010) A GIS-based optimization framework for competitive multi-facility location-routing problem. Netw Spat Econ 10: 297-320.
5. Brandão J (2004) A tabu search algorithm for the open vehicle routing problem. Eur J Oper Res 157: 552-564.
6. Chang T-S, Wan Y-W, Ooi WT (2009) A stochastic dynamic traveling salesman problem with hard time windows. Eur J Oper Res 198: 748-759.
7. Chen BY, Lam WHK, Sumalee A, Shao H (2011) An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem. Math Comput Model 54: 1428-1439.
8. Chen BY, Lam WHK, Sumalee A, Li QQ, Shao H, Fang Z (2012) Finding reliable shortest paths in road networks under uncertainty. Netw Spat Econ. doi: 10. 1007/s11067-012-9175-1.
9. Chiang W-C, Russell RA (2004) A metaheuristic for the vehicle-routeing problem with soft time windows. J Oper Res Soc 55: 1298-1310.
10. Cordeau J-F, Maischberger M (2012) A parallel iterated tabu search heuristic for vehicle routing problems. Comput Oper Res 39: 2033-2050.
11. Cordeau J-F, Laporte G, Mercier A (2001) A unified tabu search heuristic for vehicle routing problems with time windows. J Oper Res Soc 52: 928-936.
12. Cordeau J-F, Desaulniers G, Desrosiers J, Solomon MM, Soumis F (2002) VRP with time windows. In: Toth P, Vigo D (eds) The vehicle routing problem. SIAM, Philadelphia, pp 157-193.
13. Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manage Sci 6: 80-91.
14. Drexl M (2012) Synchronization in vehicle routing-A survey of VRPs with multiple synchronization constraints. Transp Sci 46: 297-316.
15. Escuín D, Millán C, Larrodé E (2012) Modelization of time-dependent urban freight problems by using a multiple number of distribution centers. Netw Spat Econ 12: 321-336.
16. Fosgerau M, Karlström A (2010) The value of reliability. Transp Res B Methodol 44: 38-49.
17. Gendreau M, Laporte G, Séguin R (1995) An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transp Sci 29: 143-155.
18. Golden B, Raghavan S, Wasil E (2008) The vehicle routing problem: Latest advances and new challenges. Springer, New York.
19. Kenyon AS, Morton DP (2003) Stochastic vehicle routing with random travel times. Transp Sci 37: 69-82.
20. Koskosidis YA, Powell WB, Solomon MM (1992) An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints. Transp Sci 26: 69-85.
21. Lam WHK, Shao H, Sumalee A (2008) Modeling impacts of adverse weather conditions on a road network with uncertainties in demand and supply. Transp Res B Methodol 42: 890-910.
22. Lambert V, Laporte G, Louveaux F (1993) Designing collection routes through bank branches. Comput Oper Res 20: 783-791.
23. Laporte G (2009) Fifty years of vehicle routing. Transp Sci 43: 408-416.
24. Laporte G, Louveaux F, Mercure H (1992) The vehicle routing problem with stochastic travel times. Transp Sci 26: 161-170.
25. Laporte G, Louveaux F, van Hamme L (2002) An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Oper Res 50: 415-423.
26. Lei H, Laporte G, Guo B (2011) The capacitated vehicle routing problem with stochastic demands and time windows. Comput Oper Res 38: 1775-1783.
27. Leung SCH, Zhou X, Zhang D, Zheng J (2011) Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem. Comput Oper Res 38: 205-215.
28. Li X, Tian P, Leung SCH (2010) Vehicle routing problems with time windows and stochastic travel and service times: models and algorithm. Int J Prod Econ 125: 137-145.
29. Li X, Leung SCH, Tian P (2012) A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem. Expert Syst Appl 39: 365-374.
30. Li Z-C, Huang H-J, Lam WHK (2012) Modelling heterogeneous drivers' responses to route guidance and parking information systems in stochastic and time-dependent networks. Transportmetrica 8: 105-129.
31. Liberatore F, Righini G, Salani M (2011) A column generation algorithm for the vehicle routing problem with soft time windows. 4OR-Q J. Oper Res 9: 49-82.
32. Lourenço HR, Martin OC, Stützle T (2002) Iterated local search. In: Glover F, Kochenberger G (ed) Handbook of metaheuristics. International series in operations research & management Science, vol. 57. Kluwer Academic Publishers, Norwell, MA, pp 321-353.
33. Miller-Hooks E, Mahmassani HS (1998) Optimal routing of hazardous materials in stochastic, time-varying transportation networks. Transp Res Rec 1645: 143-151.
34. Nagata Y, Bräysy O, Dullaert W (2009) A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Comput Oper Res 37: 724-737.
35. Norouzi N, Tavakkoli-Moghaddam R, Ghazanfari M, Alinaghian M, Salamatbakhsh A (2012) A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization. Netw Spat Econ 12: 609-633.
36. Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34: 2403-2435.
37. Russell RA, Urban TL (2008) Vehicle routing with soft time windows and Erlang travel times. J Oper Res Soc 59: 1220-1228.
38. Savelsbergh MWP (1992) The vehicle routing problem with time windows: minimizing route duration. INFORMS J Comput 4: 146-154.
39. Silva F, Gao L (2012) A joint replenishment inventory-location model. Netw Spat Econ. doi: 10. 1007/s11067-012-9174-2.
40. Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35: 254-265.
41. Taillard E, Badeau P, Gendreau M, Guertin F, Potvin J-Y (1997) A tabu search heuristic for the vehicle routing problem with soft time windows. Transp Sci 31: 170-186.
42. Thompson RG, Taniguchi E, Yamada T (2011) Estimating the benefits of considering travel time variability in urban distribution. Transp Res Rec 2238: 86-96.
43. Toth P, Vigo D (2002) The vehicle routing problem. SIAM, Philadelphia.
44. Toyoglu H, Karasan OE, Kara BY (2012) A new formulation approach for location-routing problems. Netw Spat Econ 12: 635-659.
45. van Lint JWC, van Zuylen HJ, Tu H (2008) Travel time unreliability on freeways: why measures based on variance tell only half the story. Transp Res A Policy Pract 42: 258-277.
46. Wei C, Asakura Y, Iryo T (2012) A probability model and sampling algorithm for the inter-day stochastic traffic assignment problem. J Adv Transp 46: 222-235.
47. Yu B, Yang ZZ (2011) An ant colony optimization model: the period vehicle routing problem with time windows. Transp Res E Logist Transp Rev 47: 166-181.
48. Yu B, Yang ZZ, Xie JX (2011) A parallel improved ant colony optimization for multi-depot vehicle routing problem. J Oper Res Soc 62: 183-188.
49. Zhang T, Chaovalitwongse WA, Zhang Y (2012) Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries. Comput Oper Res 39: 2277-2290.