Location:
Search - ACO-AS
Search list
Description: A new heuristic algorithm-ant colony optimization and its basical theory are introduced in this article to solve the complicated and optimized questions.This method simulates the course of ant searching food to solve this kind of questions.It has these merits such as intelligent searching,holistic optimizing,strong solidity,distributed calculate and easily to combine with other methods.
Platform: |
Size: 869459 |
Author: wangliang |
Hits:
Description: 蚁群算法(ant colony optimization, ACO)，又称蚂蚁算法，是一种用来在图中寻找优化路径的机率型技术。它由Marco Dorigo于1992年在他的博士论文中引入，其灵感来源于蚂蚁在寻找食物过程中发现路径的行为-ant colony algorithm (ant colony optimization, ACO). also known as the ant algorithm is a map to find the optimal path of probability- based technology. Marco Dorigo from it in 1992 in his doctoral thesis introduction, its inspiration from the ants find food in the course of the path found
Platform: |
Size: 16384 |
Author: linffeng |
Hits:
Description: A new heuristic algorithm-ant colony optimization and its basical theory are introduced in this article to solve the complicated and optimized questions.This method simulates the course of ant searching food to solve this kind of questions.It has these merits such as intelligent searching,holistic optimizing,strong solidity,distributed calculate and easily to combine with other methods.
Platform: |
Size: 869376 |
Author: wangliang |
Hits:
Description: 蚁群优化算法是一种基于自然启发的metaheuristic算法,从其提出到现在历经10多年的发展到目前已经成为一种解决组合优化问题的有效工具。最大团问题是一个经典的NP难的组合优化问题,很多实际问题都可以抽象为对无向图上最大团问题的求解,所以,对最大团问题的研究无论在理论上还是实际上都有重要意义。 -Ant colony optimization algorithm is a metaheuristic based on natural-inspired algorithms, from their proposed up to now after 10 years of development to the present has become a kind of combinatorial optimization problems to solve an effective tool. Maximum Clique problem is a classic NP hard combinatorial optimization problem, a lot of practical problems can be abstracted as undirected graph of the largest corporations to solve the problem, therefore, the largest corporation on the issue of research both in theory and in fact have a major significance.
Platform: |
Size: 236544 |
Author: wangliang |
Hits:
Description: 算法设计与分析 蚁群算法的设计和分析，具体的代码和细致的讲解-Algorithm design and analysis of ant colony algorithm design and analysis, the specific code and detailed explanation
Platform: |
Size: 440320 |
Author: fengshimin |
Hits:
Description: 解旅行商问题的ACO算法，包括了AS，EAS，ASRANK，MMAS，ACS-ACO to slove TSP. Including AS，EAS，ASRANK，MMAS，ACS.
Platform: |
Size: 95232 |
Author: xiaochuzhe |
Hits:
Description: Short description: GUI Ant-Miner is a tool for extracting classification rules from data. It is an updated version of a data mining algorithm called Ant-Miner (Ant Colony-based Data Miner), which was proposed in 2002 by Parpinelli, Lopes and Freitas. GUI Ant-Miner differs from the original algorithm as follows: It has a friendly graphical user interface, makes possible the use of ant populations within the Ant Colony Optimization (ACO) concept, data input file is standardized with the well-known Weka system, and runs on virtually any operating system since it is written in Java.
Platform: |
Size: 72704 |
Author: xiaochuzhe |
Hits:
Description: 一个较好的蚁群MATLAB程序，附地图。-In this M-file, the implemention of ACO Algorithm is given with the support of reference papers listed. You can easily use it as following command to see the pictures of result and the iterative playing course.
Platform: |
Size: 27648 |
Author: boy |
Hits:
Description: General simulated annealing algorithm-anneal Minimizes a function with the method of simulated annealing (Kirkpatrick et al., 1983)
ANNEAL takes three input parameters, in this order:
LOSS is a function handle (anonymous function or inline) with a loss function, which may be of any type, and needn t be continuous. It does, however, need to return a single value.
PARENT is a vector with initial guess parameters. You must input an initial guess.
OPTIONS is a structure with settings for the simulated annealing. If no OPTIONS structure is provided, anneal uses a default structure. OPTIONS can contain any or all of the following fields (missing fields are filled with default values):
Verbosity: Controls output to the screen.
0 suppresses all output
1 gives final report only [default]
2 gives temperature changes and final report
Generator: Generates a new solution from an old one. Any function handle that takes a solution as input and gives a valid solution (i.e.
Platform: |
Size: 4096 |
Author: Ping-Feng Xu |
Hits:
Description: 蚁群算法(ant colony algorithm，简称ACA)是20世纪90年代由意大利学者M．Dorigo等人首先提出来的一种新型的模拟进化算法．它的出现为解决NP一难问题提供了一条新的途径．用蚁群算法求解旅行商问题(TSP)、分配问题(QAP)、调度问题(JSP)等，取得了一系列较好的实验结果．虽然对蚁群算法研究的时间不长，但是初步研究已显示出蚁群算法在求解复杂优化问题(特别是离散优化问题)方面具有一定的优势，表明它是一种很有发展前景的方法．蚁群算法的主要特点是：正反馈、分布式计算．正反馈过程使它能较快地发现问题的较好解；分布式易于并行实现，将它与启发式算法相结合，易于发现较好解．-ACO (ant colony algorithm, referred to as ACA) is the 1990s by the Italian scholar M. Dorigo, who first proposed a new type of simulated evolutionary algorithm. It appears to solve NP-hard problem provides a new way. Ant colony algorithm for traveling salesman problem (TSP), distribution (QAP), scheduling problems (JSP), etc., made a series of good results. Although the ant colony algorithm is not long, but preliminary studies have shown that the ant colony algorithm in solving complex optimization problems (in particular, discrete optimization problem) has certain advantages, that it is a promising approach. The main features of ant colony algorithm is: positive feedback, distributed computing. Positive feedback process so that it can quickly find a better solution of the problem distributed easy-to-parallel implementation, it would be combined with the heuristic algorithm, easy to find better solutions.
Platform: |
Size: 2048 |
Author: 咋都有 |
Hits:
Description: 智能蚁群优化算法及其应用，还有仿真实现，很不错 的，很好用-Intelligent ant colony optimization algorithm and its application, as well as Simulation, very good, very good
Platform: |
Size: 3730432 |
Author: chengfei |
Hits:
Description: 混沌改进蚁群算法以及其在船舶锅炉压力控制PID中的应用研究-Chaos improved ant colony algorithm, as well as in ship boiler pressure control PID
Platform: |
Size: 6144 |
Author: anne |
Hits:
Description: 这是我2012年第一个学期的期末大作业。
不得不说这段代码参考了网络上的一些代码，以及书本上的一些相关数据。
但是无论是网络上还是书上难免总是有很多C++的影子，这是我自己理解之后用C编写的蚁群算法的代码。-This is my first semester of 2012, the final job. Have to say this code with reference to some code on the network, as well as books on some of the relevant data. But whether it is on the network or on the book inevitably always have many C++ the shadow, this is my own understanding of ant colony algorithm written in C code.
Platform: |
Size: 2048 |
Author: 周力 |
Hits:
Description: 基于蚁群算法的机器人的路径规划问题蚁群算法，一种与传统的数学规划原理截然不同的，模拟自然生态系统以求解复杂优化问题(如NPC(NP Complete)类问题，典型的有TSP(Traveling Saleman Problem)问题)的仿生优化算法，因其较强分布式计算机制、鲁棒性、易于与其他方法相结合等优点，使得蚁群算法具有较广泛应用领域，为那些最优化技术难以解决的组合优化问题提供了一类新的切实可行的解决方案。从最初的一维的静态优化问题扩展到多维的动态组合优化问题，包括车辆路径规划，工程设计，电力系统，图像处理，通讯系统，机器人系统，以及制造系统等领域。该文所研究的内容是其中之一——机器人的路径规划问题。
机器人路径规划是机器人学的一个重要研究领域，引起了众多研究者的关注。栅格法模型是众多环境建模方法中的一类实时性很强的路径规划模型。该文引入蚁群算法的基本思想，接着在基本蚁群算法上提出改进策略，并通过经典的旅行商问题验证改进蚁群算法的正确性，然后在改进的蚁群算法的基础上使用栅格法的路径规划策略, 并编制相应程序进行验证。
-Ant colony optimization, a mathematical programming with the traditional principle distinct simulate natural ecosystems to solve complex optimization problems (such as the NPC (NP Complete) class of problems, typically a TSP (Traveling Saleman Problem) problem) bionic optimization algorithm , because of its strong distributed computer system, robustness, ease combined with other methods, etc., makes the ant colony algorithm has a wider application areas, for those most difficult to solve optimization combinatorial optimization problems provide a new class of practical solutions. From the initial one-dimensional static optimization problem extended to multi-dimensional dynamic combinatorial optimization problems, including vehicle path planning, engineering design, power systems, image processing, communication systems, robotic systems, and manufacturing systems. In this paper, the contents of the study is one of these- robot path planning issues.
Platform: |
Size: 1100800 |
Author: lin |
Hits:
Description: 本文主要介绍蚁群算法的原理，具体的编程思路，以及可应用的领域与具体的实施例。-This paper describes the principles of ant colony algorithm, specific programming ideas, as well as areas that can be applied to specific embodiments.
Platform: |
Size: 18330624 |
Author: zhengzerong |
Hits:
Description: 除了蚁群算法，可用于PID参数优化的智能算法还有很多，比如遗传算法、模拟退火算法、粒子群算法、人工鱼群算法，等等。-In addition to the ant colony algorithm can be used to optimize the PID parameters, there are many intelligent algorithms, such as genetic algorithms, simulated annealing algorithm, particle swarm optimization, AFSA, and so on.
Platform: |
Size: 1024 |
Author: 昊轩 |
Hits:
Description: 比较好的蚁群算法MATLAB代码,作为学习人工智能算法是比较好的例子-Good ant colony algorithm based on MATLAB code as a learning algorithm is a good example of artificial intelligence
Platform: |
Size: 10240 |
Author: hedy |
Hits:
Description: 除了蚁群算法，可用于PID参数优化的智能算法还有很多，比如遗传算法、模拟退火算法、粒子群算法、人工鱼群算法，等等。-In addition to the ant colony algorithm, can be used in the intelligent algorithm of PID parameter optimization and there are many, such as genetic algorithm, simulated annealing algorithm, particle swarm optimization (pso), artificial fish algorithm, and so on.
Platform: |
Size: 1024 |
Author: 昊轩 |
Hits:
Description: 用来解决函数优化的混和算法，可以下载作为算法的对比和参考-Hybrid algorithm to solve function optimization, you can download as comparison and reference of the algorithm
Platform: |
Size: 5120 |
Author: qiao shi |
Hits:
Description: 蚁群算法是一种新型的模拟进化算法，鉴于目前国内尚缺乏这一方面的研究，其研究刚刚开始，远未像遗传算法、模拟退火算法等算法那样行程系统的分析方法和坚实的数学基础，有许多问题有待进一步研究，如算法的收敛性、理论依据等更多细致的工作还有待于进一步展开。(The ant colony algorithm is a novel simulated evolutionary algorithm, given the current lack of the research on this aspect, the research has just started, not like genetic algorithm, simulated annealing algorithm analysis algorithm that travel system and a solid mathematical foundation, there are many problems to be further studied, such as the convergence, the theoretical basis of more detailed work needs to be further expanded.)
Platform: |
Size: 184320 |
Author: lyhing |
Hits: