The Fixed-Partition Policy Inventory Routing Problem

Published Online:https://doi.org/10.1287/trsc.2020.1019

References

  • Anily S, Bramel J (2004a) An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem. Discrete Appl. Math. 145(1):22–39.CrossrefGoogle Scholar
  • Anily S, Bramel J (2004b) A probabilistic analysis of a fixed partition policy for an inventory-routing models. Naval Res. Logist. 51(7):925–948.CrossrefGoogle Scholar
  • Anily S, Federgruen A (1990) One warehouse multiple retailer systems with vehicle routing costs. Management Sci. 36(1):92–114.LinkGoogle Scholar
  • Archetti C, Speranza MG (2016) The inventory routing prob-lem: The value of integration. Internat. Trans. Oper. Res. 23(3):393–407.CrossrefGoogle Scholar
  • Archetti C, Bertazzi L, Laporte G, Speranza MG (2007) A branch-and-cut algorithm for a vendor managed inventory routing problem. Transportation Sci. 41(3):382–391.LinkGoogle Scholar
  • Archetti C, Bianchessi N, Irnich S, Speranza MG (2014) Formulations for an inventory routing problem. Internat. Trans. Oper. Res. 21(3):353–374.CrossrefGoogle Scholar
  • Bertazzi L, Speranza M (2012) Inventory routing problems: An introduction. EURO J. Transportation Logist. 1(4):307–326.CrossrefGoogle Scholar
  • Bertazzi L, Speranza M (2013) Inventory routing problems with multiple customers. EURO J. Transportation Logist. 2(3):255–275.CrossrefGoogle Scholar
  • Bitran GR, Yanasse HH (1982) Computational complexity of the capacitated lot size problem. Management Sci. 28(10):1174–1186.LinkGoogle Scholar
  • Chan L, Federgruen A, Simchi-Levi D (1998) Probabilistic analyses and practical algorithms for inventory-routing models. Oper. Res. 46(1):96–106.LinkGoogle Scholar
  • Coelho L, Cordeau J-F, Laporte G (2014) Thirty years of inventory routing. Transportation Sci. 48(1):1–19.LinkGoogle Scholar
  • Coelho LC, Cordeau J-F, Laporte G (2012) Consistency in multi-vehicle inventory-routing. Transportation Res.: Part C Emerging Tech. 24:270–287.CrossrefGoogle Scholar
  • Feillet D, Garaix T, Lehuédé F, Péton O, Quadri D (2014) A new consistent vehicle routing problem for the transportation of people with disabilities. Networks 63(3):211–224.CrossrefGoogle Scholar
  • Fleischer S, Berg A, Zimmermann M, Wüste K, Behrens J (2009) Nurse-patient interaction and communication: A systematic literature review. J. Public Health 17(5):339–353.CrossrefGoogle Scholar
  • Florian M, Lenstra JK, Rinnooy Kan AHG (1980) Deterministic production planning: Algorithms and complexity. Management Sci. 26(7):669–679.LinkGoogle Scholar
  • Gaur V, Fisher M (2004) A periodic inventory routing problem at a supermarket chain. Oper. Res. 52(6):813–822.LinkGoogle Scholar
  • Groër C, Golden B, Wasil E (2009) The consistent vehicle routing problem. Manufacturing Service Oper. Management 11(4):630–643.LinkGoogle Scholar
  • Kovacs AA, Parragh SN, Hartl RF (2014a) A template-based adaptive large neighborhood search for the consistent vehicle routing problem. Networks 63(1):60–81.CrossrefGoogle Scholar
  • Kovacs AA, Golden BL, Hartl RF, Parragh SN (2014b) The generalized consistent vehicle routing problem. Transportation Sci. 49(4):796–816.LinkGoogle Scholar
  • Li J, Chu F, Chen H (2011) A solution approach to the inventory routing problem in a three-level distribution system. Eur. J. Oper. Res. 210(3):736–744.CrossrefGoogle Scholar
  • Macdonald T, Dörner K, Gandibleux X (2009) Metaheuristics for the consistent nurse scheduling and routing problem. MS thesis, Université de Nantes, Nantes, France.Google Scholar
  • Massey D, Chaboyer W, Aitken L (2014) Nurses’ perceptions of accessing a medical emergency team: A qualitative study. Australian Critical Care 27(3):133–138.CrossrefGoogle Scholar
  • Minick P, Harvey S (2003) The early recognition of patient problems among medical-surgical nurses. Medsurgical Nursing 12(5):291–297.Google Scholar
  • Mok E, Chiu PC (2004) Nurse–patient relationships in palliative care. J. Adv. Nursing 48(5):475–483.CrossrefGoogle Scholar
  • Padberg M, Rinaldi G (1991) A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33(1):60–100.CrossrefGoogle Scholar
  • Pillac V, Gueret C, Medaglia A (2012) Route consistency vehicle routing: A bi-objective approach. ROADEF 2012, Angers, France. Google Scholar
  • Raa B, Aghezzaf E-H (2009) A practical solution approach for the cyclic inventory routing problem. Eur. J. Oper. Res. 192(2):429–441.CrossrefGoogle Scholar
  • Raa B, Dullaert W (2017) Route and fleet design for cyclic inventory routing. Eur. J. Oper. Res. 256(2):404–411.CrossrefGoogle Scholar
  • Ralphs T, Kopman L, Pulleyblank W, Trotter L (2003) On the capacitated vehicle routing problem. Math. Programming 94(2):343–359.CrossrefGoogle Scholar
  • Rodríguez-Martín I, Salazar-González J-J, Yaman H (2019) The periodic vehicle routing problem with driver consistency. Eur. J. Oper. Res. 273(2):575–584.CrossrefGoogle Scholar
  • Sörensen K (2006) Route stability in vehicle routing decisions: A bi-objective approach using metaheuristics. Central Eur. J. Oper. Res. 14(2):193–207.CrossrefGoogle Scholar
  • Zhao Q-H, Wang S-Y, Lai K (2007) A partition approach to the inventory/routing problem. Eur. J. Oper. Res. 177(2):786–802.CrossrefGoogle 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.