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

View/Open
Document typeArticle
Defense date2020-04
Rights accessOpen Access
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 costs for cold-chain logistics enterprises.
CitationYan, L.; Grifoll, M.; Zheng, P. Model and algorithm of two-stage distribution location routing with hard time window for city cold-chain logistics. "Applied sciences", Abril 2020, vol. 10, núm. 7, p. 2564:1-2564:16.
ISSN1454-5101
Publisher versionhttps://www.mdpi.com/2076-3417/10/7/2564
Files | Description | Size | Format | View |
---|---|---|---|---|
Yan_AS20.pdf | 1,655Mb | View/Open |
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution 3.0 Spain