References
- Adulyasak, Y., and P. Jaillet. 2015. “Models and Algorithms for Stochastic and Robust Vehicle Routing with Deadlines.” Transportation Science 50 (2): 1–36.
- Azadeh, A., and H. Farrokhi-Asl. 2019. “The Close–open Mixed Multi Depot Vehicle Routing Problem considering Internal and External Fleet of Vehicles.” Transportation Letters 11 (2): 78–92. doi:https://doi.org/10.1080/19427867.2016.1274468.
- Bernardo, M., and J. Pannek. 2018. “Robust Solution Approach for the Dynamic and Stochastic Vehicle Routing Problem.” Journal of Advanced Transportation 1–11. doi:https://doi.org/10.1155/2018/9848104.
- Bertsimas, D., D. B. Brown, and C. Caramanis. 2010. “Theory and Applications of Robust Optimization.” SIAM Review 53 (3): 464–501. doi:https://doi.org/10.1137/080734510.
- Bertsimas, D., and M. Sim. 2004. “The Price of Robustness.” Operations Research 52 (1): 35–53. doi:https://doi.org/10.1287/opre.1030.0065.
- Birge, J., and F. V. Louveaux. 2011. Introduction to Stochastic Programming. New York: Springer.
- Clarke, G., and J. W. Wright. 1964. “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points.” Operations Research 12 (4): 568–581. doi:https://doi.org/10.1287/opre.12.4.568.
- Drexl, M. 2012. “Rich Vehicle Routing in Theory and Practice.” Logistics Research 5 (1): 47–63. doi:https://doi.org/10.1007/s12159-012-0080-2.
- Erera, A. L., J. C. Morales, and M. Savelsbergh. 2010. “The Vehicle Routing Problem with Stochastic Demand and Duration Constraints.” Transportation Science 44 (4): 474–492. doi:https://doi.org/10.1287/trsc.1100.0324.
- Gounaris, C. E., P. P. Repoussis, W. Tarantilis, C. D. Wiesemann, and C. A. Floudas. 2013a. “An Adaptive Memory Programming Framework for the Robust Capacitated Vehicle Routing Problem.” Transportation Science 50 (4): 1139–1393. doi:https://doi.org/10.1287/trsc.2014.0559.
- Gounaris, C. E., W. Wiesemann, and C. A. Floudas. 2013b. “The Robust Capacitated Vehicle Routing Problem under Demand Uncertainty.” Operations Research 61 (3): 677–693. doi:https://doi.org/10.1287/opre.1120.1136.
- Juan, A., J. Faulin, S. Grasman, D. Riera, J. Marull, and C. Mendez. 2011. “Using Safety Stocks and Simulation to Solve the Vehicle Routing Problem with Stochastic Demands.” Transportation Research Part C: Emerging Technologies 19 (5): 751–765. doi:https://doi.org/10.1016/j.trc.2010.09.007.
- Kirkpatrick, S., C. D. Gelatt, and M. P. Vecchi. 1983. “Optimization by Simulated Annealing.” Science 22 (4598): 671–680. doi:https://doi.org/10.1126/science.220.4598.671.
- Laporte, G., Y. Nobert, and M. Desrochers. 1985. “Optimal Routing under Capacity and Distance Restrictions.” Operations Research 33 (5): 1050–1073. doi:https://doi.org/10.1287/opre.33.5.1050.
- Lee, C., K. Lee, and S. Park. 2012. “Robust Vehicle Routing Problem with Deadlines and Travel Time/demand Uncertainty.” Journal of the Operational Research Society 63 (9): 1294–1306. doi:https://doi.org/10.1057/jors.2011.136.
- Liebchen, C., M. Lübbecke, R. Möhring, and S. Stiller. 2009. “The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications.” In Robust and Online Large-Scale Optimization, Lecture Notes in Computer Science edited by, Vol. 5868, 1–27. Berlin/Heidelberg: Springer-Verlag. doi:https://doi.org/10.1007/978-3-642-05465-5_1.
- Mendoza, J. E., L. Rousseau, and J. G. Villegas. 2016. “A Hybrid Metaheuristic for the Vehicle Routing Problem with Stochastic Demand and Duration Constraints.” Journal of Heuristics 22 (4): 539–566. doi:https://doi.org/10.1007/s10732-015-9281-6.
- Mulvey, J. M., R. J. Vanderbei, and S. A. Zenios. 1995. “Robust Optimization of Large-scale Systems.” Operations Research 43 (2): 264–281. doi:https://doi.org/10.1287/opre.43.2.264.
- Oyola, J., H. Arntzen, and D. L. Woodruff. 2018. “The Stochastic Vehicle Routing Problem, a Literature Review, Part I: Models.” EURO Journal on Transportation and Logistics 70 (3): 1–29. doi:https://doi.org/10.1007/s13676-016-0100-5.
- Salavati-Khoshghalb, M., M. Gendreau, O. Jabali, and W. Rei. 2017. “An Exact Algorithm to Solve the Vehicle Routing Problem with Stochastic Demands under an Optimal Restocking Policy.” Technical report, Centre Interuniversitaire de Recherche sur ler Réseaux d’Entreprise, a la Logistique et le Transport (CIRRELT), Montréal, Québec.
- Solano-Charris, E., C. Prins, and A. C. Santos. 2015. “Local Search Based Metaheuristics for the Robust Vehicle Routing Problem with Discrete Scenarios.” Applied Soft Computing 32 (Supplement C): 518–531. doi:https://doi.org/10.1016/j.asoc.2015.03.058.
- Sörensen, K., and M. Sevaux. 2009. “A Practical Approach for Robust and Flexible Vehicle Routing Using Metaheuristics and Monte Carlo Sampling.” Journal of Mathematical Modelling and Algorithms 8 (4): 387–407. doi:https://doi.org/10.1007/s10852-009-9113-5.
- Sun, L., and B. Wang. 2015. “Robust Optimisation Approach for Vehicle Routing Problems with Uncertainty.” Mathematical Problems in Engineering 2015: 1–8. doi:https://doi.org/10.1155/2015/901583.
- Sungur, I., F. Ordóñez, and M. Dessouky. 2008. “A Robust Optimization Approach for the Capacitated Vehicle Routing Problem with Demand Uncertainty.” IIE Transactions 4 (5): 509–523. doi:https://doi.org/10.1080/07408170701745378.
- Toth, P., and D. Vigo. 2014. Vehicle Routing: Problems, Methods, and Applications. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics.
- Wu, L., M. Hifi, and H. Bederina. 2017. “A New Robust Criterion for the Vehicle Routing Problem with Uncertain Travel Time.” Computers & Industrial Engineering 112 (C): 607–615. doi:https://doi.org/10.1016/j.cie.2017.05.029.
- Zhang, J., W. H. K. Lam, and B. Y. Chen. 2016. “On-time Delivery Probabilistic Models for the Vehicle Routing Problem with Stochastic Demands and Time Windows.” European Journal of Operational Research 249 (1): 144–154. doi:https://doi.org/10.1016/j.ejor.2015.08.050.