Application on Cold Chain Logistics Routing Optimization Based on Improved Genetic Algorithm


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

As the rise of fresh e-supplier, cold chain logistic has become the hot topics in China. But due to its special timeliness, it is necessary to optimize its vehicle routing. Firstly, we construct a cold chain logistics vehicle routing optimization with soft time windows model. Secondly, as simple genetic algorithm has some shortcomings such as poor population diversity and slow convergence, we propose an improved genetic algorithm – seeker genetic algorithm. By combining the uncertainty reasoning behavior in the seeker optimization algorithm and the nearest neighbor strategy, we improve the mutation operator in the genetic algorithm. Finally, we solve the cold chain logistics vehicle routing optimization model with basic genetic algorithm and seeker genetic algorithm respectively. The results indicate that seeker genetic algorithm could find the path with lower cost.

About the authors

Liyi Zhang

Information Engineering College, Subidhanagar

Email: sunyunshan@tjcu.edu.cn
Nepal, TinkuneKathamandu, Post Box: 12277

Yang Gao

Economic College, Tianjin University of Commerce

Email: sunyunshan@tjcu.edu.cn
China, Tianjin P.R. , 300134

Yunshan Sun

Information Engineering College, Subidhanagar

Author for correspondence.
Email: sunyunshan@tjcu.edu.cn
Nepal, TinkuneKathamandu, Post Box: 12277

Teng Fei

Information Engineering College, Subidhanagar

Email: sunyunshan@tjcu.edu.cn
Nepal, TinkuneKathamandu, Post Box: 12277

Yujing Wang

Economic College, Tianjin University of Commerce

Email: sunyunshan@tjcu.edu.cn
China, Tianjin P.R. , 300134


Copyright (c) 2019 Allerton Press, Inc.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies