人工蜂群算法求解VRPSPD问题研究
首发时间:2017-02-06
摘要:针对同时取人工蜂群算法求解VRPSPD问题研究送货车辆路径规划问题,对算法中邻域搜索策略进行研究,提出一种改进的人工蜂群算法。通过将变邻域搜索方式与蜂群搜索方式融合,改变蜂群的全局搜索和局部搜索性能。利用常用标准数据测试算法,与经典的算法案例结果进行数据对比,结果表明改进算法具有更好的收敛性及均匀的解分布。
关键词: 同时取送货车辆路径问题 人工蜂群算法 变邻域深度搜索
For information in English, please click here
Solving vehicle routing problem with simultaneous deliveries and pickups with artificial bee colony algorithm
Abstract:Aiming at the problem of vehicle routing problem with simultaneous deliveries and pickups (VRPSPD), an improved artificial bee colony algorithm was proposed after research on neighborhood search strategy. Changing the global search and local search performance through combine the variable neighborhood search into the search of bees. Test the algorithms with standard data and compare with the results of classical algorithm case. The results of comparison show that the algorithm can effectively solve VRPSPD and it has better convergence and stability robustness.
Keywords: Vehicle routing problem with simultaneous deliveries and pickups artificial bee colony Variable neighborhood descent
基金:
论文图表:
引用
No.4718095117791814****
同行评议
共计0人参与
勘误表
人工蜂群算法求解VRPSPD问题研究
评论
全部评论0/1000