系统仿真学报 ›› 2021, Vol. 33 ›› Issue (9): 2095-2108.doi: 10.16182/j.issn1004731x.joss.20-0349

• 仿真建模理论与方法 • 上一篇    下一篇

学习型蚁群算法求解绿色多车场车辆路径问题

胡蓉1,2, 陈文博1,2, 钱斌1,2, 郭宁1, 向凤红1   

  1. 1.昆明理工大学 信息工程与自动化学院,云南 昆明 650500;
    2.昆明理工大学 云南省人工智能重点实验室,云南 昆明 650500
  • 收稿日期:2020-06-15 修回日期:2020-08-07 出版日期:2021-09-18 发布日期:2021-09-17
  • 作者简介:胡蓉(1974-),女,博士,副教授,研究方向为智能优化调度,物流优化。E-mail:ronghu@vip.163.com
  • 基金资助:
    国家自然科学基金(61963022,51665025)

Learning Ant Colony Algorithm for Green Multi-depot Vehicle Routing Problem

Hu Rong1,2, Chen Wenbo1,2, Qian Bin1,2, Guo Ning1, Xiang Fenghong1   

  1. 1. Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China;
    2. Yunnan Key Laboratory of Artificial Intelligence, Kunming University of Science and Technology, Kunming 650500, China
  • Received:2020-06-15 Revised:2020-08-07 Online:2021-09-18 Published:2021-09-17

摘要: 针对我国城市中心区域路况较拥堵的实际情况,设计基于车辆行驶路段的速度计算方法,同时考虑车辆行驶距离、载重和速度因素,建立以最小化总油耗费用为目标的绿色多车场车辆路径问题模型,提出一种融合蚁群优化算法(Ant Colony Optimization, ACO)与知识模型的学习型蚁群优化算法(Learning Ant Colony Optimization, LACO)进行求解。为提高算法全局搜索性能和鲁棒性,设计由不同ACO参数组合和各参数组合选取概率组成的参数知识,用于每代调整ACO参数;为增强算法局部搜索能力,设计由各邻域操作贡献率组成的局部操作知识,用于每代确定各邻域操作的执行次数。通过在不同规模问题上的仿真实验和算法对比,验证所提LACO的有效性。

关键词: 学习型蚁群算法, 绿色多车场, 车辆路径问题, 知识模型, 邻域搜索

Abstract: Considering the congested roads situation of urban central areas in China, a speed calculation method based on vehicle driving sections is designed, and a model for the Green Multi-Depot Vehicle Routing Problem with Total Fuel-Consumption cost Criterion (TFC-GMDVRP) is established, considering simultaneously the vehicle travel distance, load, and speed factors. A learning ant colony optimization algorithm (LACO), combining a knowledge model and an ant colony optimization algorithm (ACO), is proposed for solving the TFC-GMDVRP. In order to improve the performance and robustness of the algorithm's global search, the parameter knowledge that contains the different parameter combinations of ACO and the selection probability of each parameter combination is designed to adjust the ACO's parameters for each generation. In order to enhance the ability of algorithm's local search, the local operation knowledge that contains the contribution ratio of each neighborhood operation is designed to determine the execution times of each neighborhood operation for each generation. Simulation experiments on different instances and comparisons of algorithms show the effectiveness of the proposed algorithm.

Key words: learning ant colony optimization, green multi-depot, vehicle routing problem, knowledge model, neighborhood search

中图分类号: