IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i22p3559-d1521136.html
   My bibliography  Save this article

Multiobjective Route Optimization for Multimodal Cold Chain Networks Considering Carbon Emissions and Food Waste

Author

Listed:
  • Yong Peng

    (School of Traffic and Transportation, Chongqing Jiaotong University, Chongqing 400074, China)

  • Yali Zhang

    (School of Traffic and Transportation, Chongqing Jiaotong University, Chongqing 400074, China)

  • Dennis Z. Yu

    (The David D. Reh School of Business, Clarkson University, Potsdam, NY 13699, USA)

  • Yijuan Luo

    (Port and Shipping Maritime Affairs Center, Qijiang District, Chongqing 401420, China)

Abstract

The cold chain logistics industry faces significant challenges in terms of transportation costs and carbon emissions. It is imperative to plan multimodal transportation routes efficiently to address these issues, minimize food waste, and reduce carbon emissions. This paper focuses on four key optimization objectives for multimodal cold chain transport: minimizing total transportation time, costs, carbon emissions, and food waste. To tackle these objectives, we propose a high-dimensional multiobjective route optimization model for multimodal cold chain networks. Our approach involves the development of a multiobjective evolutionary algorithm, utilizing Monte Carlo simulation and a one-by-one selection strategy. We evaluate the proposed algorithm’s performance by analyzing various convergence and distribution indicators. The average values for the minimum total transportation time, transportation cost, carbon emission cost, and cargo loss rate derived from the proposed algorithm ultimately converge to 6721.7, 5184.4, 301.5, and 0.21, respectively, demonstrating the effectiveness of the algorithmic solution. Additionally, we benchmark our algorithm against the existing literature to showcase its efficiency in solving high-dimensional multi-objective route optimization problems. Furthermore, we investigate the impact of different parameters, such as carbon tax rates, temperature, and cargo activation energy, on carbon emissions, and food waste. Moreover, we conduct a real-world case study to apply our approach to solving a practical business problem related to multimodal cold chain transportation. The insights gained from this research offer valuable decision-making support for multimodal carriers in developing low-carbon and environmentally friendly transportation strategies to efficiently transport perishable goods.

