旅行商问题的混沌混合离散蝙蝠算法  

Chaotic Hybrid Discrete Bat Algorithm for Traveling Salesman Problem

作　　者：戚远航 蔡延光[1] 蔡颢[2] 汤雅连[1] 吕文祥[1] 

机构地区：[1]广东工业大学自动化学院,广东广州510006 [2]奥尔堡大学健康科学与技术系

出　　处：《电子学报》2016年第10期2543-2547,共5页Acta Electronica Sinica

基　　金：国家自然科学基金(No.61074147);广东省自然科学基金(No.S2011010005059);广东省教育部产学研结合项目(No.2012B091000171;No.2011B090400460);广东省科技计划项目(No.2012B050600028;No.2014B010118004);广州市花都区科技计划项目(No.HD14ZD001)

摘　　要：针对现有离散蝙蝠算法在求解旅行商问题时存在的收敛速度较慢、收敛率不高等问题,提出了混沌混合离散蝙蝠算法.该算法采用混沌初始化策略提高算法的寻优能力,引入2-Opt技术增强算法的局部搜索能力、加快算法的收敛速度.大量的仿真实验表明:所提出的算法在求解小规模TSP时能快速收敛到已知最优解;在求解大规模TSP时能在较短的时间内收敛到偏差0.4%以内的最优解.In viewof some problems,like slowconvergence speed and lowconstringency rate,arising during the process of applying discrete bat algorithms to solve travelling salesman problem,a chaotic hybrid discrete bat algorithm is proposed. The proposed algorithm adopts chaotic initialization strategy to improve the capability of optimization,and the 2-Opt to enhance the capability of local search and to speed up the convergence speed. A large amount of simulations showthat the algorithm can achieve their solutions rapidly for some small scale traveling salesman problems,and obtain their solutions in a relatively short time with the error less than 0. 4% for large ones.

关 键 词：旅行商问题 混沌初始化 蝙蝠算法 2-Opt 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]