期刊
SOFT COMPUTING
卷 21, 期 15, 页码 4387-4398出版社
SPRINGER
DOI: 10.1007/s00500-016-2071-8
关键词
Genetic algorithm; Ant colony optimization algorithm; Chaotic optimization method; Multi-strategy; Collaborative optimization; Complex optimization problem
资金
- National Natural Science Foundation of China [U1433124, 51475065]
- Open Project Program of State Key Laboratory of Mechanical Transmissions (Chongqing University) [SKLMT-KFKT-201416, SKLMT-KFKT-201513]
- Natural Science Foundation of Liaoning Province [2015020013]
- Open Fund of Key Laboratory of Guangxi High Schools for Complex System & Computational Intelligence [15CI06Y]
- Open Project Program of Guangxi Key laboratory of hybrid computation and IC design analysis [HCIC201507, HCIC201402]
- Open Project Program of the Traction Power State Key Laboratory of Southwest Jiaotong University [TPL1403]
- PAPD fund
To overcome the deficiencies of weak local search ability in genetic algorithms (GA) and slow global convergence speed in ant colony optimization (ACO) algorithm in solving complex optimization problems, the chaotic optimization method, multi-population collaborative strategy and adaptive control parameters are introduced into the GA and ACO algorithm to propose a genetic and ant colony adaptive collaborative optimization (MGACACO) algorithm for solving complex optimization problems The proposed MGACACO algorithm makes use of the exploration capability of GA and stochastic capability of ACO algorithm. In the proposed MGACACO algorithm, the multi-population strategy is used to realize the information exchange and cooperation among the various populations. The chaotic optimization method is used to overcome long search time, avoid falling into the local extremum and improve the search accuracy. The adaptive control parameters is used to make relatively uniform pheromone distribution, effectively solve the contradiction between expanding search and finding optimal solution. The collaborative strategy is used to dynamically balance the global ability and local search ability, and improve the convergence speed. Finally, various scale TSP are selected to verify the effectiveness of the proposed MGACACO algorithm. The experiment results show that the proposed MGACACO algorithm can avoid falling into the local extremum, and takes on better search precision and faster convergence speed.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据