Handling uncertainties in vehicle routing problems through data preprocessing

Transportation Research Part E: Logistics and Transportation Review

Volumn 48, Issue 3, 2012, Pages 667-683

  Chardy, Matthieu ^a   Klopfenstein, Olivier ^a  

^a ORANGE LABS   (France)

Author keywords

Decision aiding tool; Linear programming; Risk management; Uncertain data; Vehicle routing problems

Indexed keywords

DECISION MAKING; DECISION SUPPORT SYSTEMS; INTELLIGENT SYSTEMS; MONTE CARLO METHODS; RISK MANAGEMENT; VEHICLE ROUTING;

DATA PREPROCESSING; DECISION AIDING; DECISION-AIDING TOOL; LINEAR-PROGRAMMING; MONTE CARLO'S SIMULATION; OPERATION MANAGEMENT; RISKS MANAGEMENT; UNCERTAIN DATAS; UNCERTAINTY; VEHICLE ROUTING PROBLEMS;

LINEAR PROGRAMMING;

ALGORITHM; DATA PROCESSING; DECISION SUPPORT SYSTEM; MONTE CARLO ANALYSIS; OPERATIONS TECHNOLOGY; PLANNING METHOD; RISK ASSESSMENT; ROUTING; TRAFFIC MANAGEMENT; UNCERTAINTY ANALYSIS;

EID: 84855784092     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2011.12.001     Document Type: Article

References (31)

1. Ben-Tal A., El Ghaoui L., Nemirovski A. Robust Optimization 2009, Princeton University Press.
2. Beyer H.G., Sendhoff B. Robust optimization - a comprehensive survey. Computer Methods in Applied Mechanics and Engineering 2007, 196:3190-3218.
3. Bostel N., Dejax P., Guez P., Tricoire F. Multiperiod planning and routing on a rolling horizon for field force optimization logistics. The Vehicle Routing Problem: Latest Advances and New Challenges 2008, 503-525. Springer. B. Golden, S. Raghavan, E. Wasil (Eds.).
4. Bräsy O., Gendreau M. Vehicle routing problem with time window constraints, part 1: route construction and local search algorithms. Transportation Science 2004, 39(1):104-118.
5. Probabilistic and Randomized Methods for Design under Uncertainty 2006, Springer, London. G. Calafiore, F. Dabbene (Eds.).
6. Clarke G., Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 1964, 12:568-581.
7. Dantzig G.B. Linear programming under uncertainty. Management Science 1955, 1:179-206.
8. Desrochers M., Desrosiers J., Solomon M. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research 1992, 40:342-354.
9. Erera A.L., Morales J.C., Savelsbergh M. The vehicle routing problem with stochastic demand and duration constraints. Transportation Science 2010, 44(4):474-492.
10. Feillet D., Dejax P., Gendreau M., Gueguen C. An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 2004, 44:216-229.
11. The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research/Computer Science Interfaces Series 2008, vol. 43. Springer. B. Golden, S. Raghavan, E. Wasil (Eds.).
12. Grinstead C.M., Snell J.L. Introduction to Probability 1997, American Mathematical Society. second ed.
13. Jin R., Du X., Chen W. The use of metamodeling techniques for optimization under uncertainty. Structural and Multidisciplinary Optimization 2003, 25(2):99-116.
14. Kall P., Mayer J. Stochastic Linear Programming 2005, Springer.
15. Laporte G. The vehicle routing problem: an overview of exact and approximate algorithms. European Journal of Operational Research 1992, 59:345-358.
16. Maden W., Eglese R., Black D. Vehicle routing and scheduling with time-varying data: a case study. Journal of the Operational Research Society 2010, 61:515-522.
17. Programmation linéaire généralisée. Programmation mathématique 1989, 56-63. Dunod, Chapter 1. M. Minoux (Ed.).
18. Nahum, O.E., Hadas, Y., 2010. A comparison of two algorithms for the stochastic time-dependent vehicle-routing problem. In: Proceedings of the Transportation Research Board (TRB) 89th Annual Meeting, Washington, DC, USA. <> (accessed on September 2011). http://orennahum.dyndns.org/PDFs/P2010a.pdf.
19. Nemirovski A., Shapiro A. Convex approximations of chance constrained programs. SIAM Journal of Optimization 2006, 17:969-996.
20. Olson D.L., Swenseth S.R. A linear approximation for chance-constrained programming. Journal of the Operational Research Society 1987, 38(3):261-267.
21. Pagnoncelli B., Ahmed S., Shapiro A. Sample average approximation method for chance constrained programming: theory and applications. Journal Optimization Theory and Applications 2009, 142:399-416.
22. Potvin J.Y., Rousseau J.M. Parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European Journal Operations Research 1993, 66:331-340.
23. Righini G., Salani M. Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optimization 2006, 3(3):255-273.
24. Rosenkrantz D.J., Stearns R.E., Lewis P.M. An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing 1977, 6:563-581.
25. Stochastic Programming. Handbooks in OR& MS 2003, vol. 10. Elsevier. A. Ruszczynski, A. Shapiro (Eds.).
26. Solomon M. Algorithms for the vehicle routing and scheduling problem, with time window constraints. Operations Research 1987, 35:254-265.
27. Shapiro A., Dentcheva D., Ruszczynski A. Lectures on Stochastic Programming: Modeling and Theory 2009, SIAM, Philadelphia.
28. Sörensen K., Sevaux M. A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling. Journal of Mathematical Modelling and Algorithms 2009, 8(4):387-407.
29. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications 2002, vol. 9. SIAM. P. Toth, D. Vigo (Eds.).
30. Van Woensel T., Kerbache L., Peremans H., Vandaele N. Vehicle routing with dynamic travel times: a queueing approach. European Journal of Operational Research 2008, 186(3):990-1007.
31. Wang G.G., Shan S. Review of metamodeling techniques in support of engineering design optimization. Journal of Mechanical Design 2007, 129(4):370-380.