A New Approach for Vehicle Routing with Stochastic Demand: Combining Route Assignment with Process Flexibility

References

• Ak A, Erera AL (2007) A paired-vehicle recourse strategy for the vehicle-routing problem with stochastic demands. Transportation Sci. 41(2):222–237.Link, Google Scholar
• Asadpour A, Wang X, Zhang J (2020) Online resource allocation with limited flexibility. Management Sci. 66(2):642–666.Link, Google Scholar
• Bartholdi III JJ, Platzman LK, Collins RL, Warden III WH (1983) A minimal technology routing system for meals on wheels. Interfaces 13(3):1–8.Link, Google Scholar
• Beardwood J, Halton JH, Hammersley JM (1959) The shortest path through many points. Math. Proc. Cambridge Philos. Soc. 55(4):299–327.Crossref, Google Scholar
• Bertsimas DJ (1992) A vehicle routing problem with stochastic demand. Oper. Res. 40(3):574–585.Link, Google Scholar
• Bertsimas DJ, Jaillet P, Odoni AR (1990) A priori optimization. Oper. Res. 38(6):1019–1033.Link, Google Scholar
• Carlsson JG (2012) Dividing a territory among several vehicles. INFORMS J. Comput. 24(4):565–577.Link, Google Scholar
• Carlsson JG, Delage E (2013) Robust partitioning for stochastic multivehicle routing. Oper. Res. 61(3):727–744.Link, Google Scholar
• Chen X, Ma T, Zhang J, Zhou Y (2019) Optimal design of process flexibility for general production systems. Oper. Res. 67(2):516–531.Abstract, Google Scholar
• Chou MC, Geoffrey A Chua C-PT, Zheng H (2010) Design for process flexibility: Efficiency of the long chain and sparse structure. Oper. Res. 58(1):43–58.Link, Google Scholar
• Chou MC, Geoffrey A Chua C-PT, Zheng H (2011) Process flexibility revisited: The graph expander and its applications. Oper. Res. 59(5):1090–1105.Link, Google Scholar
• Chou MC, Teo C-P, Zheng H (2008) Process flexibility: Design, evaluation, and applications. Flexible Services Manufacturing J. 20(1–2):59–94.Crossref, Google Scholar
• Christofides N (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, Management Sciences Research Group, Carnegie-Mellon University, Pittsburgh.Google Scholar
• Cook W (2003) Concorde TSP solver. http://www.math.uwaterloo.ca/tsp/concorde/index.html.Google Scholar
• DeValve L, Wei Y, Di Wu RY (2021) Understanding the value of fulfillment flexibility in an online retailing environment. Manufacturing Service Oper. Management, ePub ahead of print July 12, https://doi.org/10.1287/msom.2021.098.Link, Google Scholar
• Erera AL, Morales JC, Savelsbergh M (2010) The vehicle routing problem with stochastic demand and duration constraints. Transportation Sci. 44(4):474–492.Link, Google Scholar
• Erera AL, Savelsbergh M, Uyar E (2009) Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints. Networks 54(4):270–283.Crossref, Google Scholar
• Gendreau M, Jabali O, Rei W (2014) Stochastic vehicle routing problems. Toth P, Vigo D, eds. Vehicle Routing: Problems, Methods, and Applications, 2nd ed. (SIAM, Philadelphia), 213–239.Crossref, Google Scholar
• Gendreau M, Jabali O, Rei W (2016) Future research directions in stochastic vehicle routing. Transportation Sci. 50(4):1163–1173.Link, Google Scholar
• Haimovich M, Rinnooy Kan AHG (1985) Bounds and heuristics for capacitated routing problems. Math. Oper. Res. 10(4):527–542.Link, Google Scholar
• Jaillet P (1988) A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res. 36(6):929–936.Link, Google Scholar
• Jordan W, Graves S (1995) Principles on the benefits of manufacturing process flexibility. Management Sci. 41(4):577–594.Link, Google Scholar
• Kleywegt AJ, Nori VS, Savelsbergh MWP (2004) Dynamic programming approximations for a stochastic inventory routing problem. Transportation Sci. 38(1):42–70.Link, Google Scholar
• Kovacs AA, Golden BL, Hartl RF, Parragh SN (2014) Vehicle routing problems in which consistency considerations are important: A survey. Networks 64(3):192–213.Crossref, Google Scholar
• Lei H, Laporte G, Guo B (2012) The vehicle routing problem with stochastic demands and split deliveries. INFOR Inform. Systems Oper. Res. 50(2):59–71.Crossref, Google Scholar
• Lyu G, Cheung W-C, Chou MC, Teo C-P, Zheng Z, Zhong Y (2019) Capacity allocation in flexible production networks: Theory and applications. Management Sci. 65(11):5091–5109.Link, Google Scholar
• Perron L, Furnon V (2019) OR-tools. https://developers.google.com/optimization/.Google Scholar
• Secomandi N, Margot F (2009) Reoptimization approaches for the vehicle-routing problem with stochastic demands. Oper. Res. 57(1):214–230.Link, Google Scholar
• Simchi-Levi D, Wei Y (2012) Understanding the performance of the long chain and sparse designs in process flexibility. Oper. Res. 60(5):1125–1141.Link, Google Scholar
• Simchi-Levi D, Wei Y (2015) Worst-case analysis of process flexibility designs. Oper. Res. 63(1):166–185.Link, Google Scholar
• Simchi-Levi D, Chen X, Bramel J (2014) The Logic of Logistics: Theory, Algorithms, and Applications for Logistics Management, 3rd ed. (Springer, Berlin).Crossref, Google Scholar
• Stroh AM, Erera AL, Toriello A (2022) Tactical design of same-day delivery systems. Management Sci. 68(5):3444–3463.Link, Google Scholar
• Wang X, Zhang J (2015) Process flexibility: A distribution-free bound on the performance of k-chain. Oper. Res. 63(3):555–571.Link, Google Scholar
• Wang S, Wang X, Zhang J (2021) A review of flexible processes and operations. Production Oper. Management 30(6):1804–1824.Crossref, Google Scholar
• Xu Z, Zhang H, Zhang J, Zhang RQ (2020) Online demand fulfillment under limited flexibility. Management Sci. 66(10):4667–4685.Link, Google Scholar