Achieving robustness in the capacitated vehicle routing problem with stochastic demands

References

• 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 110 (2): 0 78–92. doi:10.1080/19427867.2016.1274468.
   Google Scholar
• Barrico, C., and C. H. Antunes. “Robustness Analysis in Multi-objective Optimization Using a Degree of Robustness Concept.” In 2006 IEEE International Conference on Evolutionary Computation. ancouver, BC, Canada, 1887–1892, 2006. doi: 10.1109/CEC.2006.1688537 .
   Google Scholar
• Ben-Tal, A., A. Goryashko, E. Guslitzer, and A. Nemirovski. 2004. “Adjustable Robust Solutions of Uncertain Linear Programs.” Transportation Letters 99: 0 351–376.
   Google Scholar
• Bernardo, M., B. Du, and J. Pannek. 2021. “A Simulation-based Solution Approach for the Robust Capacitated Vehicle Routing Problem with Uncertain Demands.” Transportation Letters. 13: 9, 664–673. doi:10.1080/19427867.2020.1752448.
   Web of Science ®Google Scholar
• Bernardo, M., and J. Pannek. 2018. “Robust Solution Approach for the Dynamic and Stochastic Vehicle Routing Problem.” Journal of Advanced Transportation 2018: 1–11. doi:10.1155/2018/9848104.
   Google Scholar
• Bertsimas, D., and M. Sim. 2004. “The Price of Robustness.” Operations Research 520 (1): 0 35–53. doi:10.1287/opre.1030.0065.
   Google Scholar
• Birge, J., and F. V. Louveaux. 2011. Introduction to Stochastic Programming. New York: Springer.
   Google Scholar
• Calvet, L., D. Wang, A. Juan, and L. Bové. 2019. “Solving the Multidepot Vehicle Routing Problem with Limited Depot Capacity and Stochastic Demands.” International Transactions in Operational Research 260 (2): 0 458–484. doi:10.1111/itor.12560.
   Google Scholar
• Christofides, N., A. Mingozzi, and P. Toth. 1979. “The Vehicle Routing Problem.” In Combinatorial Optimization, edited by N. Christofides, A. Mingozzi, P. Toth, and C. Sandi, 315–338. Chichester: Wiley.
   Google Scholar
• Clarke, G., and J. W. Wright. 1964. “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points.” Operations Research 120 (4): 0 568–581. doi:10.1287/opre.12.4.568.
   Google Scholar
• Dhamdhere, K., V. Goyal, R. Ravi, and M. Singh. “How to Pay, Come What May: Approximation Algorithms for Demand-robust Covering Problems.” In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS’05). Pittsburgh, PA, 367–376, 2005. doi: 10.1109/SFCS.2005.42 .
   Google Scholar
• Dror, M., and P. Trudeau. 1986. “Stochastic Vehicle Routing with Modified Savings Algorithm.” European Journal of Operational Research 230 (2): 0 228–235. doi:10.1016/0377-2217(86)90242-0.
   Google Scholar
• Erera, A. L., J. C. Morales, and M. Savelsbergh. 2010. “The Vehicle Routing Problem with Stochastic Demand and Duration Constraints.” Transportation Science 440 (4): 0 474–492. doi:10.1287/trsc.1100.0324.
   Google Scholar
• Eufinger, K., and C. Buchheim. 2018. “A Robust Approach to the Capacitated Vehicle Routing Problem with Uncertain Costs.” Optimization Online 2 (2): 79–95.
   Google Scholar
• Goodson, J. C., J. W. Ohlmann, and B. W. Thomas. 2012. “Cyclic-order Neighborhoods with Application to the Vehicle Routing Problem with Stochastic Demand.” European Journal of Operational Research 2170 (2): 0 312–323. doi:10.1016/j.ejor.2011.09.023.
   Google Scholar
• Gounaris, C. E., P. P. Repoussis, C. D. Tarantilis, W. Wiesemann, and C. A. Floudas. 2016. “An Adaptive Memory Programming Framework for the Robust Capacitated Vehicle Routing Problem.” Transportation Science 500 (4): 0 1239–1260. doi:10.1287/trsc.2014.0559.
   Google Scholar
• Gounaris, C. E., W. Wiesemann, and C. A. Floudas. 2013. “The Robust Capacitated Vehicle Routing Problem under Demand Uncertainty.” Operations Research 610 (3): 0 677–693. doi:10.1287/opre.1120.1136.
   Google Scholar
