基于离散哈里斯鹰优化算法求解带时间窗车辆路径问题  

Solving Vehicle Routing Problem with Time Windows Based on Discrete Harris Hawk Optimization Algorithm

作　　者：郭玉洁 吕惠颖 GUO Yujie;LYU Huiying(School of Computer Science and Engineering,Jishou University,Zhangjiajie Hunan 427000,China;Foreign Language Teaching Department,Kaifeng Culture and Art Vocational College,Kaifeng Henan 475000,China)

机构地区：[1]吉首大学计算机科学与工程学院,湖南张家界427000 [2]开封文化艺术职业学院外语教学部,河南开封475000

出　　处：《信息与电脑》2023年第16期60-63,共4页Information & Computer

摘　　要：为求解带时间窗车辆路径问题(Vehicle Routing Problems with Time Windows,VRPTW),提出一种离散哈里斯鹰优化算法。该算法采用随机反转和交换操作对全局开发阶段进行重定义,扩大算法的全局搜索空间;引入贪心策略和移除算子对局部搜索阶段进行重定义,加强各个哈里斯鹰间信息的交互,提高算法的局部探索能力。对比实验结果表明,离散哈里斯鹰优化算法在求解VRPTW上有较强的寻优能力,求解质量优于其他启发式算法。In this paper,a discrete Harris Eagle algorithm is proposed to solve the vehicle routing problem with time window.The algorithm uses random inversion and exchange operations to redefine the global development phase and expand the global search space of the algorithm.Greedy strategy and removal operator are introduced to redefine the local search phase,strengthen the information interaction between each Harris hawk,and improve the local exploration ability of the algorithm.The experimental results show that the proposed algorithm has strong optimization ability in solving the vehicle routing problem with time window,and the solution quality is better than other heuristic algorithms.

关 键 词：带时间窗车辆路径问题(VRPTW) 离散哈里斯鹰优化算法 移除算子 贪心策略 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]