蚁群算法及其在求解旅行商问题中的应用

蚁群算法是一种求解组合优化问题较好的方法。在蚁群算法的基本原理基础上,以旅行商问题为例,介绍了该算法求解TSP的数学模型及具体步骤,并通过仿真实验与粒子群优化算法等方法比较分析,表明了该算法在求解组合优化问题方面具有良好的性能。     

一种基于粒子群参数优化的改进蚁群算法

蚁群算法是一种应用广泛、性能优良的智能优化算法,其求解效果与参数选取息息相关.鉴于此,针对现有基于粒子群参数优化的改进蚁群算法耗时较大的问题,提出一种新的解决方案.该方案给出一种全局异步与精英策略相结合的信息素更新方式,且通过大量统计实验可以在较大程度上减少蚁群算法被粒子群算法调用一次所需的迭代代数.仿真实验表明,所提出算法在求解较大规模旅行商问题时具有明显的速度优势.     

蚁群算法及其在求解旅行商问题中的应用

蚁群算法是一种求解组合优化问题较好的方法。在蚁群算法的基本原理基础上,以旅行商问题为例,介绍了该算法求解TSP的数学模型及具体步骤,并通过仿真实验与粒子群优化算法等方法比较分析,表明了该算法在求解组合优化问题方面具有良好的性能。     

蚁群与粒子群混合算法求解TSP问题

旅行商问题（TSP）是最古老而且研究最广泛的组合优化问题。针对TSP问题,提出一种蚁群与粒子群混合算法（HAPA）。HAPA首先将蚁群划分成多个蚂蚁子群,然后把蚂蚁子群的参数作为粒子,通过粒子群算法来优化蚂蚁子群的参数,并在蚂蚁子群中引入了信息素交换操作。实验结果表明,HAPA在求解TSP问题中比传统算法和同类算法更具优越性。     

求解旅行商问题的混合粒子群优化算法

结合遗传算法、蚁群算法和模拟退火算法的思想，提出用混合粒子群算法来求解著名的旅行商问题．与模拟退火算法、标准遗传算法进行比较，24种混合粒子群算法的效果都比较好，其中交叉策略D和变异策略F的混合粒子群算法的效果最好，而且简单有效．对于目前仍没有较好解法的组合优化问题，通过此算法修改很容易解决．     

基于T-ACO算法的旅行商问题求解优化研究

为了有效求解旅行商问题,本文提出了一种基于T分布的改进蚁群算法。针对基本蚁群算法易陷入局部最优、寻优精度低等缺陷,在优化过程中,在信息素更新原则上,引入T分布,有益于基本蚁群算法弥补其不足。在基本蚁群算法中增加了信息素的突变,使得蚂蚁群的多样性提高,从而跳出局部最优的限制。与此同时,T-ACO算法在旅行商问题搜寻精度与收敛速度方面也得到了提高。对T-ACO求解旅行商问题的性能进行了实验仿真,实验分析表明,T-ACO算法有更好的寻优能力。     

蚁群算法在求解旅行商问题中的应用综述

旅行商问题作为组合优化研究中最具挑战的问题之一, 自被提出以来就引起了学术界的广泛关注并提出了大量的方法来解决它. 蚁群算法是求解复杂组合优化问题的一种启发式仿生进化算法, 是求解旅行商问题的有效手段. 本文分别介绍蚁群算法中几个有代表性的算法, 综述了蚁群算法的改进、融合和应用的文献研究进展, 以评价近年来不同版本的蚁群算法为解决旅行商问题的发展和研究成果, 并针对改进蚁群算法结构框架、算法参数的设置及优化、信息素优化和混合算法等方面, 对现被提出的改进算法进行了分类综述. 对蚁群算法在未来对旅行商问题及其他不同领域的研究内容和研究热点的进一步发展提供了展望和依据.     

基于信息熵调整的自适应蚁群算法

针对基本蚁群算法在求解大规模旅行商问题进易导致搜索时间过长或陷入停滞的问题,提出一种基于信息熵调整的自适应蚁群算法.该算法通过优化过程中种群的信息熵来衡量演化的程度,自适应地调整路径选择策略和信息素更新策略.信息熵的计算以某条路径边上的信息素占总信息素量的比例为基础.对大规模城市数旅行商问题进行实验,实验结果表明,提出的基于信息熵调整的自适应蚁群算法能获得比基本蚁群算法更好的解,并且增加了算法的稳定性.     

