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

Optimizing Multi-Echelon Delivery Routes for Perishable Goods with Time Constraints

Author

Listed:
  • Manqiong Sun

    (School of Economics and Management, Xi’an Technological University, Xi’an 710021, China)

  • Yang Xu

    (School of Economics and Management, Xi’an Technological University, Xi’an 710021, China)

  • Feng Xiao

    (International Business School, Shaanxi Normal University, Xi’an 710119, China)

  • Hao Ji

    (School of Economics and Management, Xi’an Technological University, Xi’an 710021, China)

  • Bing Su

    (School of Economics and Management, Xi’an Technological University, Xi’an 710021, China)

  • Fei Bu

    (School of Economics and Management, Xi’an Technological University, Xi’an 710021, China)

Abstract

As the logistics industry modernizes, living standards improve, and consumption patterns shift, the demand for fresh food continues to grow, making cold chain logistics for perishable goods a critical component in ensuring food quality and safety. However, the presence of both soft and hard time windows among demand nodes can complicate the single-network distribution of perishable goods. In response to these challenges, this paper proposes an optimization model for multi-distribution center perishable goods delivery, considering both one-echelon and two-echelon network joint distributions. The model aims to minimize total costs, including transportation, fixed, refrigeration, goods damage, and penalty costs, while measuring customer satisfaction by the start time of service at each demand node. A two-stage heuristic algorithm is designed to solve the model. In the first stage, an initial solution is constructed using a greedy approach based on the principles of the k-medoids clustering algorithm, which considers both spatial and temporal distances. In the second stage, the initial routing solution is optimized using a linear programming approach from the Ortools solver combined with an Improved Adaptive Large Neighborhood Search (IALNS) algorithm. The effectiveness of the proposed model and algorithm is validated through a case study analysis. The results demonstrate that the initial solutions obtained through the k-medoids clustering algorithm based on spatio-temporal distance improved the overall cost optimization by 1.85% and 4.74% compared to the other two algorithms. Among the three two-stage heuristic algorithms, the Ortools-IALNS proposed here showed enhancements in the overall cost optimization over the IALNS, with improvements of 3.24%, 1.12%, and 0.41%, respectively. The two-stage heuristic algorithm designed in this study also converged faster than the other two heuristic algorithms, with overall optimization improvements of 1.55% and 1.28%, further validating the superior performance of the proposed heuristic algorithm.

Suggested Citation

  • Manqiong Sun & Yang Xu & Feng Xiao & Hao Ji & Bing Su & Fei Bu, 2024. "Optimizing Multi-Echelon Delivery Routes for Perishable Goods with Time Constraints," Mathematics, MDPI, vol. 12(23), pages 1-24, December.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:23:p:3845-:d:1537743
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/23/3845/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/23/3845/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    2. Gaoyuan Qin & Fengming Tao & Lixia Li, 2019. "A Vehicle Routing Optimization Problem for Cold Chain Logistics Considering Customer Satisfaction and Carbon Emissions," IJERPH, MDPI, vol. 16(4), pages 1-17, February.
    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. Qi Yao & Shenjun Zhu & Yanhui Li, 2022. "Green Vehicle-Routing Problem of Fresh Agricultural Products Considering Carbon Emission," IJERPH, MDPI, vol. 19(14), pages 1-17, July.
    2. Hailin Wu & Fengming Tao & Bo Yang, 2020. "Optimization of Vehicle Routing for Waste Collection and Transportation," IJERPH, MDPI, vol. 17(14), pages 1-26, July.
    3. Benyamin Moghaddasi & Amir Salar Ghafari Majid & Zahra Mohammadnazari & Amir Aghsami & Masoud Rabbani, 2023. "A green routing-location problem in a cold chain logistics network design within the Balanced Score Card pillars in fuzzy environment," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-33, July.
    4. Jumbo, Olga & Moghaddass, Ramin, 2022. "Resource optimization and image processing for vegetation management programs in power distribution networks," Applied Energy, Elsevier, vol. 319(C).
    5. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
    6. Babagolzadeh, Mahla & Zhang, Yahua & Abbasi, Babak & Shrestha, Anup & Zhang, Anming, 2022. "Promoting Australian regional airports with subsidy schemes: Optimised downstream logistics using vehicle routing problem," Transport Policy, Elsevier, vol. 128(C), pages 38-51.
    7. Ido Orenstein & Tal Raviv & Elad Sadan, 2019. "Flexible parcel delivery to automated parcel lockers: models, solution methods and analysis," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 683-711, December.
    8. Tianlu Zhao & Yongjian Yang & En Wang, 2020. "Minimizing the average arriving distance in carpooling," International Journal of Distributed Sensor Networks, , vol. 16(1), pages 15501477198, January.
    9. Dessouky, Maged M & Shao, Yihuan E, 2017. "Routing Strategies for Efficient Deployment of Alternative Fuel Vehicles for Freight Delivery," Institute of Transportation Studies, Working Paper Series qt0nj024qn, Institute of Transportation Studies, UC Davis.
    10. A. Mor & M. G. Speranza, 2020. "Vehicle routing problems over time: a survey," 4OR, Springer, vol. 18(2), pages 129-149, June.
    11. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    12. Coelho, V.N. & Grasas, A. & Ramalhinho, H. & Coelho, I.M. & Souza, M.J.F. & Cruz, R.C., 2016. "An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints," European Journal of Operational Research, Elsevier, vol. 250(2), pages 367-376.
    13. Pradhananga, Rojee & Taniguchi, Eiichi & Yamada, Tadashi & Qureshi, Ali Gul, 2014. "Bi-objective decision support system for routing and scheduling of hazardous materials," Socio-Economic Planning Sciences, Elsevier, vol. 48(2), pages 135-148.
    14. Y H Lee & J I Kim & K H Kang & K H Kim, 2008. "A heuristic for vehicle fleet mix problem using tabu search and set partitioning," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(6), pages 833-841, June.
    15. Qi, Mingyao & Lin, Wei-Hua & Li, Nan & Miao, Lixin, 2012. "A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 248-257.
    16. Srinivas, Sharan & Ramachandiran, Surya & Rajendran, Suchithra, 2022. "Autonomous robot-driven deliveries: A review of recent developments and future directions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).
    17. Tibor Holczinger & Olivér Ősz & Máté Hegyháti, 2020. "Scheduling approach for on-site jobs of service providers," Flexible Services and Manufacturing Journal, Springer, vol. 32(4), pages 913-948, December.
    18. Zhiping Zuo & Yanhui Li & Jing Fu & Jianlin Wu, 2019. "Human Resource Scheduling Model and Algorithm with Time Windows and Multi-Skill Constraints," Mathematics, MDPI, vol. 7(7), pages 1-18, July.
    19. Jinil Han & Chungmok Lee & Sungsoo Park, 2014. "A Robust Scenario Approach for the Vehicle Routing Problem with Uncertain Travel Times," Transportation Science, INFORMS, vol. 48(3), pages 373-390, August.
    20. Narjes MASHHADI BANDANI & Alireza NADERI & Mohsen AKBARPOUR SHIRZAEI, 2017. "Cement Transportation Limited-Fleet Modeling And Assigning To Rated Demands," Transport Problems, Silesian University of Technology, Faculty of Transport, vol. 12(1), pages 111-123, March.

    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:23:p:3845-:d:1537743. 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.