通信学报2018，Vol.39Issue(12)：18-29,12.DOI:10.11959/j.issn.1000-436x.2018284
改进蜂群算法求解大规模着色瓶颈旅行商问题
Improved artificial bee colony algorithm for large scale colored bottleneck traveling salesman problem
摘要
Abstract
In the fields such as intelligent transport and multiple tasks cooperation, the model scale constructed by colored bottleneck traveling salesman problem (CBTSP) tends to large scale, and therefore it is necessary to study the large scale CBTSP and its algorithms. An improved artificial bee colony algorithm (IABC) was applied to solve the large scale CBTSP. IABC employed generating neighboring solution (GNS) to improve artificial bee colony algorithm for CBTSP. GNS generated new solution by deletion and reinsertion operations, during this process, and it can optimized the existed solution for this problem. Experiments show that IABC can demonstrate better solution quality than other compared algorithms for large scale CBTSP.关键词
改进蜂群算法/着色瓶颈旅行商问题/着色旅行商问题/瓶颈旅行商问题/大规模优化Key words
improved artificial bee colony algorithm/ colored bottleneck traveling salesman problem/ colored traveling salesman problem/ bottleneck traveling salesman problem/ large scale optimization分类
信息技术与安全科学引用本文复制引用
董文永,董学士,王豫峰..改进蜂群算法求解大规模着色瓶颈旅行商问题[J].通信学报,2018,39(12):18-29,12.基金项目
国家自然科学基金资助项目(No.61672024,No.61170305) （No.61672024,No.61170305）
