摘要
本文提出了一种新的求解旅行商问题(TSP)的离散人工蜂群算法(DABC)。以基本人工蜂群算法为框架,采用路径编码的方式,综合运用离散交叉算子,逆转算子,免疫算子和单/多步2-opt算子以帮助雇佣蜂,观察蜂和侦察蜂产生新食物源。选择TSPLIB中典型的TSP实例进行仿真实验,运用多项性能指标对DABC算法进行评估。实验结果表明本文算法是解决TSP问题的一种非常有效的新方法。
This paper proposes a new discrete artificial bee colony （DABC）algorithm for solving traveling sales-man problems（TSP）. The DABC is based on the basic ABC algorithm, and it synthetically utilizes the discretecrossover operator, inverse operator, immune operator and single/multiple steps 2-opt operator to help the em-ployed bees, onlooker bees and scout bees produce new food sources. Typical TSP instances are selected fromTSPLIB in order to conduct the simulation experiment. The DABC is evaluated by using some performance met-rics, and it is shown by the experimental results that the proposed algorithm is a quite effective new approach forhandling TSP problems.
作者
段渊
向毅
陈刚
DUAN Yuan XIANG Yi CHEN Gang(Department of Basic Courses, Guangdong University of Science and Technology, Dongguan 523083, China Department of Basic Courses, Guangdong Baiyun University, Guangzhou 510450, China Department of Computer Sciences, Guangdong University of Science and Technology, Dongguan 523083, China)
出处
《运筹与管理》
CSSCI
CSCD
北大核心
2016年第5期141-146,共6页
Operations Research and Management Science
基金
广东省教育厅创新人才项目(自然科学类2014KQNCX236)
关键词
运筹学
离散人工蜂群算法
组合优化
旅行商问题
operational research
discrete artificial bee colony algorithm
combinatorial optimization
travelingsalesman problem