改进蚁群算法的TSP问题研究

蚁群算法是受蚂蚁觅食行为启发的智能仿生优化算法,在求解TSP这一组合优化问题时行之有效。笔者针对基本蚁群算法求解TSP时存在易于陷入局部最优解、过早停滞的缺陷,结合引入参数、分阶段迭代对基本蚁群算法做出改进,并将改进的蚁群算法与基本蚁群算法解决旅行商问题的实验结果进行对比分析,验证改进蚁群算法的效果。     

智能优化算法求解TSP 问题

TSP（旅行商）问题代表组合优化问题，具有很强的工程背景和实际应用价值，但至今尚未找到非常有效的求解方法．为此，讨论了最近研究比较热门的使用各种智能优化算法（蚁群算法、遗传算法、模拟退火算法、禁忌搜索算法、Hopfield神经网络、粒子群优化算法、免疫算法等）求解TSP问题的研究进展，指出了各种方法的优缺点和改进策略．最后总结并提出了智能优化算法求解TSP问题的未来研究方向和建议．     

三种现代优化算法的比较研究

现代最优化算法比较常见的有遗传算法、蚁群算法、微粒群算法、人工鱼群算法等。本文主要对前三种算法优化性能进行比较研究。首先介绍了三种算法的基本原理,然后总结了各自的优缺点并从原理和参数两个方面对三种算法进行了对比分析,最后以经典TSP问题为例进行了仿真研究并得出了一些指导算法适用范围的结论。     

Multi-satellite control resource scheduling based on ant colony optimization

The multi-satellite control resource scheduling problem (MSCRSP) is a kind of large-scale combinatorial optimization problem. As the solution space of the problem is sparse, the optimization process is very complicated. Ant colony optimization as one of heuristic method is wildly used by other researchers to solve many practical problems. An algorithm of multi-satellite control resource scheduling problem based on ant colony optimization (MSCRSP–ACO) is presented in this paper. The main idea of MSCRSP–ACO is that pheromone trail update by two stages to avoid algorithm trapping into local optima. The main procedures of this algorithm contain three processes. Firstly, the data get by satellite control center should be preprocessed according to visible arcs. Secondly, aiming to minimize the working burden as optimization objective, the optimization model of MSCRSP, called complex independent set model (CISM), is developed based on visible arcs and working periods. Ant colony algorithm can be used directly to solve CISM. Lastly, a novel ant colony algorithm, called MSCRSP–ACO, is applied to CISM. From the definition of pheromone and heuristic information to the updating strategy of pheromone is described detailed. The effect of parameters on the algorithm performance is also studied by experimental method. The experiment results demonstrate that the global exploration ability and solution quality of the MSCRSP–ACO is superior to existed algorithms such as genetic algorithm, iterative repair algorithm and max–min ant system.     

A hybrid ant colony optimization algorithm for optimal multiuser detection in DS-UWB system

A hybrid ant colony optimization algorithm is proposed by introducing extremal optimization local-search algorithm to the ant colony optimization (ACO) algorithm, and is applied to multiuser detection in direct sequence ultra wideband (DS-UWB) communication system in this paper. ACO algorithms have already successfully been applied to combinatorial optimization; however, as the pheromone accumulates, we may not get a global optimum because it can get stuck in a local minimum resulting in a bad steady state. Extremal optimization (EO) is a recently developed local-search heuristic method and has been successfully applied to a wide variety of optimization problems. Hence in this paper, a hybrid ACO algorithm, named ACO-EO algorithm, is proposed by introducing EO to ACO to improve the local-search ability of the algorithm. The ACO-EO algorithm is applied to multiuser detection in DS-UWB communication system, and via computer simulations it is shown that the proposed hybrid ACO algorithm has much better performance than other ACO algorithms and even equal to the optimal multiuser detector.     

一种基于GPU加速的细粒度并行蚁群算法

为改善蚁群算法对大规模旅行商问题的求解性能,提出一种基于图形处理器(GPU)加速的细粒度并行蚁群算法.将并行蚁群算法求解过程转化为统一计算设备架构的线程块并行执行过程,使得蚁群算法在GPU中加速执行.实验结果表明,该算法能提高全局搜索能力,增大细粒度并行蚁群算法的蚂蚁规模,从而提高了算法的运算速度.     

