Simulation-based optimisation approach for the stochastic two-echelon logistics problem

References

• Balaprakash, P., M. Birattari, T. Stützle, and M. Dorigo. 2009. “Adaptive Sample Size and Importance Sampling in Estimation-based Local Search for the Probabilistic Traveling Salesman Problem.” European Journal of Operational Research 199: 98–110.10.1016/j.ejor.2008.11.027
   Web of Science ®Google Scholar
• Baldacci, R., A. Mingozzi, R. Roberti, and R. Wolfler Calvo. 2013. “An Exact Algorithm for the Two-echelon Capacitated Vehicle Routing Problem.” Operations Research 61: 298–314.10.1287/opre.1120.1153
   Web of Science ®Google Scholar
• Birattari, M., P. Balaprakash, T. Stützle, and M. Dorigo. 2008. “Estimation-based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem.” INFORMS Journal on Computing 20 (4): 644–658.10.1287/ijoc.1080.0276
   Web of Science ®Google Scholar
• Chepuri, K., and T. Homem-de-Mello. 2005. “Solving the Vehicle Routing Problem with Stochastic Demands Using the Cross-entropy Method.” Annals of Operations Research 134: 153–181.10.1007/s10479-005-5729-7
   Web of Science ®Google Scholar
• Christiansen, C. H., and J. Lysgaard. 2007. “A Branch-and-price Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands.” Operations Research Letters 35 (6): 773–781.10.1016/j.orl.2006.12.009
   Web of Science ®Google Scholar
• Clarke, G., and J. W. Wright. 1964. “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points.” Operations Research 12: 568–581.10.1287/opre.12.4.568
   Web of Science ®Google Scholar
• Coelho, L. C., and G. Laporte. 2013. “A Branch-and-cut Algorithm for the Multi-product Multi-vehicle Inventory-routing Problem.” International Journal of Production Research 51: 7156–7169.10.1080/00207543.2012.757668
   Web of Science ®Google Scholar
• Contardo, C., V. Hemmelmayr, and T. G. Crainic. 2012. “Lower and Upper Bounds for the Two-echelon Capacitated Location-routing Problem.” Computers & Operations Research 39: 3185–3199.
   PubMed Web of Science ®Google Scholar
• Cordeau, J.-F., M. Gendreau, and G. Laporte. 1997. “A Tabu Search Heuristic for Periodic and Multi-depot Vehicle Routing Problems.” Networks 30 (2): 105–119.10.1002/(ISSN)1097-0037
   Web of Science ®Google Scholar
• Crainic, T. G., S. Mancini, G. Perboli, and R. Tadei. 2008. “Clustering-based Heuristics for the Two-echelon Vehicle Routing Problem.” Technical Report CIRRELT-2008-46, Montreal: CIRRELT.
   Google Scholar
• Crainic, T. G., G. Perboli, S. Mancini, and R. Tadei. 2010. “Two-echelon Vehicle Routing Problem: A Satellite Location Analysis.” Procedia Social and Behavioral Sciences 2: 5944–5955.10.1016/j.sbspro.2010.04.009
   Google Scholar
• Crainic, T. G, S. Mancini, G. Perboli, and R. Tadei. 2011. “Multi-start Heuristics for the Two-echelon Vehicle Routing Problem.” In Evolutionary Computation in Combinatorial Optimization: Lecture Notes in Computer Science 6622, edited by P. Merz, and J.-K Hao, 179–190. Torino, Italy: Springer.
   Google Scholar
• Dror, M., and P. Trudeau. 1986. “Stochastic Vehicle Routing with Modified Savings Algorithm.” European Journal of Operational Research 23: 228–235.10.1016/0377-2217(86)90242-0
   Web of Science ®Google Scholar
• 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.10.1287/trsc.1100.0324
   Web of Science ®Google Scholar
• Gendreau, M., G. Laporte, and R. Séguin. 1995. “An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers.” Transportation Science 29 (2): 143–155.10.1287/trsc.29.2.143
   Web of Science ®Google Scholar
• Gendreau, M., G. Laporte, and R. Séguin. 1996. “A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers.” Operations Research 44 (3): 469–477.10.1287/opre.44.3.469
   Web of Science ®Google Scholar
• Gonzáles-Feliu, J. G., G. Perboli, R. Tadei, and D. Vigo. 2007. “The Two-echelon Capacitated Vehicle Routing Problem.” Technical report DEIS OR.INGCE 2007/2(R), Bologna: Department of Electronics, Computer Science and Systems, University of Bologna.
   Google Scholar
• Hemmelmayr, V. C., J.-F. Cordeau, and T. G. Crainic. 2012. “An Adaptive Large Neighborhood Search Heuristic for Two-echelon Vehicle Routing Problems Arising in City Logistics.” Computers & Operations Research 39: 3215–3228.
   PubMed Web of Science ®Google Scholar