Suggested Citation

  • Yong Peng & Yali Zhang & Dennis Z. Yu & Yijuan Luo, 2024. "Multiobjective Route Optimization for Multimodal Cold Chain Networks Considering Carbon Emissions and Food Waste," Mathematics, MDPI, vol. 12(22), pages 1-27, November.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:22:p:3559-:d:1521136
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/22/3559/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/22/3559/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Shouchen Liu, 2023. "Multimodal Transportation Route Optimization of Cold Chain Container in Time-Varying Network Considering Carbon Emissions," Sustainability, MDPI, vol. 15(5), pages 1-20, March.
    2. Franceschetti, Anna & Demir, Emrah & Honhon, Dorothée & Van Woensel, Tom & Laporte, Gilbert & Stobbe, Mark, 2017. "A metaheuristic for the time-dependent pollution-routing problem," European Journal of Operational Research, Elsevier, vol. 259(3), pages 972-991.
    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. Ehmke, Jan Fabian & Campbell, Ann M. & Thomas, Barrett W., 2018. "Optimizing for total costs in vehicle routing in urban areas," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 242-265.
    2. Asghari, Mohammad & Mirzapour Al-e-hashem, S. Mohammad J., 2021. "Green vehicle routing problem: A state-of-the-art review," International Journal of Production Economics, Elsevier, vol. 231(C).
    3. Garside, Annisa Kesy & Ahmad, Robiah & Muhtazaruddin, Mohd Nabil Bin, 2024. "A recent review of solution approaches for green vehicle routing problem and its variants," Operations Research Perspectives, Elsevier, vol. 12(C).
    4. Ghiami, Yousef & Demir, Emrah & Van Woensel, Tom & Christiansen, Marielle & Laporte, Gilbert, 2019. "A deteriorating inventory routing problem for an inland liquefied natural gas distribution network," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 45-67.
    5. Antonella Meneghetti & Chiara Pagnin & Patrizia Simeoni, 2021. "Decarbonizing the Cold Chain: Long-Haul Refrigerated Deliveries with On-Board Photovoltaic Energy Integration," Sustainability, MDPI, vol. 13(15), pages 1-19, July.
    6. Ulsrud, Karl Petter & Vandvik, Anders Helgeland & Ormevik, Andreas Breivik & Fagerholt, Kjetil & Meisel, Frank, 2022. "A time-dependent vessel routing problem with speed optimization," European Journal of Operational Research, Elsevier, vol. 303(2), pages 891-907.
    7. Liu, Yiming & Roberto, Baldacci & Zhou, Jianwen & Yu, Yang & Zhang, Yu & Sun, Wei, 2023. "Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 310(1), pages 133-155.
    8. Behnke, Martin & Kirschstein, Thomas & Bierwirth, Christian, 2021. "A column generation approach for an emission-oriented vehicle routing problem on a multigraph," European Journal of Operational Research, Elsevier, vol. 288(3), pages 794-809.
    9. Eskandarpour, Majid & Ouelhadj, Djamila & Hatami, Sara & Juan, Angel A. & Khosravi, Banafsheh, 2019. "Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges," European Journal of Operational Research, Elsevier, vol. 277(2), pages 479-491.
    10. Shih-Che Lo & Yi-Cheng Shih, 2021. "A Genetic Algorithm with Quantum Random Number Generator for Solving the Pollution-Routing Problem in Sustainable Logistics Management," Sustainability, MDPI, vol. 13(15), pages 1-18, July.
    11. Ivana Semanjski & Sidharta Gautama, 2019. "A Collaborative Stakeholder Decision-Making Approach for Sustainable Urban Logistics," Sustainability, MDPI, vol. 11(1), pages 1-11, January.
    12. Nasreddine Ouertani & Hajer Ben-Romdhane & Saoussen Krichen & Issam Nouaouri, 2022. "A vector evaluated evolutionary algorithm with exploitation reinforcement for the dynamic pollution routing problem," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1011-1038, September.
    13. Çağrı Koç, 2019. "Analysis of vehicle emissions in location-routing problem," Flexible Services and Manufacturing Journal, Springer, vol. 31(1), pages 1-33, March.
    14. José-Fernando Camacho-Vallejo & Lilian López-Vera & Alice E. Smith & José-Luis González-Velarde, 2022. "A tabu search algorithm to solve a green logistics bi-objective bi-level problem," Annals of Operations Research, Springer, vol. 316(2), pages 927-953, September.
    15. Watling, David P. & Connors, Richard D. & Chen, Haibo, 2023. "Fuel-optimal truck path and speed profile in dynamic conditions: An exact algorithm," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1456-1472.
    16. Tikani, Hamid & Setak, Mostafa & Demir, Emrah, 2021. "A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty," European Journal of Operational Research, Elsevier, vol. 293(2), pages 703-730.
    17. Emna Marrekchi & Walid Besbes & Diala Dhouib & Emrah Demir, 2021. "A review of recent advances in the operations research literature on the green routing problem and its variants," Annals of Operations Research, Springer, vol. 304(1), pages 529-574, September.
    18. Tom Woensel, 2019. "Comments on: Perspectives on integer programming for time-dependent models," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(2), pages 180-183, July.
    19. Meneghetti, Antonella & Dal Magro, Fabio & Romagnoli, Alessandro, 2021. "Renewable energy penetration in food delivery: Coupling photovoltaics with transport refrigerated units," Energy, Elsevier, vol. 232(C).
    20. Chen, Cheng & Demir, Emrah & Huang, Yuan, 2021. "An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1164-1180.

    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:gam:jmathe:v:12:y:2024:i:22:p:3559-:d:1521136. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.