IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v63y2025i7p2526-2555.html
   My bibliography  Save this article

A distribution-free-based approach for stochastic food closed-loop supply chain

Author

Listed:
  • Ding Chen
  • Feng Chu
  • Ming Liu
  • Yufei Huang

Abstract

Resource scarcity has driven growing interest in circular economy (CE). Closed-loop supply chain (CLSC) with returnable transport items (RTIs) in the food industry is an important component of CE. However, existing works on food CLSC with RTIs have not simultaneously considered the perishability, facility location, and uncertain demand under limited information. Therefore, this work addresses a new food CLSC optimisation problem. We first propose a non-linear chance-constrained programming model. It is then transformed into a mixed-integer linear programming model via using the distribution-free (DF) method and sample average approximation (SAA) method, respectively. An illustrative example reveals that the DF method needs only 10.50% of the computation time of the SAA method. To address large-scale problems, an improved Lagrangian relaxation (LR) method is developed. To address the computational challenge in large-scale problems, an improved Lagrangian relaxation (LR) algorithm is developed. Results show that CPLEX achieves a gap of 75.57%, while the LR surpasses it by finding near-optimal solutions with a gap of 1.22%, using only 31.82% of the computation time required by CPLEX. For this work, the main insights are summarised: (1) extending product shelf life can reduce the total cost; and (2) to alleviate uncertain demand and production risks, production capacity and product inventory capacity can be appropriately expanded, but excessive investment may not improve returns.

Suggested Citation

  • Ding Chen & Feng Chu & Ming Liu & Yufei Huang, 2025. "A distribution-free-based approach for stochastic food closed-loop supply chain," International Journal of Production Research, Taylor & Francis Journals, vol. 63(7), pages 2526-2555, April.
  • Handle: RePEc:taf:tprsxx:v:63:y:2025:i:7:p:2526-2555
    DOI: 10.1080/00207543.2024.2406994
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2024.2406994
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2024.2406994?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.

    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:taf:tprsxx:v:63:y:2025:i:7:p:2526-2555. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.