Half-open multi-depot vehicle routing problem based on joint distribution mode of fresh food

被引:0
作者
Fan H. [1 ,2 ]
Yang X. [1 ]
Li D. [1 ,2 ]
Li Y. [3 ]
Liu P. [1 ,2 ]
Wu J. [1 ,2 ]
机构
[1] School of Transportation Engineering, Dalian Maritime University, Dalian
[2] Institute of Strategy Management and System Planning, Dalian Maritime University, Dalian
[3] School of Mining Engineering, Liaoning Shihua University, Fushun
来源
Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS | 2019年 / 25卷 / 01期
基金
中国国家自然科学基金;
关键词
Ant colony algorithm; Fresh food; Half-open vehicle routing problem; Joint distribution; Logistics; Multi-depot;
D O I
10.13196/j.cims.2019.01.026
中图分类号
学科分类号
摘要
Aiming at the fresh food logistics problem, a joint distribution mode with the characteristic of half-open among multi-distribution centers was presented. By considering the timeliness requirements of fresh foods transport, time window and penalty costs were presented, and the optimization model minimizing the total cost of transportation cost, dispatch cost, time penalty costs and wastage cost was constructed. An ant colony algorithm was designed to solve the optimization model. The validity and practicability of the proposed model and algorithm were verified with numerical examples and analyses. Furthermore, the comparative analysis illustrated that the joint distribution mode with the characteristic of half-open and multi-distribution centers was better than independent distribution mode with single distribution. The joint distribution mode could make a quick response to customers' fresh food requirements, and the distribution efficiency was improved due to the quick response. Since the average distance needed to satisfy the customers' demands was decreased, the wastage of fresh foods was also reduced. Therefore, the joint distribution mode with multi-distribution centers was rather propitious to the development of fresh food logistics, especially on cost reduction. © 2019, Editorial Department of CIMS. All right reserved.
引用
收藏
页码:256 / 266
页数:10
相关论文
共 23 条
[1]  
Zhang Q., Research on optimizing scheme for city logistics based on joint distribution, China Soft Science, pp. 290-295, (2009)
[2]  
Tong J., Wang Y., Fan X., Et al., Monitoring system of cold chain logistics for farm fresh produce, Journal of Jilin University: Engineering and Technology Edition, 43, 6, pp. 1707-1711, (2013)
[3]  
Mu D., Wang C., Wang S., Et al., Solving TDVRP based on parallel-simulated annealing algorithm, Computer Integrated Manufacturing Systems, 21, 6, pp. 1626-1636, (2015)
[4]  
Yang X., Fan H., Zhang X., Et al., Optimization of multi-deport open vehicle routing problem with fuzzy time window, Computer Integrated Manufacturing Systems, 22, 7, pp. 1768-1778, (2016)
[5]  
Yan R., Zhu X., Zhang Q., Et al., Research of the model and algorithm for two-dimensional multi-depots capacitated vehicle routing problem with time window constrain, Chinese Journal of Management Science, 25, 7, pp. 67-77, (2017)
[6]  
Cordeau J.F., Laporte G., Mercier A., A unified tabu search heuristic for vehicle routing problems with time windows, Journal of the Operational Research Society, 52, 8, pp. 928-936, (2001)
[7]  
Polacek M., Hartl R.F., Doerner K., A variable neighborhood search for the multi-depot vehicle routing problem with time windows, Journal of Heuristics, 10, 6, pp. 613-627, (2004)
[8]  
Ting C.J., Chen C.H., Combination of multiple ant colony system and simulated annealing for the multi-depot vehicle-routing problem with time windows, Transportation Research Record: Journal of the Transportation Research Board, 2089, 1, pp. 85-92, (2008)
[9]  
Ostertag A., Doerner K.F., Hartl R.F., Et al., POPMUSIC for a real-world large-scale vehicle routing problem with time windows, Journal of the Operational Research Society, 60, 7, pp. 934-943, (2009)
[10]  
Liu C., An improved adaptive genetic algorithm for the multi-depot vehicle routing problem with time window, Journal of Networks, 8, 5, pp. 1035-1042, (2013)