235
Views
7
CrossRef citations to date
0
Altmetric
Original Articles

Tackling complexities of cyclic inventory routing under conditions of limited modelling and computing capacity

Pages 216-231 | Received 26 Nov 2012, Accepted 16 Aug 2013, Published online: 12 Sep 2013

References

  • Andersson, H., A. Hoff, M. Christiansen, G. Hasle, and A. Løkketangen. 2010. “Industrial Aspects and Literature Survey: Combined Inventory Management and Routing.” Computers & Operations Research 37 (9): 152–173. doi: 10.1016/j.cor.2009.11.009
  • Anily, S., and J. Bramel. 2003. “An Asymptotic 98.5%-Effective Lower Bound on Fixed Partition Policies for the Inventory-Routing Problem.” Discrete Applied Mathematics 145 (1): 22–39. doi: 10.1016/j.dam.2003.09.005
  • Anily, S., and J. Bramel. 2004. “A Probabilistic Analysis of a Fixed Partition Policy for the Inventory-Routing Problem.” Naval Research Logistics 51 (7): 925–948. doi: 10.1002/nav.20031
  • Archetti, C., L. Bertazzi, A. Hertz, and M. Speranza. 2012. “A Hybrid Heuristic for an Inventory-Routing Problem.” INFORMS Journal on Computing 24 (1): 101–116. doi: 10.1287/ijoc.1100.0439
  • Archetti, C., L. Bertazzi, G. Laporte, and M. Speranza. 2007. “A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem.” Transportation Science 41 (3): 382–390. doi: 10.1287/trsc.1060.0188
  • Bard, J. F., L. Huang, P. Jaillet, and M. Dror. 1998. “A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities.” Transportation Science 32 (2): 189–203. doi: 10.1287/trsc.32.2.189
  • Bard, J. F., and N. Nananukul. 2010. “A Branch-and-Price Algorithm for an Integrated Production and Inventory Routing Problem.” Computers & Operations Research 37 (12): 2202–2217. doi: 10.1016/j.cor.2010.03.010
  • Burns, L. D., R. W. Hall, D. E. Blumenfeld, and C. F. Daganzo. 1985. “Distribution Strategies that Minimize Transportation and Inventory Costs.” Operations Research 33 (3): 469–490. doi: 10.1287/opre.33.3.469
  • Campbell, A., and M. Savelsbergh. 2004. “A Decomposition Approach for the Inventory-Routing Problem.” Transportation Science 38 (4): 488–502. doi: 10.1287/trsc.1030.0054
  • Christophides, N., and J. Beasley. 1984. “The Period Routing Problem.” Networks 14 (2): 237–256. doi: 10.1002/net.3230140205
  • Clarke, C., and J. W. Wright. 1964. “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points.” Operations Research 12 (4): 568–581. doi: 10.1287/opre.12.4.568
  • Coelho, L. C., and G. Laporte. 2013. “The Exact Solution of Several Classes of Inventory-Routing Problems.” Computers & Operations Research 40 (2): 558–565. doi: 10.1016/j.cor.2012.08.012
  • Custódio, A., and R. Oliveira. 2006. “Redesigning Distribution Operations: A Case Study on Integrating Inventory Management and Vehicle Routes Design.” International Journal of Logistics Research and Applications 9 (2): 169–187. doi: 10.1080/13675560600649982
  • Figliozzi, M. 2008. “Planning Approximations to the Average Length of Vehicle Routing Problems with Varying Customer Demands and Routing Constraints.” Journal of the Transportation Research Record, no. 2089: 1–8. doi: 10.3141/2089-01
  • Figliozzi, M. 2009. “Planning Approximations to the Average Length of Vehicle Routing Problems with Time Window Constraints.” Transportation Research (B) 43 (4): 438–447. doi: 10.1016/j.trb.2008.08.004
  • Gillett, B., and L. Miller. 1974. “A Heuristic Algorithm for the Vehicle Dispatch Problem.” Operations Research 22 (2): 340–349. doi: 10.1287/opre.22.2.340
  • Golden, B. L., S. Raghawan, and E. A. Wasil. 2008. The Vehicle Routing Problem: Latest Advances and New Challenges. New York: Springer.
  • Hemmelmayr, V., K. F. Doerner, R. F. Hartl, and M. W. P. Savelsbergh. 2009. “Delivery Strategies for Blood Products Supplies.” OR Spectrum 31 (4): 707–725. doi: 10.1007/s00291-008-0134-7
  • Huang, S., and P. Lin. 2010. “A Modified Ant Colony Optimization Algorithm for Multi-Item Inventory Routing Problems with Demand Uncertainty.” Transportation Research Part E: Logistics and Transportation Review 46 (5): 598–611. doi: 10.1016/j.tre.2010.01.006
  • Jaillet, P., J. Bard, L. Huang, and M. Dror. 2002. “Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework.” Transportation Science 36 (3): 292–300. doi: 10.1287/trsc.36.3.292.7829
  • Laporte, G. 2007. “What You Should Know About the Vehicle Routing Problem.” Naval Research Logistics 54 (8): 811–819. doi: 10.1002/nav.20261
  • Laporte, G. 2009. “50 Years of Vehicle Routing.” Transportation Science 43 (4): 408–416. doi: 10.1287/trsc.1090.0301
  • Michel, S., and F. Vanderbeck. 2012. “A Column-Generation Based Tactical Planning Method for Inventory Routing.” Operations Research 60 (2): 382–397. doi: 10.1287/opre.1110.1015
  • Moin, N., and S. Salhi. 2007. “Inventory Routing Problems: A Logistical Overview.” Journal of the Operational Research Society 58 (9): 1185–1194. doi: 10.1057/palgrave.jors.2602264
  • Popovic, D., M. Vidovic, and G. Radivojevic. 2012. “Variable Neighborhood Search Heuristic for the Inventory Routing Problem in Fuel Delivery.” Expert Systems with Applications 39 (18): 13390–13398. doi: 10.1016/j.eswa.2012.05.064
  • Raa, B., and E. Aghezzaf. 2009. “A Practical Solution Approach for the Cyclic Inventory Routing Problem.” European Journal of Operational Research 192 (2): 429–441. doi: 10.1016/j.ejor.2007.09.032
  • Santoro, M. C., and D. P. Ronconi. 2011. “Modelling the Transportation and Warehousing of Potassium Chloride in the Fertiliser Industry.” International Journal of Logistics Systems and Management 8 (3): 298–312. doi: 10.1504/IJLSM.2011.038989
  • Silva, O. S., and J. E. Leal. 2011. “An Efficient Ant Colony System for Vehicle Routing Problems with Time Windows.” International Journal of Logistics Systems and Management 10 (2): 224–240. doi: 10.1504/IJLSM.2011.042630
  • Solyali, O., and H. Süral. 2011. “A Branch-and-Cut Algorithm Using a Strong Formulation and an a Priori Tour Based Heuristic for an Inventory-Routing Problem.” Transportation Science 45 (3): 335–345. doi: 10.1287/trsc.1100.0354
  • Souza, M. J. F., M. T. Mine, M. A. Silva, L. S. Ochi, and A. Subramanian. 2011. “A Hybrid Heuristic, Based on Iterated Local Search and GENIUS, for the Vehicle Routing Problem with Simultaneous Pickup and Delivery.” International Journal of Logistics Systems and Management 10 (2): 142–157. doi: 10.1504/IJLSM.2011.042625
  • Natarajarathinam, M., J. Stacey, and C. Sox. 2012. “Near-Optimal Heuristics and Managerial Insights for the Storage Constrained, Inbound Inventory Routing Problem.” International Journal of Physical Distribution & Logistics Management 42 (2): 152–173. doi: 10.1108/09600031211219663
  • Viau, M. A., M. Trepanier, and P. Baptiste. 2009. “Integration of Inventory and Transportation Decisions in Decentralised Supply Chains.” International Journal of Logistics Systems and Management 5 (3/4): 249–272. doi: 10.1504/IJLSM.2009.022498
  • Viswanathan, S., and K. Mathur. 1997. “Integrating Routing and Inventory Decisions in One Warehouse Multiretailer Multiproduct Distribution System.” Management Science 43 (3): 294–312. doi: 10.1287/mnsc.43.3.294
  • Zhao, Q., S. Chen, C. H. Leung, and K. K. Lai. 2010. “Integration of Inventory and Transportation Decisions in a Logistics System.” Transportation Research Part E: Logistics and Transportation Review 46 (6): 913–925. doi: 10.1016/j.tre.2010.03.001

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.