IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v242y2016i2d10.1007_s10479-014-1640-4.html
   My bibliography  Save this article

A hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goods

Author

Listed:
  • Ali Diabat

    (Masdar Institute of Science and Technology)

  • Tarek Abdallah

    (New York University)

  • Tung Le

    (LLamasoft, Inc.)

Abstract

Most of the research on integrated inventory and routing problems ignores the case when products are perishable. However, considering the integrated problem with perishable goods is crucial since any discrepancy between the routing and inventory cost can double down the risk of higher obsolescence costs due to the limited shelf-life of the products. In this paper, we consider a distribution problem involving a depot, a set of customers and a homogeneous fleet of capacitated vehicles. Perishable goods are transported from the depot to customers in such a way that out-of-stock situations never occur. The objective is to simultaneously determine the inventory and routing decisions over a given time horizon such that total transportation cost is minimized. We present a new “arc-based formulation” for the problem which is deemed more suitable for our new tabu search based approach for solving the problem. We perform a thorough sensitivity analysis for each of the tabu search parameters individually and use the obtained gaps to fine-tune the parameter values that are used in solving larger sized instances of the problem. We solve different sizes of randomly generated instances and compare the results obtained using the tabu search algorithm to those obtained by solving the problem using CPLEX and a recently published column generation algorithm. Our computational experiments demonstrate that the tabu search algorithm is capable of obtaining a near-optimal solution in less computational time than the time required to solve the problem to optimality using CPLEX, and outperforms the column generation algorithm for solving the “path flow formulation” of the problem in terms of solution quality in almost all of the considered instances.

