Robust vehicle routing problem with deadlines and travel time/demand uncertainty

Journal of the Operational Research Society

Volumn 63, Issue 9, 2012, Pages 1294-1306

  Lee, C ^a   Lee, K ^b   Park, S ^c  

^a Electronics and Telecommunications Research Institute (ETRI)   (South Korea)

^b Hankuk University of Foreign Studies   (South Korea)

^c Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

column generation; robust optimization; vehicle routing

Indexed keywords

CUSTOMER SATISFACTION; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING; SALES; VEHICLE ROUTING; VEHICLES;

ADJUSTABLE PARAMETERS; COLUMN GENERATION; COMPUTATIONAL EXPERIMENT; DANTZIG-WOLFE DECOMPOSITION; DYNAMIC PROGRAMMING ALGORITHM; ROBUST OPTIMIZATION; VEHICLE CAPACITY; VEHICLE ROUTING PROBLEMS;

TRAVEL TIME;

EID: 84864707453     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2011.136     Document Type: Article

References (38)

1. Augerat P, Belenguer J, Benavent E, Corberan A, Naddef D and Rinaldi G (1995). Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical Report RR949-M, Artemis-Imag, Grenoble, France.
2. Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP and Vance PH (1998). Branch-and-price: Column generation for solving huge integer programs. Operations Research 46: 316-329. (Pubitemid 128655433)
3. Barnhart C, Hane CA and Vance PH (2000). Using branch-andprice-and-cut to solve origin-destination integer multicommodity flow problems. Operations Research 48: 318-326.
4. Berger J and Barkaoui M (2003). A new hybrid genetic algorithm for the capacitated vehicle routing problem. Journal of the Operational Research Society 54: 1254-1262.
5. Bertsimas D and Sim M (2003). Robust discrete optimization and network flows. Mathematical Programming 98: 49-71.
6. Bertsimas D and Sim M (2004). The price of robustness. Operations Research 52: 35-53. (Pubitemid 40000812)
7. Bertsimas D and Simchi-Levi D (1996). A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Operations Research 42: 286-304. (Pubitemid 126669481)
8. Bertsimas D, Pachamanova D and Sim M (2004). Robust linear optimization under general norms. Operations Research Letters 32: 510-516.
9. Campbell AM and Thomas BW (2008). Probabilistic traveling salesman problem with deadlines. Transportation Science 42: 1-21.
10. Campbell AM and Thomas BW (2009). Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines. Computers & Operations Research 36: 1231-1248.
11. Chabrier A (2006). Vehicle routing problem with elementary shortest path based column generation. Computers & Operations Research 33: 2972-2990. (Pubitemid 43199835)
12. Chang TS, Wan YW and Ooi WT (2009). A stochastic dynamic traveling salesman problem with hard time windows. European Journal of Operational Research 198: 748-759.
13. Cheung RK and Hang DD (2003). A time-window sliding procedure for driver-task assignment with random service times. IIE Transactions 35: 433-444.
14. Christiansen C and Lysgaard J (2007). A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands. Operations Research Letters 35: 773-781. (Pubitemid 47483971)
15. Cordeau J, Gendreau M, Laporte G, Potvin J and Semet F (2002). A guide to vehicle routing heuristics. Journal of the Operational Research Society 53: 512-522. (Pubitemid 34550664)
16. Desrochers M. (1986). La fabrication d'horaires de travail pour les conducteurs d'autobus par une methode de generation de colonnes. PhD Thesis, Centre de recherche sur les Transports, Publication #470, Universite de Montreal, Canada.
17. Dethloff J (2002). Relation between vehicle routing problems: An insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls. Journal of the Operational Research Society 53: 115-118. (Pubitemid 34452483)
18. Dorigo M, Maniezzo V and Colorni A (1996). Ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man and Cybernetics 26: 29-41. (Pubitemid 126780573)
19. Fisher ML, Jornsten KO and Madsen OBG (1997). Vehicle routing with time windows: Two optimization algorithms. Operations Research 45: 488-492. (Pubitemid 127684724)
20. Fukasawa R, Longo H, Lysgaard J, De Aragao MP, Reis M, Uchoa E and Werneck RF (2006). Robust branch-and-cut-andprice for the capacitated vehicle routing problem. Mathematical Programming 106: 491-511.
21. Gendreau M, Hertz A and Laporte G (1994). A tabu search heuristic for the vehicle routing problem. Management Science 40: 1276-1290.
22. Gendreau M, Laporte G and Seguin R (1995). An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transportation Science 29: 143-155.
23. Gendreau M, Laporte G and Seguin R (1996a). Stochastic vehicle routing. European Journal of Operational Research 88: 3-12. (Pubitemid 126367087)
24. Gendreau M, Laporte G and Seguin R (1996b). A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Operations Research 44: 469-477. (Pubitemid 126669512)
25. Hvattum LM, Lokketangen A and Laporte G (2006). Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. Transportation Science 40: 421-438. (Pubitemid 44746133)
26. Ioachim I, Gelinas S, Soumis F and Desrosiers J (1998). A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. Networks 31: 193-204, Wiley Online Library).
27. Irnich S and Desaulniers G (2004). Shortest Path Problems with Resource Constraints. Springer: New York.
28. Jula H, DessoukyMand Ioannou PA (2006). Truck route planning in nonstationary stochastic networks with time windows at customer locations. IEEE Transactions on Intelligent Transportation Systems 7: 51-62.
29. Kohl N and Madsen OBG (1997). An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation. Operations Research 45: 395-406. (Pubitemid 127684717)
30. Kolen AWJ, Kan AHGR and Trienekens HWJM (1987). Vehicle routing with time windows. Operations Research 35: 266-273.
31. Lin S and Kernighan B (1973). An effective heuristic algorithm for the traveling-salesman problem. Operations Research 21: 498-516.
32. Rego C (1998). A subpath ejection method for the vehicle routing problem. Management Science 44: 1447-1459. (Pubitemid 128591672)
33. Russell RA and Urban TL (2008). Vehicle routing with soft time windows and Erlang travel times. Journal of the Operational Research Society 59: 1220-1228.
34. Solomon MM (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35: 254-265.
35. Sungur I, Ordonez F and Dessouky M (2008). A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty. IIE Transactions 40: 509-523. (Pubitemid 351386538)
36. Tan KC, Cheong CY and Goh CK (2007). Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation. European Journal of Operational Research 177: 813-839.
37. Toth P and Vigo D (2002). The vehicle routing problem. SIAM 9: 5-10.
38. Yu B, Yang Z and Xie J (2010). A parallel improved ant colony optimization for multi-depot vehicle routing problem. Journal of the Operational Research Society 62: 183-188.