• Hemmelmayr, H., K. F. Doerner, R. F. Hartl, and S. Rath. 2013. “A Heuristic Solution Method for Node Routing Based Solid Waste Collection Problems.” Journal of Heuristics 19 (2): 0 129–156. doi:10.1007/s10732-011-9188-9.
   Google Scholar
• 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 190 (5): 0 751–765. doi:10.1016/j.trc.2010.09.007.
   Google Scholar
• Kirkpatrick, S., C. D. Gelatt, and M. P. Vecchi. 1983. “Optimization by Simulated Annealing.” Science 45980 (220): 0 671–680. doi:10.1126/science.220.4598.671.
   Google Scholar
• Laporte, G., F. V. Louveaux, and L. van Hamme. 2002. “An Integer L-shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands.” Operations Research 500 (3): 0 415–423. doi:10.1287/opre.50.3.415.7751.
   Google Scholar
• Laporte, G., Y. Nobert, and M. Desrochers. 1985. “Optimal Routing under Capacity and Distance Restrictions.” Operations Research 330 (5): 0 1050–1073. doi:10.1287/opre.33.5.1050.
   Google Scholar
• 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 630 (9): 0 1294–1306. doi:10.1057/jors.2011.136.
   Google Scholar
• Liebchen, C., M. Lübbecke, R. Möhring, and S. Stiller. 2009. “The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications.” In: Ahuja R.K., Möhring R.H., Zaroliagis C.D. (eds) Robust and Online Large-Scale Optimization. Lecture Notes in Computer Science, 5868. Springer, Berlin, Heidelberg. doi:10.1007/978-3-642-05465-5_1.
   Google Scholar
• Lin, S. 1965. “Computer Solutions of the Traveling Salesman Problem.” The Bell System Technical Journal 440 (10): 0 2245–2269. doi:10.1002/j.1538-7305.1965.tb04146.x.
   Google Scholar
• Maggioni, F., F. A. Potra, and M. Bertocchi. 2015. “Stochastic versus Robust Optimization for a Transportation Problem.” Optimization Online Retrieved 01.04.2020.
   Google Scholar
• Marotta, A., F. D’Andreagiovanni, A. Kassler, and E. Zola. 2017. “On the Energy Cost of Robustness for Green Virtual Network Function Placement in 5g Virtualized Infrastructures.” Computer Networks 125: 0 64–75. doi:10.1016/j.comnet.2017.04.045.
   Google Scholar
• Mendoza, J. E., B. Castanier, C. Guéret, A. L. Medaglia, and N. Velasco. 2010. “A Memetic Algorithm for the Multi-compartment Vehicle Routing Problem with Stochastic Demands.” Computers & Operations Research 370 (11): 0 1886–1898. URL. doi: 10.1016/j.cor.2009.06.015.
   Google Scholar
• Mendoza, J. E., and J. G. Villegas. 2013. “A Multi-space Sampling Heuristic for the Vehicle Routing Problem with Stochastic Demands.” Optimization Letters 7 (7): 0 1503–1516. doi:10.1007/s11590-012-0555-8.
   Google Scholar
• Molina, J. C., I. Eguia, and J. Racero. 2019. “Reducing Pollutant Emissions in a Waste Collection Vehicle Routing Problem Using a Variable Neighborhood Tabu Search Algorithm: A Case Study.” TOP 27 (2): 0 253–287. doi:10.1007/s11750-019-00505-5.
   Google Scholar
• Mulvey, J. M., R. J. Vanderbei, and S. A. Zenio. 1995. “Robust Optimization of Large-scale Systems.” Operations Research 430 (2): 0 264–281. doi:10.1287/opre.43.2.264.
   Google Scholar
• Nambiar, S. K., and S. M. Idicula. “A Multi-agent Vehicle Routing System for Garbage Collection.” In Fifth International Conference on Advanced Computing (ICoAC). Chennai, India, 72–76, 2013. doi: 10.1109/ICoAC.2013.6921930 .
   Google Scholar
• Ordóñez, F. “Robust Vehicle Routing,” Chapter 7, 153–178. 2014.
   Google Scholar
• Osman, I. H. 1993. “Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem.” Annals of Operations Research 41 (4): 0 421–451. doi:10.1007/BF02023004.
   Google Scholar
