4.3 Article

Design of Dynamic Programming Model for Multi-Objective Cold Chain Logistics Deployment Path Based on Meme Algorithm

出版社

SPRINGER INT PUBL AG
DOI: 10.1007/s40996-021-00639-2

关键词

Transportation supply system; Path overlap ratio; Segmentation operator; Penalty function method

向作者/读者索取更多资源

This paper proposes a multi-objective dynamic programming model based on the meme algorithm to address the issues in traditional cold chain logistics deployment path planning models, ultimately achieving dynamic programming of cold chain logistics deployment paths.
The traditional multi-objective cold chain logistics deployment path planning model does not build the logistics transportation supply system dynamics model, which leads to the problems of long planning time and high overlapping rate. Therefore, this paper designs a multi-objective dynamic programming model of cold chain logistics deployment path based on meme algorithm. This paper deals with the constraint conditions, constructs the penalty function method of cold chain logistics transportation, and realizes the multi-objective cold chain logistics distribution objective sequencing on the basis of constructing the dynamic model of logistics transportation supply system. According to the combination segmentation operator method, the optimal solution of logistics deployment path was obtained, and the multi-objective dynamic programming model of cold chain logistics deployment path was designed to realize the dynamic programming of logistics deployment path. The experimental results showed that this method can effectively reduce the path planning time, reduce the proportion of path overlap, and effectively improve the effect of logistics deployment path planning.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.3
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据