摘要
采用人工蜂群算法对车辆路径问题进行求解,给出食物源的自然数编码方法,并采用邻域倒位方法生成候选食物源。应用算法求解了多个车辆路径问题的实例,并将结果与其它一些启发式算法进行了比较和分析。计算结果表明,人工蜂群算法可以有效求解车辆路径问题,同时也为算法求解其它一些组合优化问题提供了有益思路。
An artificial bee colony algorithm is proposed to solve the vehicle routing problem.The algorithm gives a natural number coding method for the food source and adopts neighborhood inversion to produce a candidate food source.It is applied to solve multiple instances of the vehicle routing problem.It is compared with other heuristic algorithms on a set of benchmark instances,and the results show the effectiveness of the proposed artificial bee colony algorithm,which presents a new vision for other combination optimization problems.
出处
《计算机工程与科学》
CSCD
北大核心
2014年第6期1088-1094,共7页
Computer Engineering & Science
基金
江苏省高等学校大学生实践创新训练计划项目(2012JSSPITP3029)
南京师范大学泰州学院资助项目(Q201232)
关键词
车辆路径问题
组合优化
人工蜂群算法
邻域倒位
vehicle routing problem
combination optimization
artificial bee colony algorithm
neighborhood inversion
