共查询到20条相似文献,搜索用时 62 毫秒
1.
一种改进的蚁群算法在TSP问题中的应用研究 总被引:1,自引:0,他引:1
蚁群算法是近几年发展起来的一种新型的拟生态启发式算法,它已经被成功地应用在旅行商(TSP)问题上.由于基本蚁群算法存在过早陷入局部最优解和收敛性较差等缺点,文中对基本蚁群算法在基于蚁群系统的基础上进行了改进,在信息素的更新和解的搜索过程中更多地关注了局部最优解的信息,以使算法尽可能地跳出局部最优,并且改进后的算法对一些关键参数更容易控制.多次实验表明改进的蚁群算法在解决TSP问题上与基本蚁群算法相比有较好的寻优能力和收敛能力.这种算法可以应用在其它组合优化问题上,有一定的工程应用价值. 相似文献
2.
在文化算法基础上提出了一种改进的用于求解TSP问题的蚁群优化算法。改进算法采用新的双层进化机制对文化算法的种群空间与信念空间进行了重新设计,用最大最小蚁群系统(MMAS)构建种群空间,在信念空间中对当前最优解进行改进的3-OPT交叉变换操作,由于采用了这种双层进化机制,种群空间获得了更高的进化效率。通过仿真实验结果表明,改进算法比传统的蚁群算法(ACO)、文化蚁群算法(CACS)效果更好,收敛速度更快,精确度更高。 相似文献
3.
4.
5.
增强型的蚁群优化算法 总被引:8,自引:1,他引:8
旅行商问题是一个NP-Hard组合优化问题。根据蚁群优化算法和旅行商问题的特点,论文提出了对蚁群中具有优质解的蚂蚁个体所走路径上的信息素强度进行增强的方法,并同其他的优化算法进行了比较,仿真结果表明,对具有全局和局部最优解的个体所走路径上的信息素强度进行增强的蚁群优化算法比标准的蚁群优化算法和其他优化算法在执行效率和稳定性上要高。 相似文献
6.
提出了一种新的用于求解TSP问题的智能蚁群优化算法。新算法从TSP问题本身出发,提取出了该问题的一种本质特征,并赋予蚁群算法中的精英蚂蚁以识别该固有特征的能力,以提高精英蚂蚁的搜索质量,进而使得新算法整体的求解能力得以提高。文章中不仅阐述了新算法的原理,而且进行了仿真实验,实验结果表明新算法在求解时间和求解质量上都取得了很好的效果。 相似文献
7.
8.
TSP问题(旅行商问题)是组合优化问题中最经典的NP问题之一,蚁群算法是基于群体的一种仿生算法,为求解复杂的组合优化问题提供了一种新思路,本文讨论了如何用基本的蚁群算法来求解TSP问题。 相似文献
9.
A dynamic parameter adaptation methodology for Ant Colony Optimization (ACO) based on interval type-2 fuzzy systems is presented in this paper. The idea is to be able to apply this new ACO method with parameter adaptation to a wide variety of problems without the need of finding the best parameters for each particular problem. We developed several fuzzy systems for parameter adaptation and a comparison was made among them to decide on the best design. The use of fuzzy logic is to control the diversity of the solutions, and in this way controlling the exploration and exploitation abilities of ACO. The travelling salesman problem (TSP) and the design of a fuzzy controller for an autonomous mobile robot are the benchmark problems used to test the proposed methodology. 相似文献
10.
针对加入导向性局部搜索(Guided Local Search,GLS)的蚁群算法(Ant Colony Optimization,ACO)容易过早收敛的问题,提出一种带有摄动的导向性蚁群算法(Perturbation Guided Ant Colony Optimization,PGACO),该算法在当前解表现出过早收敛的趋势时,采用摄动(Perturbation)方式干扰解构建过程,使当前解移动到其邻域空间,从而产生一个新的可行解来避免算法过早收敛,提高算法求解的精度。实验结果表明,PGACO能有效地改善过早收敛问题,获得更优的可行解和执行速度,同时具有更强的全局搜索能力,能进一步提高算法的性能。 相似文献
11.
一种求解异构DAG调度问题的置换蚁群 总被引:1,自引:1,他引:0
减少分布式程序的执行时间,是网格调度系统需要解决的重要问题。因分布式程序常建模为DAG图,故该问题又称异构DAG调度问题。提出的置换调度蚁群PSACS(Permutation Scheduling Ant Colony System)将DAG调度方案表示为任务置换列表,使用标准蚁群搜索技术探索解空间。实验表明,该算法明显优于遗传算法和粒子群算法,能够一次求出大部分(65%)同构DAG调度问题的最优解并获得非常好的异构DAG调度方案。 相似文献
12.
13.
14.
Load balanced transaction scheduling problem is an important issue in distributed computing environments including grid system. This problem is known to be NP-hard and can be solved by using heuristic as well as any meta-heuristic method. We ponder over the problem of the load balanced transaction scheduling in a grid processing system by using an Ant Colony Optimization for load balancing. The problem that we consider is to achieve good execution characteristics for a given set of transactions that has to be completed within their given deadline. We propose a transaction processing algorithm based on Ant Colony Optimization (ACO) for load balanced transaction scheduling. We modify two meta-heuristic along with ACO and three heuristic scheduling algorithms for the purpose of comparison with our proposed algorithm. The results of the comparison show that the proposed algorithm provides better results for the load balanced transaction scheduling in the grid processing system. 相似文献
15.
16.
17.
A survey: Ant Colony Optimization based recent research and implementation on several engineering domain 总被引:1,自引:0,他引:1
Ant Colony Optimization (ACO) is a Swarm Intelligence technique which inspired from the foraging behaviour of real ant colonies. The ants deposit pheromone on the ground in order to mark the route for identification of their routes from the nest to food that should be followed by other members of the colony. This ACO exploits an optimization mechanism for solving discrete optimization problems in various engineering domain. From the early nineties, when the first Ant Colony Optimization algorithm was proposed, ACO attracted the attention of increasing numbers of researchers and many successful applications are now available. Moreover, a substantial corpus of theoretical results is becoming available that provides useful guidelines to researchers and practitioners in further applications of ACO. This paper review varies recent research and implementation of ACO, and proposed a modified ACO model which is applied for network routing problem and compared with existing traditional routing algorithms. 相似文献
18.
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. 相似文献
19.
针对求解DNA杂交测序(SBH)问题的相关算法存在解的精度不高及收敛速度慢等问题,建立SBH问题的数学模型,从中抽取启发式信息,提出一种改进的并行蚁群优化算法(IPACO),并将其应用到DNA杂交测序问题中。仿真实验结果表明,该算法解的精度和收敛速度均优于普通串行蚁群算法、禁忌搜索算法和进化算法。 相似文献
20.
建立指派问题的数学模型,将其转化为旅行商问题,利用蚁群算法求解此问题。蚁群算法是一种解决组合优化问题的有效算法,但同样存在搜索速度慢,易于陷于局部最优的缺陷。该文提出一种具有动态信息素更新的蚁群算法,通过具体的算例分析,表明该算法比传统的蚁群算法有更快的收敛速度和较好的稳定性。 相似文献