IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2013y2013i1n891409.html

Distribution Network Design for Fixed Lifetime Perishable Products: A Model and Solution Approach

Author

Listed:
  • Z. Firoozi
  • N. Ismail
  • Sh. Ariafar
  • S. H. Tang
  • M. K. A. M. Ariffin
  • A. Memariani

Abstract

Nowadays, many distribution networks deal with the distribution and storage of perishable products. However, distribution network design models are largely based on assumptions that do not consider time limitations for the storage of products within the network. This study develops a model for the design of a distribution network that considers the short lifetime of perishable products. The model simultaneously determines the network configuration and inventory control decisions of the network. Moreover, as the lifetime is strictly dependent on the storage conditions, the model develops a trade‐off between enhancing storage conditions (higher inventory cost) to obtain a longer lifetime and selecting those storage conditions that lead to shorter lifetimes (less inventory cost). To solve the model, an efficient Lagrangian relaxation heuristic algorithm is developed. The model and algorithm are validated by sensitivity analysis on some key parameters. Results show that the algorithm finds optimal or near optimal solutions even for large‐size cases.

Suggested Citation

  • Z. Firoozi & N. Ismail & Sh. Ariafar & S. H. Tang & M. K. A. M. Ariffin & A. Memariani, 2013. "Distribution Network Design for Fixed Lifetime Perishable Products: A Model and Solution Approach," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).
    • Handle: RePEc:wly:jnljam:v:2013:y:2013:i:1:n:891409
    DOI: 10.1155/2013/891409
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2013/891409
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/891409?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
    ---><---

    References listed on IDEAS

    as
    1. Michael Held & Richard M. Karp, 1970. "The Traveling-Salesman Problem and Minimum Spanning Trees," Operations Research, INFORMS, vol. 18(6), pages 1138-1162, December.
    2. Mark Ferguson & Michael E. Ketzenberg, 2006. "Information Sharing to Improve Retail Product Freshness of Perishables," Production and Operations Management, Production and Operations Management Society, vol. 15(1), pages 57-73, March.
    3. Jia Shu & Chung-Piaw Teo & Zuo-Jun Max Shen, 2005. "Stochastic Transportation-Inventory Network Design Problem," Operations Research, INFORMS, vol. 53(1), pages 48-60, February.
    4. Lian Qi & Zuo‐Jun Max Shen, 2007. "A supply chain design model with unreliable supply," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(8), pages 829-844, December.
    5. Pablo Miranda & Rodrigo Garrido, 2006. "A Simultaneous Inventory Control and Facility Location Model with Stochastic Capacity Constraints," Networks and Spatial Economics, Springer, vol. 6(1), pages 39-53, March.
    6. Marshall L. Fisher, 1985. "An Applications Oriented Guide to Lagrangian Relaxation," Interfaces, INFORMS, vol. 15(2), pages 10-21, April.
    7. Alper Atamtürk & Gemma Berenguer & Zuo-Jun (Max) Shen, 2012. "A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems," Operations Research, INFORMS, vol. 60(2), pages 366-381, April.
    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. Ana Esteso & M. M. E. Alemany & Angel Ortiz & Rina Iannacone, 2025. "Integrating freshness and profitability in horticultural supply chain design," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 33(4), pages 1283-1326, December.
    2. Cantini, Alessandra & Leoni, Leonardo & Ferraro, Saverio & Carlo, Filippo De, 2025. "Centralized and decentralized supply chains: Performance maps for comparing the cost-effectiveness of distribution network configurations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 204(C).

    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. Ahmadi-Javid, Amir & Hoseinpour, Pooya, 2015. "A location-inventory-pricing model in a supply chain distribution network with price-sensitive demands and inventory-capacity constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 82(C), pages 238-255.
    2. Puntipa Punyim & Ampol Karoonsoontawong & Avinash Unnikrishnan & Chi Xie, 2018. "Tabu Search Heuristic for Joint Location-Inventory Problem with Stochastic Inventory Capacity and Practicality Constraints," Networks and Spatial Economics, Springer, vol. 18(1), pages 51-84, March.
    3. 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.
    4. Mehrdad Shahabi & Shirin Akbarinasaji & Avinash Unnikrishnan & Rachel James, 2013. "Integrated Inventory Control and Facility Location Decisions in a Multi-Echelon Supply Chain Network with Hubs," Networks and Spatial Economics, Springer, vol. 13(4), pages 497-514, December.
    5. Ali Diabat & Jean-Philippe Richard, 2015. "An integrated supply chain problem: a nested lagrangian relaxation approach," Annals of Operations Research, Springer, vol. 229(1), pages 303-323, June.
    6. Shahabi, Mehrdad & Tafreshian, Amirmahdi & Unnikrishnan, Avinash & Boyles, Stephen D., 2018. "Joint production–inventory–location problem with multi-variate normal demand," Transportation Research Part B: Methodological, Elsevier, vol. 110(C), pages 60-78.
    7. Shahabi, Mehrdad & Unnikrishnan, Avinash & Jafari-Shirazi, Ehsan & Boyles, Stephen D., 2014. "A three level location-inventory problem with correlated demand," Transportation Research Part B: Methodological, Elsevier, vol. 69(C), pages 1-18.
    8. Aaron Guerrero Campanur & Elias Olivares-Benitez & Pablo A. Miranda & Rodolfo Eleazar Perez-Loaiza & Jose Humberto Ablanedo-Rosas, 2018. "Design of a Logistics Nonlinear System for a Complex, Multiechelon, Supply Chain Network with Uncertain Demands," Complexity, Hindawi, vol. 2018, pages 1-16, November.
    9. Puttemans, Inez & Caris, An & Braekers, Kris, 2025. "The integration of location and inventory decisions in supply chain networks: A literature review and future prospects," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 195(C).
    10. Zhalechian, M. & Tavakkoli-Moghaddam, R. & Zahiri, B. & Mohammadi, M., 2016. "Sustainable design of a closed-loop location-routing-inventory supply chain network under mixed uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 89(C), pages 182-214.
    11. Zhang, Zhi-Hai & Unnikrishnan, Avinash, 2016. "A coordinated location-inventory problem in closed-loop supply chain," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 127-148.
    12. Igor Litvinchev & Socorro Rangel & Jania Saucedo, 2010. "A Lagrangian bound for many-to-many assignment problems," Journal of Combinatorial Optimization, Springer, vol. 19(3), pages 241-257, April.
    13. Shawn Choo & Diego Klabjan & David Simchi-Levi, 2010. "Multiship Crane Sequencing with Yard Congestion Constraints," Transportation Science, INFORMS, vol. 44(1), pages 98-115, February.
    14. Emilio Carrizosa & Alba V. Olivares-Nadal & Pepa Ramírez-Cobo, 2020. "Embedding the production policy in location-allocation decisions," 4OR, Springer, vol. 18(3), pages 357-380, September.
    15. Steeger, Gregory & Rebennack, Steffen, 2017. "Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: An application to the strategic bidding problem," European Journal of Operational Research, Elsevier, vol. 257(2), pages 669-686.
    16. Jiu, Song & Wang, Dan & Ma, Zujun, 2024. "Benders decomposition for robust distribution network design and operations in online retailing," European Journal of Operational Research, Elsevier, vol. 315(3), pages 1069-1082.
    17. Zhang, Qihuan & Wang, Ziteng & Huang, Min & Wang, Huihui & Wang, Xingwei & Fang, Shu-Cherng, 2025. "Collaborative supply chain network design under demand uncertainty: A robust optimization approach," International Journal of Production Economics, Elsevier, vol. 279(C).
    18. Alper Atamtürk & Gemma Berenguer & Zuo-Jun (Max) Shen, 2012. "A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems," Operations Research, INFORMS, vol. 60(2), pages 366-381, April.
    19. Marshall L. Fisher, 2004. "Comments on ÜThe Lagrangian Relaxation Method for Solving Integer Programming ProblemsÝ," Management Science, INFORMS, vol. 50(12_supple), pages 1872-1874, December.
    20. Shu, Jia & Li, Zhengyi & Shen, Houcai & Wu, Ting & Zhong, Weijun, 2012. "A logistics network design model with vendor managed inventory," International Journal of Production Economics, Elsevier, vol. 135(2), pages 754-761.

    More about this item

    Statistics

    Access and download statistics

    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:wly:jnljam:v:2013:y:2013:i:1:n:891409. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4185 .

    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.