• 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 7 (3): 0 193–221. doi:10.1007/s13676-016-0100-5.
   Web of Science ®Google Scholar
• Pillac, V., G. Michel, C. Gueret, and A. L. Medaglia. 2013. “A Review of Dynamic Vehicle Routing Problems.” European Journal of Operational Research 225 (1): 0 1–11. doi:10.1016/j.ejor.2012.08.015.
   Web of Science ®Google Scholar
• Salavati-Khoshghalb, M., M. Gendreau, O. Jabali, and W. Rei. 2019. “A Rule-based Recourse for the Vehicle Routing Problem with Stochastic Demands.” Transportation Science 530 (5): 0 1213–1499.
   Google Scholar
• Schulze, J., and T. Fahle. 1999. “A Parallel Algorithm for the Vehicle Routing Problem with Time Window Constraints.” Annals of Operations Research 86: 0 585–607. doi:10.1023/A:1018948011707.
   Google Scholar
• 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 320 (Supplement C): 0 518–531. doi:10.1023/A:1025605803490.
   Google Scholar
• Soleimani, H., Y. Chaharlang, and H. Ghaderi. 2018. “Collection and Distribution of Returned-remanufactured Products in a Vehicle Routing Problem with Pickup and Delivery considering Sustainable and Green Criteria.” Journal of Cleaner Production 172: 0 960–970. doi:10.1016/j.jclepro.2017.10.124.
   Web of Science ®Google Scholar
• 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 80 (4): 0 387–407. doi:10.1007/s10852-009-9113-5.
   Google Scholar
• Souza, A. L. S., M. Bernardo, P. H. V. Penna, J. Pannek, and M. J. F. Souza. 2021. “Bi-objective Optimization Model for the Heterogeneous Dynamic Dial-a-ride Problem with No Rejects.” Optimization Letters 1–20. doi:10.1007/s11590-020-01698-6.
   PubMedGoogle Scholar
• Soyster, A. L. 1973. “Convex Programming with Set-inclusive Constraints and Applications to Inexact Linear Programming.” Operations Research 210 (5): 0 1154–1157. doi:10.1287/opre.21.5.1154.
   Google Scholar
• Stewart, W. R., and B. L. Golden. 1983. “Stochastic Vehicle Routing: A Comprehensive Approach.” European Journal of Operational Research 140 (4): 0 371–385. doi:10.1016/0377-2217(83)90237-0.
   Google Scholar
• Sungur, I., F. Ordóñez, and M. Dessouky. 2008. “A Robust Optimization Approach for the Capacitated Vehicle Routing Problem with Demand Uncertainty.” IIE Transactions 400 (5): 0 509–523. doi:10.1080/07408170701745378.
   Google Scholar
• Tarantilis, C., and C. Kiranoudis. 2002. “BoneRoute: An Adaptive Memory-Based Method for Effective Fleet Management.” Annals of Operations Research 115 (1/4): 0 227–241. doi:10.1023/A:1021157406318.
   Google Scholar
• Teixeira, J., A. P. Antunes, and J. P. Sousa. 2004. “Recyclable Waste Collection Planning – A Case Study.” European Journal of Operational Research 158 (3): 0 543–554. doi:10.1016/S0377-2217(03)00379-5.
   Google Scholar
• Thiele, A., T. Terry, and M. Epelman. “Robust Linear Optimization with Recourse.” Technical report, Available in Optimization-Online, 2010.
   Google Scholar
• Tillman, F. A. 1969. “The Multiple Terminal Delivery Problem with Probabilistic Demands.” Transportation Science 30 (3): 0 192–204. doi:10.1287/trsc.3.3.192.
   Google Scholar
• Tirkolaee, E. B., P. Abbasian, M. Soltani, and S. A. Ghaffarian. 2019. “Developing an Applied Algorithm for Multi-trip Vehicle Routing Problem with Time Windows in Urban Waste Collection: A Case Study.” Waste Management & Research 370 (1): 0 4–13. doi:10.1177/0734242X18807001.
   Google Scholar
• Toth, P., and D. Vigo. 2014. Vehicle Routing: Problems, Methods, and Applications. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics.
   Google Scholar
• Verweij, B., S. Ahmed, A. J. Kleywegt, G. Nemhauser, and A. Shapiro. 2003. “The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study.” Computational Optimization and Applications 240 (2): 0 289–333. doi:10.1023/A:1021814225969.
   Google Scholar