Model and algorithm of two-stage distribution location routing with hard time window for city cold-chain logistics

33Citations
Citations of this article
53Readers
Mendeley users who have this article in their library.

Abstract

Taking cold-chain logistics as the research background and combining with the overall optimisation of logistics distribution networks, we develop two-stage distribution location-routing model with the minimum total cost as the objective function and varying vehicle capacity in different delivery stages. A hybrid genetic algorithm is designed based on coupling and collaboration of the two-stage routing and transfer stations. The validity and feasibility of the model and algorithm are verified by conducting a randomly generated test. The optimal solutions for different objective functions of two-stage distribution location-routing are compared and analysed. Results turn out that for different distribution objectives, different distribution schemes should be employed. Finally, we compare the two-stage distribution location-routing to single-stage vehicle routing problems. It is found that a two-stage distribution location-routing system is feasible and effective for the cold-chain logistics network, and can decrease distribution cost for cold-chain logistics enterprises.

Cite

CITATION STYLE

APA

Yan, L., Grifoll, M., & Zheng, P. (2020). Model and algorithm of two-stage distribution location routing with hard time window for city cold-chain logistics. Applied Sciences (Switzerland), 10(7). https://doi.org/10.3390/app10072564

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free