基于离散哈里斯鹰算法求解车辆路径问题
Solving vehicle routing problems based on discrete Harris hawk optimization algorithm
郭玉洁 1徐洪智1
作者信息
- 1. 吉首大学计算机科学与工程学院,湖南张家界 427000
- 折叠
摘要
针对带容量约束车辆路径问题,提出一种离散哈里斯鹰算法.在哈里斯鹰算法的基础上,根据车辆路径的编解码特点,重新定义算法在全局搜索和局部开发阶段的更新策略;在全局搜索阶段利用随机插入和反转策略更新哈里斯鹰个体的位置,提高算法的全局开发能力;在局部开发阶段利用转移算子和移除算子设计哈里斯鹰个体的更新机制,提高算法的局部精细化搜索能力;通过改进逃逸能量平衡全局搜索和局部开发能力.实验结果表明,重定义的更新策略均能有效提升算法效率,将该算法和其它启发式算法的结果相比较,所提算法在求解精度和稳定性方面更具优势.
Abstract
A discrete Harris hawk optimization algorithm was proposed for the capacitated vehicle routing problem.Based on the Harris hawk optimization algorithm,according to the coding and decoding characteristics of the vehicle routing problem,the up-date strategy in the global search and local development phases was redefined,according to the random inversion and insertion operations,the global search capability of the algorithm in the search phase was enhanced.The update mechanism based on the transfer operator and the removal operator in the local development phase was designed to improve the local refinement search capability of the algorithm.The escape energy was improved to balance the global search and local exploitation ability.Experi-mental results show that the redefined update strategies can all effectively improve the efficiency of the algorithm,and the pro-posed algorithm has better solution accuracy and stability compared with other heuristic algorithms.
关键词
离散哈里斯鹰算法/容量约束车辆路径问题/随机反转/插入操作/转移算子/移除算子/改进逃逸能量Key words
discrete Harris hawk optimization/capacitated vehicle routing problem/random inversion/insertion operation/transfer operator/removal operator/improved escape energy引用本文复制引用
出版年
2024
NETL
NSTL
万方数据