Optimal Transportation Planning for a Do-It-Yourself Retailer with a Zone-Based Tariff

Published Online:https://doi.org/10.1287/inte.2023.0020

References

  • Agarwal Y, Mathur K, Salkin HM (1989) A set-partitioning-based exact algorithm for the vehicle routing problem. Networks 19(7):731–749.Google Scholar
  • Alcaraz JJ, Caballero-Arnaldos L, Vales-Alonso J (2019) Rich vehicle routing problem with last-mile outsourcing decisions. Transportation Res. Part E Logist. Transportation Rev. 129:263–286.Google Scholar
  • Balinski ML, Quandt RE (1964) On an integer program for a delivery problem. Oper. Res. 12(2):300–304.LinkGoogle Scholar
  • Buijs P, Alvarez JAL, Veenstra M, Roodbergen KJ (2016) Improved collaborative transport planning at Dutch logistics service provider Fritom. Interfaces 46(2):119–132.LinkGoogle Scholar
  • Caceres-Cruz J, Arias P, Guimarans D, Riera D, Juan AA (2014) Rich vehicle routing problem: Survey. ACM Comput. Surv. 47(2):1–28.Google Scholar
  • Ceschia S, Di Gaspero L, Schaerf A (2011) Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs. J. Sched. 14(6):601–615.Google Scholar
  • Ceselli A, Righini G, Salani M (2009) A column generation algorithm for a rich vehicle-routing problem. Transportation Sci. 43(1):56–69.LinkGoogle Scholar
  • Crainic TG, Crisan GC, Gendreau M, Lahrichi N, Rei W (2009) Multi-thread integrative cooperative optimization for rich combinatorial problems. Proc. 2009 IEEE Internat. Sympos. Parallel Distributed Processing, IPDPS ‘09 (IEEE Computer Society, Washington, DC), 1–8.Google Scholar
  • Dabia S, Lai D, Vigo D (2019) An exact algorithm for a rich vehicle routing problem with private fleet and common carrier. Transportation Sci. 53(4):986–1000.LinkGoogle Scholar
  • Dang Y, Singh M, Allen TT (2021) Network mode optimization for the DHL supply chain. INFORMS J. Appl. Analytics 51(3):179–199.LinkGoogle Scholar
  • Fadda E, Gobbato L, Perboli G, Rosano M, Tadei R (2018) Waste collection in urban areas: A case study. Interfaces 48(4):307–322.LinkGoogle Scholar
  • Guidotti R, Monreale A, Ruggieri S, Turini F, Giannotti F, Pedreschi D (2018) A survey of methods for explaining black box models. ACM Comput. Surv. 51(5):1–42.Google Scholar
  • Held M, Karp RM (1962) A dynamic programming approach to sequencing problems. J. Soc. Indust. Appl. Math. 10(1):196–210.Google Scholar
  • Holguín-Veras J, Hodge S, Wojtowicz J, Singh C, Wang C, Jaller M, Aros-Vera F, et al. (2018) The New York City off-hour delivery program: A business and community-friendly sustainability program. Interfaces 48(1):70–86.LinkGoogle Scholar
  • Hu H, Zhang Y, Wei J, Zhan Y, Zhang X, Huang S, Ma G, Deng Y, Jiang S (2022) Alibaba vehicle routing algorithms enable rapid pick and delivery. INFORMS J. Appl. Analytics 52(1):27–41.LinkGoogle Scholar
  • Keskin BB, Çapar İ, Sox CR, Freeman NK (2014) An integrated load-planning algorithm for outbound logistics at Webb Wheel. Interfaces 44(5):480–497.LinkGoogle Scholar
  • Khodabandeh E, Snyder LV, Dennis J, Hammond J, Wanless C (2021) C. H. Robinson uses heuristics to solve rich vehicle routing problems. INFORMS J. Appl. Analytics 52(2):173–178.Google Scholar
  • Kramer R, Cordeau JF, Iori M (2019) Rich vehicle routing with auxiliary depots and anticipated deliveries: An application to pharmaceutical distribution. Transportation Res. Part E Logist. Transportation Rev. 129:162–174.Google Scholar
  • Lahyani R, Khemakhem M, Semet F (2015) Rich vehicle routing problems: From a taxonomy to a definition. Eur. J. Oper. Res. 241(1):1–14.Google Scholar
  • Linß F, Tamke F (2022) An exact approach for a vehicle routing problem with common carrier selection. Logist. Res. 15(1).Google Scholar
  • Lindsey KA, Erera AL, Savelsbergh MW (2013) A pickup and delivery problem using crossdocks and truckload lane rates. EURO J. Transportation Logist. 2(1–2):5–27.Google Scholar
  • Mancini S (2016) A real-life multi depot multi period vehicle routing problem with a heterogeneous fleet: Formulation and adaptive large neighborhood search based matheuristic. Transportation Res. Part C Emerging Tech. 70:100–112.Google Scholar
  • Montoya-Torres JR, López Franco J, Nieto Isaza S, Felizzola Jiménez H, Herazo-Padilla N (2015) A literature review on the vehicle routing problem with multiple depots. Comput. Indust. Engrg. 79:115–129.Google Scholar
  • Rodrigue JP (2020) The Geography of Transport Systems, 5th ed. (Routledge, London).Google Scholar
  • Savelsbergh MW, Sol M (1995) The general pickup and delivery problem. Transportation Sci. 29(1):17–29.LinkGoogle Scholar
  • Sprenger R, Mönch L (2012) A methodology to solve large-scale cooperative transportation planning problems. Eur. J. Oper. Res. 223(3):626–636.Google Scholar
  • Statista (2021) Worldwide home improvement market value from 2020 to 2027 (in billion USD). Accessed November 14, 2022, https://www.statista.com/statistics/1237157/home-improvement-market-value-worldwide/.Google Scholar
  • Stenger A, Schneider M, Goeke D (2013) The prize-collecting vehicle routing problem with single and multiple depots and non-linear cost. EURO J. Transp. Logist. 2(1–2):57–87.Google Scholar
  • Vidal T, Crainic TG, Gendreau M, Prins C (2013) Heuristics for multi-attribute vehicle routing problems: A survey and synthesis. Eur. J. Oper. Res. 231(1):1–21.Google Scholar
  • Vidal T, Crainic TG, Gendreau M, Prins C (2014) A unified solution framework for multi-attribute vehicle routing problems. Eur. J. Oper. Res. 234(3):658–673.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.