Suggested Citation

  • Ali Diabat & Tarek Abdallah & Tung Le, 2016. "A hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goods," Annals of Operations Research, Springer, vol. 242(2), pages 373-398, July.
  • Handle: RePEc:spr:annopr:v:242:y:2016:i:2:d:10.1007_s10479-014-1640-4
    DOI: 10.1007/s10479-014-1640-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-014-1640-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10479-014-1640-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Michel Gendreau & Alain Hertz & Gilbert Laporte, 1994. "A Tabu Search Heuristic for the Vehicle Routing Problem," Management Science, INFORMS, vol. 40(10), pages 1276-1290, October.
    2. Francis, Peter & Smilowitz, Karen, 2006. "Modeling techniques for periodic vehicle routing problems," Transportation Research Part B: Methodological, Elsevier, vol. 40(10), pages 872-884, December.
    3. Michel Gendreau & Alain Hertz & Gilbert Laporte, 1992. "New Insertion and Postoptimization Procedures for the Traveling Salesman Problem," Operations Research, INFORMS, vol. 40(6), pages 1086-1094, December.
    4. Peter Francis & Karen Smilowitz & Michal Tzur, 2006. "The Period Vehicle Routing Problem with Service Choice," Transportation Science, INFORMS, vol. 40(4), pages 439-454, November.
    5. Hau L. Lee & V. Padmanabhan & Seungjin Whang, 1997. "Information Distortion in a Supply Chain: The Bullwhip Effect," Management Science, INFORMS, vol. 43(4), pages 546-558, April.
    6. S. Viswanathan & Kamlesh Mathur, 1997. "Integrating Routing and Inventory Decisions in One-Warehouse Multiretailer Multiproduct Distribution Systems," Management Science, INFORMS, vol. 43(3), pages 294-312, March.
    7. S. Anily & A. Federgruen, 1993. "Two-Echelon Distribution Systems with Vehicle Routing Costs and Central Inventories," Operations Research, INFORMS, vol. 41(1), pages 37-47, February.
    8. Diabat, Ali, 2014. "Hybrid algorithm for a vendor managed inventory system in a two-echelon supply chain," European Journal of Operational Research, Elsevier, vol. 238(1), pages 114-121.
    9. Thomas, Douglas J. & Griffin, Paul M., 1996. "Coordinated supply chain management," European Journal of Operational Research, Elsevier, vol. 94(1), pages 1-15, October.
    10. 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.
    11. Ali Diabat & Jean-Philippe Richard & Craig Codrington, 2013. "A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design," Annals of Operations Research, Springer, vol. 203(1), pages 55-80, March.
    12. 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.
    13. S. Anily & A. Federgruen, 1990. "One Warehouse Multiple Retailer Systems with Vehicle Routing Costs," Management Science, INFORMS, vol. 36(1), pages 92-114, January.
    14. 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)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lihong Pan & Miyuan Shan & Linfeng Li, 2023. "Optimizing Perishable Product Supply Chain Network Using Hybrid Metaheuristic Algorithms," Sustainability, MDPI, vol. 15(13), pages 1-21, July.
    2. Alvarez, Aldair & Cordeau, Jean-François & Jans, Raf & Munari, Pedro & Morabito, Reinaldo, 2020. "Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products," European Journal of Operational Research, Elsevier, vol. 283(2), pages 511-529.
    3. Shiva Zandkarimkhani & Hassan Mina & Mehdi Biuki & Kannan Govindan, 2020. "A chance constrained fuzzy goal programming approach for perishable pharmaceutical supply chain network design," Annals of Operations Research, Springer, vol. 295(1), pages 425-452, December.
    4. Saijun Shao & Kin Keung Lai & Biyun Ge, 2023. "A multi-period inventory routing problem with procurement decisions: a case in China," Annals of Operations Research, Springer, vol. 324(1), pages 1527-1555, May.
    5. Emre Çankaya & Ali Ekici & Okan Örsan Özener, 2019. "Humanitarian relief supplies distribution: an application of inventory routing problem," Annals of Operations Research, Springer, vol. 283(1), pages 119-141, December.
    6. Neves-Moreira, Fábio & Almada-Lobo, Bernardo & Guimarães, Luís & Amorim, Pedro, 2022. "The multi-product inventory-routing problem with pickups and deliveries: Mitigating fluctuating demand via rolling horizon heuristics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    7. Han, Dongya & Yang, Yongjian & Wang, Dujuan & Cheng, T.C.E. & Yin, Yunqiang, 2019. "Integrated production, inventory, and outbound distribution operations with fixed departure times in a three-stage supply chain," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 334-347.
    8. Melkonyan, Ani & Gruchmann, Tim & Lohmar, Fabian & Kamath, Vasanth & Spinler, Stefan, 2020. "Sustainability assessment of last-mile logistics and distribution strategies: The case of local food networks," International Journal of Production Economics, Elsevier, vol. 228(C).
    9. Kannan Govindan, 2016. "Evolutionary algorithms for supply chain management," Annals of Operations Research, Springer, vol. 242(2), pages 195-206, July.
    10. Shuang, Yan & Diabat, Ali & Liao, Yi, 2019. "A stochastic reverse logistics production routing model with emissions control policy selection," International Journal of Production Economics, Elsevier, vol. 213(C), pages 201-216.
    11. Nasr Al-Hinai & Chefi Triki, 2020. "A two-level evolutionary algorithm for solving the petrol station replenishment problem with periodicity constraints and service choice," Annals of Operations Research, Springer, vol. 286(1), pages 325-350, March.
    12. Yiqiang Zhang & Hussam Alshraideh & Ali Diabat, 2018. "A stochastic reverse logistics production routing model with environmental considerations," Annals of Operations Research, Springer, vol. 271(2), pages 1023-1044, December.
    13. Chen, Jianxin & Hou, Rui & Zhang, Tonghua & Zhou, Yongwu, 2024. "Newsvendor model for a dyadic supply chain with push-pull strategy under shareholding and risk aversion," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 221(C), pages 645-662.

    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. 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.
    2. Zhao, Qiu-Hong & Chen, Shuang & Zang, Cun-Xun, 2008. "Model and algorithm for inventory/routing decision in a three-echelon logistics system," European Journal of Operational Research, Elsevier, vol. 191(3), pages 623-635, December.
    3. Zhao, Qiu-Hong & Wang, Shou-Yang & Lai, K.K., 2007. "A partition approach to the inventory/routing problem," European Journal of Operational Research, Elsevier, vol. 177(2), pages 786-802, March.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. Divsalar, Ali & Vansteenwegen, Pieter, 2016. "A two-phase algorithm for the cyclic inventory routing problemAuthor-Name: Chitsaz, Masoud," European Journal of Operational Research, Elsevier, vol. 254(2), pages 410-426.
    10. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    11. 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.
    12. 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.
    13. 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.
    14. Qu, Wendy W. & Bookbinder, James H. & Iyogun, Paul, 1999. "An integrated inventory-transportation system with modified periodic policy for multiple products," European Journal of Operational Research, Elsevier, vol. 115(2), pages 254-269, June.
    15. Song, Ruidian & Zhao, Lei & Van Woensel, Tom & Fransoo, Jan C., 2019. "Coordinated delivery in urban retail," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 122-148.
    16. Raa, Birger & Aghezzaf, El-Houssaine, 2009. "A practical solution approach for the cyclic inventory routing problem," European Journal of Operational Research, Elsevier, vol. 192(2), pages 429-441, January.
    17. Peter Francis & Karen Smilowitz & Michal Tzur, 2007. "Flexibility and complexity in periodic distribution problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(2), pages 136-150, March.
    18. 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.
    19. Luca Bertazzi, 2008. "Analysis of Direct Shipping Policies in an Inventory-Routing Problem with Discrete Shipping Times," Management Science, INFORMS, vol. 54(4), pages 748-762, April.
    20. Fokkema, Jan Eise & Land, Martin J. & Coelho, Leandro C. & Wortmann, Hans & Huitema, George B., 2020. "A continuous-time supply-driven inventory-constrained routing problem," Omega, Elsevier, vol. 92(C).

    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:spr:annopr:v:242:y:2016:i:2:d:10.1007_s10479-014-1640-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.