自适应路由蚁群算法在导弹残骸搜索中的应用

防空导弹飞行试验后弹目残骸有着重要价值.根据残骸搜索的实际需求,把残骸落点纳入到路网中,结合自适应路由算法,改进了基本蚁群算法,解决了靶场残骸搜索的最优路径问题.蚁群算法有收敛性较差、易于过早陷入局部最优等不足,通过构建蚁群、引入信息素约束条件、调整信息素初始值、自适应改变信息素增量等技术,增强了蚁群搜索能力,改善了算法收敛速度.仿真表明该算法易于编程实现,时延小,鲁棒性强,实用性好.     

An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis

Clustering is a popular data analysis and data mining technique. A popular technique for clustering is based on k-means such that the data is partitioned into K clusters. However, the k-means algorithm highly depends on the initial state and converges to local optimum solution. This paper presents a new hybrid evolutionary algorithm to solve nonlinear partitional clustering problem. The proposed hybrid evolutionary algorithm is the combination of FAPSO (fuzzy adaptive particle swarm optimization), ACO (ant colony optimization) and k-means algorithms, called FAPSO-ACO–K, which can find better cluster partition. The performance of the proposed algorithm is evaluated through several benchmark data sets. The simulation results show that the performance of the proposed algorithm is better than other algorithms such as PSO, ACO, simulated annealing (SA), combination of PSO and SA (PSO–SA), combination of ACO and SA (ACO–SA), combination of PSO and ACO (PSO–ACO), genetic algorithm (GA), Tabu search (TS), honey bee mating optimization (HBMO) and k-means for partitional clustering problem.     

A comparative study of the improvement of performance using a PSO modified by ACO applied to TSP

Swarm-inspired optimization has become very popular in recent years. Particle swarm optimization (PSO) and Ant colony optimization (ACO) algorithms have attracted the interest of researchers due to their simplicity, effectiveness and efficiency in solving complex optimization problems. Both ACO and PSO were successfully applied for solving the traveling salesman problem (TSP). Performance of the conventional PSO algorithm for small problems with moderate dimensions and search space is very satisfactory. As the search, space gets more complex, conventional approaches tend to offer poor solutions. This paper presents a novel approach by introducing a PSO, which is modified by the ACO algorithm to improve the performance. The new hybrid method (PSO–ACO) is validated using the TSP benchmarks and the empirical results considering the completion time and the best length, illustrate that the proposed method is efficient.     

Ant colony optimization for bearings-only maneuvering target tracking in sensors network

In this paper, the problem of bearings-only maneuvering target tracking in sensors network is investigated. Two objectives are proposed and optimized by the ant colony optimization (ACO), then two kinds of node searching strategies of the ACO algorithm are presented. On the basis of the nodes determined by the ACO algorithm, the interacting multiple models extended Kalman filter (IMMEKF) for the multi-sensor bearings-only maneuvering target tracking is introduced. Simulation results indicate that the proposed ACO algorithm performs better than the Closest Nodes method. Furthermore, the Strategy 2 of the two given strategies is preferred in terms of the requirement of real time.     

Ant colony optimization for bearings-only maneuvering target tracking in sensors network

In this paper, the problem of bearings-only maneuvering target tracking in sensors network is investigated. Two objectives are proposed and optimized by the ant colony optimization （ACO）, then two kinds of node searching strategies of the ACO algorithm are presented. On the basis of the nodes determined by the ACO algorithm, the interacting multiple models extended Kalman filter （IMMEKF） for the multi-sensor bearings-only maneuvering target tracking is introduced. Simulation results indicate that the proposed ACO algorithm performs better than the Closest Nodes method. Furthermore, the Strategy 2 of the two given strategies is preferred in terms of the requirement of real time.     

蚁群算法及其应用研究进展

蚁群算法作为一种仿生进化算法,是受到真实蚁群觅食机制的启发而提出的.首先介绍了蚁群算法的基本原理和工作机制,然后分别就蚁群算法的理论和应用的研究现状进行了综述,主要包括蚁群算法的参数设置,蚁群算法的改进,蚁群算法的收敛性以及蚁群算法在组合优化问题和连续优化问题中的应用,并进一步给出了它们的研究重点和发展方向,最后是关于蚁群算法的研究展望和面临的挑战,提出了蚁群算法研究中值得探讨的一些课题.