摘要
鉴于物流在运输过程中受天气、交通条件等因素影响而具有的行驶速度时变性,提出了时变网络下第四方物流(4PL)协同路径定制问题。基于第三方物流(3PL)承运商的运输时间依赖于出发时刻的假设,建立了考虑3PL停靠与转换成本的时变4PL协同路径定制问题的数学模型并设计了基于K短路算法的粒子群算法。通过对4PL是否在转运节点更换3PL承运商以及对出发时刻的分析,说明了4PL在协同路径定制过程中的作用。
Considering the logistics transportation time is time-varying which affected by nature like the weather and the traffic conditions,the 4PL collaborative routing customization problem with time varying networks is proposed.Under the assumption that the transportation time of the 3PL suppliers is dependent on the departure time,a mathematical model which considered the 3PLs’dock and transit cost is established and a hybrid particle swarm optimization based on K-shortest path algorithm(K-PSO)is designed.Based on the analysis of whether the 4PL replaces the 3PL suppliers and how to choose the best departure time on the transit nodes,the experimental results fully illustrates that the role of the 4PL in the collaborative routing customization process is very important.
作者
崔妍
黄敏
李波
CUI Yan;HUANG Min;LI Bo(College of Information,Shenyang Institute of Engineering,Shenyang 110136,China;College of Information Science and Engineering,Northeastern University,Shenyang 110819,China;State Key Laboratory of Synthetical Automation for Process Industries,Northeastern University,Shenyang 110819,China)
出处
《控制工程》
CSCD
北大核心
2021年第1期164-169,共6页
Control Engineering of China
基金
国家杰出青年科学基金资助项目(71325002)
国家自然科学基金重点国际合作研究项目(71620107003)
国家自然科学基金创新研究群体项目(61621004)
流程工业综合自动化国家重点实验室基础科研业务费资助项目(2013ZCX11)
辽宁省自然科学基金面上项目(2019-MS-238)
辽宁省教育厅科学研究经费项目(JL-2004)。
关键词
时变网络
第四方物流
协同定制
K短路算法
粒子群算法
Time varying networks
fourth party logistics
collaborative customization
K-shortest path algorithm
particle swarm optimization