• 智能制造 •

### 带时间窗的多中心半开放式车辆路径问题

1. 武汉理工大学物流工程学院, 武汉, 430063
• 收稿日期:2019-09-20 出版日期:2020-07-25 发布日期:2020-08-26
• 通讯作者: 袁源乙(通信作者),女,1994年生,硕士研究生。研究方向为物流系统分析与优化。E-mail:460915419@qq.com。
• 作者简介:辜勇,男,1975年生,副教授、博士。研究方向为系统分析与优化、智能物流规划与仿真。E-mail:guyong@whut.edu.cn。
• 基金资助:
国家重点研发计划资助项目（2018YFC1407405）

### Multi-depot Half Open Vehicle Routing Problem with Time Windows

GU Yong, YUAN Yuanyi, ZHANG Lie, DUAN Jingjing

1. School of Logistics Engineering, Wuhan University of Technology, Wuhan, 430063
• Received:2019-09-20 Online:2020-07-25 Published:2020-08-26

Abstract: Aiming at the vehicle routing problem under multi-depot collaborative distribution, a minimization model of total costs was established. The model satisfied the characteristics of multi-depot, multi-demand points and half-open. Considering the complexity of the problem, a three-stage solution algorithm was designed. K-mediods clustering algorithm was used to decompose the original data. The original large-scale multi-depot VRP was transformed into multiple single distribution center routing problems. Then, an improved multi-ant colony algorithm was designed to solve the single distribution center routing problem, and the initial scheme was obtained. In the adjustment stages, the initial scheme was optimized by using the saving mileage method. At last, the simulation results were compared with ones of the other methods. The results show that the proposed algorithm is better than GA-ACO algorithm, wolf pack algorithm and ant colony algorithm. The optimal path is optimized by 32.16%, 8.99% and 24.76% respectively, and the total cost is optimized by 30.42%, 8.99% and 3.40% separately, which verifies the rationality of the model and the effectiveness of the multi-stage algorithm design.