• Hjorring, C., and J. Holt. 1999. “New Optimality Cuts for a Single-vehicle Stochastic Routing Problem.” Annals of Operations Research 86: 569–584.10.1023/A:1018995927636
   Web of Science ®Google Scholar
• Jepsen, M., S. Spoorendonk, and S. Ropke. 2013. “A Branch-and-cut Algorithm for the Symmetric Two-echelon Capacitated Vehicle Routing Problem.” Transportation Science 47 (1): 649–672.
   Web of Science ®Google Scholar
• Laporte, G., F. V. Louveaux, and H. Mercure. 1989. “Models and Exact Solutions for a Class of Stochastic Location-routing Problems.” European Journal of Operational Research 39: 71–78.10.1016/0377-2217(89)90354-8
   Web of Science ®Google Scholar
• Laporte, G., F. V. Louveaux, and L. V. Hamme. 2002. “An Integer L -Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands.” Operations Research 50 (3): 415–423.10.1287/opre.50.3.415.7751
   Web of Science ®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 37: 1886–1898.
   Web of Science ®Google Scholar
• Nguyen, V. P., C. Prins, and C. Prodhon. 2012a. “Solving the Two-echelon Location Routing Problem by a GRASP Reinforced by a Learning Process and Path Relinking.” European Journal of Operational Research 216: 113–126.10.1016/j.ejor.2011.07.030
   Web of Science ®Google Scholar
• Nguyen, V. P., C. Prins, and C. Prodhon. 2012b. “A Multi-start Iterated Local Search with Tabu List and Path Relinking for the Two-echelon Location-routing Problem.” Engineering Applications of Artificial Intelligence 25: 56–71.10.1016/j.engappai.2011.09.012
   Web of Science ®Google Scholar
• Novoa, C., and R. Storer. 2009. “An Approximate Dynamic Programming Approach for the Vehicle Routing Problem with Stochastic Demands.” European Journal of Operational Research 196: 509–515.10.1016/j.ejor.2008.03.023
   Web of Science ®Google Scholar
• Perboli, G., and R. Tadei. 2010. “New Families of Valid Inequalities for the Two-echelon Vehicle Routing Problem.” Electronic Notes in Discrete Mathematics 36: 639–646.10.1016/j.endm.2010.05.081
   Google Scholar
• Perboli, G., R. Tadei, and D. Vigo. 2011. “The Two-echelon Capacitated Vehicle Routing Problem: Models and Math-based Heuristics.” Transportation Science 45 (3): 364–380.10.1287/trsc.1110.0368
   Web of Science ®Google Scholar
• Rahmani, Y., W. R. Cherif-Khettaf, and A. Oulamara. 2016. “The Two-echelon Multi-products Location-routing Problem with Pickup and Delivery: Formulation and Heuristic Approaches.” International Journal of Production Research 54 (4): 999–1019.10.1080/00207543.2015.1040127
   Web of Science ®Google Scholar
• Ritzinger, U., J. Puchinger, and R. F. Hartl. 2016. “A Survey on Dynamic and Stochastic Vehicle Routing Problems.” International Journal of Production Research 54: 215–231.10.1080/00207543.2015.1043403
   Web of Science ®Google Scholar
• Santos, F. A., A. S. Cunha, and G. R. Mateus. 2012. “Branch-and-price Algorithms for the Two-echelon Capacitated Vehicle Routing Problem.” Optimization Letters 7 (7): 1537–1547.
   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 8: 387–407.10.1007/s10852-009-9113-5
   Google Scholar
• Stewart Jr, W. R., and B. L. Golden. 1983. “Stochastic Vehicle Routing: A Comprehensive Approach.” European Journal of Operational Research 14: 371–385.10.1016/0377-2217(83)90237-0
   Web of Science ®Google Scholar
• Tan, K. C., C. Y. Cheong, and C. K. Goh. 2007. “Solving Multiobjective Vehicle Routing Problem with Stochastic Demand via Evolutionary Computation.” European Journal of Operational Research 177: 813–839.10.1016/j.ejor.2005.12.029
   Web of Science ®Google Scholar
• Tillman, F. A. 1969. “The Multiple Terminal Delivery Problem with Probabilistic Demands.” Transportation Science 3: 192–204.10.1287/trsc.3.3.192
   Google Scholar
• Weyland, D., R. Montemanni, and L. M. Gambardella. 2013. “Heuristics for the Probabilistic Traveling Salesman Problem with Deadlines Based on Quasi-parallel Monte Carlo Sampling.” Computers & Operations Research 40: 1661–1670.
   Web of Science ®Google Scholar
• Yuan, B., R. Liu, and Z. B. Jiang. 2015. “A Branch-and-price Algorithm for the Home Health Care Scheduling and Routing Problem with Stochastic Service times and Skill Requirements.” International Journal of Production Research 53 (24): 7450–7464.10.1080/00207543.2015.1082041
   Web of Science ®Google Scholar