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

A MINP model and hybrid heuristic algorithm for railway cold chain service network design problem: a case study of China

Author

Listed:
  • Dandan Li
  • Mi Gan
  • Yu Qiao
  • Qichen Ou
  • Xiaobo Liu

Abstract

Railway Cold Chain Service Network Design (RCC-SND) aims to optimise resource allocation and utilisation to ensure the efficient transportation of perishable foods. In this study, we propose a Mixed Integer Nonlinear Programming (MINP) model to solve the hub selection, service frequency determination, wagon flow organisation and routing problems in RCC-SND. The application of the model is illustrated using the real network comprising 163 cities in China. The PSO-GA algorithm is proven effective in solving the problem. Furthermore, we introduce two future scenarios to assess the carbon reduction potential and economic costs of railway cold chain operations. There are some main findings: as the hub number increases from 30 to 40, the total cost decreases, as the hub continues to rise, this reduction is offset by the increased hub operational costs. Increasing hubs can enhance direct train frequency while causing railway capacity redundancy, this redundancy can be addressed by freight volume increase, as demonstrated in this study, 4.5 times increase in freight volume can boost train utilisation by up to 12.5%. By 2030, railway cold chain carbon emissions are projected to exceed 1.1 million tons, the adoption of hydrogen as alternative energy is an economically viable solution for emission reduction.

Suggested Citation

  • Dandan Li & Mi Gan & Yu Qiao & Qichen Ou & Xiaobo Liu, 2025. "A MINP model and hybrid heuristic algorithm for railway cold chain service network design problem: a case study of China," International Journal of Production Research, Taylor & Francis Journals, vol. 63(1), pages 171-192, January.
  • Handle: RePEc:taf:tprsxx:v:63:y:2025:i:1:p:171-192
    DOI: 10.1080/00207543.2024.2358398
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2024.2358398?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:1:p:171-192. 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.