IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v133y2011i1p334-343.html
   My bibliography  Save this article

An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem

Author

Listed:
  • Moin, N.H.
  • Salhi, S.
  • Aziz, N.A.B.

Abstract

The inventory routing problem (IRP) addressed in this study is a many-to-one distribution network consisting of an assembly plant and many distinct suppliers where each supplies a distinct product. We consider a finite horizon, multi-periods, multi-suppliers and multi-products where a fleet of capacitated homogeneous vehicles, housed at a depot, transport products from the suppliers to meet the demand specified by the assembly plant in each period. The demand for each product is deterministic and time varying. A mathematical formulation of the problem is given and CPLEX 9.1 is run for a finite amount of time to obtain lower and upper bounds. A hybrid genetic algorithm, which is based on the allocation first route second strategy and which considers both the inventory and the transportation costs, is proposed. In addition to a new set of crossover and mutation operators, we also introduce two new chromosome representations. Several medium and small sized problems are also constructed and added to the existing data sets to show the effectiveness of the proposed approach.

Suggested Citation

  • Moin, N.H. & Salhi, S. & Aziz, N.A.B., 2011. "An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem," International Journal of Production Economics, Elsevier, vol. 133(1), pages 334-343, September.
    • Handle: RePEc:eee:proeco:v:133:y:2011:i:1:p:334-343
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527310002203
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Pierre Trudeau & Moshe Dror, 1992. "Stochastic Inventory Routing: Route Design with Stockouts and Route Failures," Transportation Science, INFORMS, vol. 26(3), pages 171-184, August.
    2. Moshe Dror & Pierre Trudeau, 1989. "Savings by Split Delivery Routing," Transportation Science, INFORMS, vol. 23(2), pages 141-145, May.
    3. Bertazzi, Luca & Speranza, Maria Grazia & Ukovich, Walter, 1997. "Minimization of logistic costs with given frequencies," Transportation Research Part B: Methodological, Elsevier, vol. 31(4), pages 327-340, August.
    4. Yu, Yugang & Chen, Haoxun & Chu, Feng, 2008. "A new model and hybrid approach for large scale inventory routing problems," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1022-1040, September.
    5. Awi Federgruen & Gregory Prastacos & Paul H. Zipkin, 1986. "An Allocation and Distribution Model for Perishable Products," Operations Research, INFORMS, vol. 34(1), pages 75-82, February.
    6. N H Moin & S Salhi, 2007. "Inventory routing problems: a logistical overview," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(9), pages 1185-1194, September.
    7. T. William Chien & Anantaram Balakrishnan & Richard T. Wong, 1989. "An Integrated Inventory Allocation and Vehicle Routing Problem," Transportation Science, INFORMS, vol. 23(2), pages 67-76, May.
    8. Luca Bertazzi & Giuseppe Paletta & M. Grazia Speranza, 2002. "Deterministic Order-Up-To Level Policies in an Inventory Routing Problem," Transportation Science, INFORMS, vol. 36(1), pages 119-132, February.
    9. Awi Federgruen & Paul Zipkin, 1984. "A Combined Vehicle Routing and Inventory Allocation Problem," Operations Research, INFORMS, vol. 32(5), pages 1019-1037, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Leandro C. Coelho & Jean-François Cordeau & Gilbert Laporte, 2014. "Thirty Years of Inventory Routing," Transportation Science, INFORMS, vol. 48(1), pages 1-19, February.
    2. Oğuz Solyalı & Haldun 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, INFORMS, vol. 45(3), pages 335-345, August.
    3. N H Moin & S Salhi, 2007. "Inventory routing problems: a logistical overview," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(9), pages 1185-1194, September.
    4. Oğuz Solyalı & Jean-François Cordeau & Gilbert Laporte, 2012. "Robust Inventory Routing Under Demand Uncertainty," Transportation Science, INFORMS, vol. 46(3), pages 327-340, August.
    5. Jafarian, Ahmad & Asgari, Nasrin & Mohri, Seyed Sina & Fatemi-Sadr, Elham & Farahani, Reza Zanjirani, 2019. "The inventory-routing problem subject to vehicle failure," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 254-294.
    6. Mohd Kamarul Irwan Abdul Rahim & El-Houssaine Aghezzaf & Veronique Limère & Birger Raa, 2016. "Analysing the effectiveness of vendor-managed inventory in a single-warehouse, multiple-retailer system," International Journal of Systems Science, Taylor & Francis Journals, vol. 47(8), pages 1953-1965, June.
    7. Jin-Hwa Song & Martin Savelsbergh, 2007. "Performance Measurement for Inventory Routing," Transportation Science, INFORMS, vol. 41(1), pages 44-54, February.
    8. Bertazzi, Luca & Moezi, Sarem Deilami & Maggioni, Francesca, 2021. "The value of integration of full container load, less than container load and air freight shipments in vendor–managed inventory systems," International Journal of Production Economics, Elsevier, vol. 241(C).
    9. Anton J. Kleywegt & Vijay S. Nori & Martin W. P. Savelsbergh, 2004. "Dynamic Programming Approximations for a Stochastic Inventory Routing Problem," Transportation Science, INFORMS, vol. 38(1), pages 42-70, February.
    10. Yu, Yugang & Chen, Haoxun & Chu, Feng, 2008. "A new model and hybrid approach for large scale inventory routing problems," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1022-1040, September.
    11. Kim, Jung-Ug & Kim, Yeong-Dae, 1999. "A decomposition approach to a multi-period vehicle scheduling problem," Omega, Elsevier, vol. 27(4), pages 421-430, August.
    12. Baita, Flavio & Ukovich, Walter & Pesenti, Raffaele & Favaretto, Daniela, 1998. "Dynamic routing-and-inventory problems: a review," Transportation Research Part A: Policy and Practice, Elsevier, vol. 32(8), pages 585-598, November.
    13. Luca Bertazzi & Maria Grazia Speranza & Walter Ukovich, 2000. "Exact and Heuristic Solutions for a Shipment Problem with Given Frequencies," Management Science, INFORMS, vol. 46(7), pages 973-988, July.
    14. Pan, Zhendong & Tang, Jiafu & Fung, Richard Y.K., 2009. "Synchronization of inventory and transportation under flexible vehicle constraint: A heuristics approach using sliding windows and hierarchical tree structure," European Journal of Operational Research, Elsevier, vol. 192(3), pages 824-836, February.
    15. Pamela C. Nolz, 2021. "Optimizing construction schedules and material deliveries in city logistics: a case study from the building industry," Flexible Services and Manufacturing Journal, Springer, vol. 33(3), pages 846-878, September.
    16. Yves Crama & Mahmood Rezaei & Martin Savelsbergh & Tom Van Woensel, 2018. "Stochastic Inventory Routing for Perishable Products," Transportation Science, INFORMS, vol. 52(3), pages 526-546, June.
    17. Anton J. Kleywegt & Vijay S. Nori & Martin W. P. Savelsbergh, 2002. "The Stochastic Inventory Routing Problem with Direct Deliveries," Transportation Science, INFORMS, vol. 36(1), pages 94-118, February.
    18. Ali Ekici & Okan Örsan Özener & Gültekin Kuyzu, 2015. "Cyclic Delivery Schedules for an Inventory Routing Problem," Transportation Science, INFORMS, vol. 49(4), pages 817-829, November.
    19. Zhouxing Su & Zhipeng Lü & Zhuo Wang & Yanmin Qi & Una Benlic, 2020. "A Matheuristic Algorithm for the Inventory Routing Problem," Transportation Science, INFORMS, vol. 54(2), pages 330-354, March.
    20. Yugang Yu & Chengbin Chu & Haoxun Chen & Feng Chu, 2012. "Large scale stochastic inventory routing problems with split delivery and service level constraints," Annals of Operations Research, Springer, vol. 197(1), pages 135-158, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:proeco:v:133:y:2011:i:1:p:334-343. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.