Welcome![Sign In][Sign Up]
Location:
Search - implementation of ant colony optimization

Search list

[MPImmas

Description: 采用C++语言编写最大最小蚁群优化算法程序,解决问题-using C language largest smallest ant colony optimization algorithm to solve problems
Platform: | Size: 5120 | Author: | Hits:

[JSP/Javajava-aco-tsp

Description: Java implementation of Ant Colony Optimization (ACO) for Travel Sales Man (TSP) problem
Platform: | Size: 6144 | Author: murix | Hits:

[AI-NN-PRACO.ZIP

Description: ACO algorythm. This software package provides an implementation of various Ant Colony Optimization (ACO) algorithms applied to the symmetric Traveling Salesman Problem (TSP). The ACO algorithms implemented are Ant System, Elitist Ant System, MAX-MIN Ant System, Rank-based version of Ant System, Best-Worst Ant System, and Ant Colony System.
Platform: | Size: 34816 | Author: Aco17 | Hits:

[matlabaco

Description: Contour Correspondence via Ant Colony Optimization Oliver van Kaick <ovankaic@cs.sfu.ca> http://www.cs.sfu.ca/~ovankaic/personal/ This MATLAB implementation computes a correspondence between two shapes based on ant colony optimization (ACO). The input shapes can be either two 2D contours (open or closed) or two arbitrary sets of 2D points.-Contour Correspondence via Ant Colony Optimization Oliver van Kaick <ovankaic@cs.sfu.ca> http://www.cs.sfu.ca/~ovankaic/personal/ This MATLAB implementation computes a correspondence between two shapes based on ant colony optimization (ACO). The input shapes can be either two 2D contours (open or closed) or two arbitrary sets of 2D points.
Platform: | Size: 38912 | Author: Haxpes | Hits:

[matlabACOUCP

Description: 无约束连续函数优化的人工蚁群算法通用MATLAB源码 此源码是对人工蚁群算法的一种实现,用于无约束连续函数的优化求解,对于含有约束的情况,可以先使用罚函数等方法,把问题处理成无约束的模型,再使用本源码进行求解 -Unconstrained optimization of continuous function of artificial ant colony algorithm for general-purpose MATLAB source code。 This source code is an implementation of artificial ant colony algorithm for unconstrained optimization of continuous function to solve for the case containing the constraints, you can first use the penalty function and other methods to deal with the problem into the unconstrained model, then use the origin codes solving
Platform: | Size: 2048 | Author: 孙准 | Hits:

[Algorithmaco-v1.1

Description: This MATLAB implementation computes a correspondence between two shapes based on ant colony optimization (ACO). The input shapes can be either two 2D contours (open or closed) or two arbitrary sets of 2D points.
Platform: | Size: 38912 | Author: cheikh | Hits:

[MPIACO

Description: 蚁群算法源代码,无须修改便可以直接编译执行-Ant colony algorithm source code, no need to change the implementation can be directly translated
Platform: | Size: 178176 | Author: | Hits:

[JSP/Javamyra

Description: Myra is a cross-platform Ant Colony Optimization framework written in Java. It provides a specialised data mining layer to support the application of ACO to classification problems, including the implementation of Ant-Miner and cAnt-Miner algorithms. The latter is an extension of Ant-Miner, which is able to cope with continuous attributes directly - i.e. cAnt-Miner does not requires a discretization method in a preprocessing step.
Platform: | Size: 229376 | Author: juksa | Hits:

[AI-NN-PRACOUCP

Description: 此源码是对人工蚁群算法的一种实现,用于无约束连续函数的优化求解,对于含有约束的情况,可以先使用罚函数等方法,把问题处理成无约束的模型,再使用本源码进行求解,-This source code is an implementation of artificial ant colony algorithm for unconstrained optimization of continuous function to solve for the case containing the constraints, you can first use the penalty function and other methods to deal with the problem into a non-binding model, and then use the source code is solved,
Platform: | Size: 2048 | Author: 张望 | Hits:

[matlabMCMProjects

Description: 我备战2010数学建模美赛所精心准备的算法资料,一共13个算法。应该说是目前比较全的算法集了。每个算法由一个VC6例子实现,来解决一个问题。其中一些是自己编写,其它的也是由网上找到后经过修改编译通过的。比赛结果还不错,一个M,现在把资料共享出来,希望对大家有所帮助,算法主要有模拟退火,遗传算法,蒙特卡罗算法,蚁群算法,粒子群算法,元胞自动机,Dijkstra,最小生成树算法,二分图最大匹配算法,最大流算法,动态规划算法,分支定界法,排队论算法,决策论算法等,我写了个说明文件,列的挺详细的-I am preparing for 2010 U.S. race mathematical modeling algorithms are well-prepared data, a total of 13 algorithms. It should be said is a relatively wide set of algorithms. Each algorithm implementation from a VC6 example, to solve a problem. Some of which I have written, the other is modified by the web, compiled by the post. Results also good, a M, is now sharing the information out, we want to help, mainly simulated annealing algorithm, genetic algorithm, Monte Carlo algorithm, ant colony algorithm, particle swarm optimization, cellular automata, Dijkstra, minimum spanning tree algorithm, the maximum bipartite matching algorithm, maximum flow algorithm, dynamic programming, branch and bound method, queuing theory algorithms, decision theory algorithm, I wrote a documentation out very detailed
Platform: | Size: 1355776 | Author: 一招鲜 | Hits:

[AI-NN-PRUnconstrainedoptimizationofcontinuousfunctionofart

Description: 此源码是对人工蚁群算法的一种实现,用于无约束连续函数的优化求解,对于含有约束的情况,可以先使用罚函数等方法,把问题处理成无约束的模型,再使用本源码进行求解。-This source code is an implementation of artificial ant colony algorithm for unconstrained continuous function optimization, with constraints for the case, you can start using the penalty function and other methods to deal with the problem into the unconstrained model, then use the source code solved.
Platform: | Size: 12288 | Author: ly | Hits:

[matlabaco-v1.1

Description: This MATLAB implementation computes a correspondence between two shapes based on ant colony optimization (ACO). The input shapes can be either two 2D contours (open or closed) or two arbitrary sets of 2D points. The algorithm is described in detail in:
Platform: | Size: 37888 | Author: harish | Hits:

[AlgorithmANT.CPP

Description: C++ Implementation of Ant Colony Optimization Program.This uses a Cost matrix to Calculate the Shortest path from a number of Cities.
Platform: | Size: 2048 | Author: Prasenjit Nag | Hits:

[AI-NN-PRantc

Description: 其主要内容包括蚁群算法的思想起源、研究现状及机制原理;蚁群算法的复杂度分析;蚁群算法的收敛性证明;蚁群算法参数对其性能的影响;蚁群算法的参数选择原则;离散域和连续域蚁群算法的若干改进策略;蚁群算法在多个优化领域的典型应用;蚁群算法的硬件实现技术;蚁群算法与其它仿生优化算法的比较与融合;蚁群算法的研究展望;最后还在附录部分给出了基本蚁群算法的程序源代码和相关网站。.-Its main contents include the origin of ant colony algorithm idea, principle and mechanism of Research the complexity analysis of ant colony algorithm prove the convergence of ant colony algorithm ant colony algorithm parameters on its performance the principle of ant colony algorithm parameters discrete domain and continuous domain of a number of ant colony algorithm improvement strategies ant colony optimization algorithm is typical in many applications ACO hardware implementation technology ant colony optimization algorithm and other bionic comparison and integration ant colony algorithm research prospects final appendix also shows the basic ant colony algorithm source code and related sites. .
Platform: | Size: 4096 | Author: ma | Hits:

[AI-NN-PRant

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:

[AI-NN-PRant_VB

Description: 用基本的蚁群优化算法解决TSP问题,蚁群优化算法是解决常见的组合问题的常见的启发式方法-This software package provides an implementation of various Ant Colony Optimization (ACO) algorithms applied to the symmetric Traveling Salesman Problem (TSP).
Platform: | Size: 21504 | Author: 王伟 | Hits:

[Program docHWO_ACO

Description: A new kind of ant colony optimization (ACO) algorithm is proposed that is suitable for an implementation in hardware.
Platform: | Size: 301056 | Author: JYOTI RANJAN | Hits:

[matlabACO-for-TSP

Description: a ant colony optimization(aco) for traveling salesman problem(TSP).implementation in matlab.type of file:m file
Platform: | Size: 4096 | Author: taha | Hits:

[Other蚁群算法

Description: 蚁群算法是一种用来寻找优化路径的概率型算法。它由Marco Dorigo于1992年在他的博士论文中提出,其灵感来源于蚂蚁在寻找食物过程中发现路径的行为。 这种算法具有分布计算、信息正反馈和启发式搜索的特征,本质上是进化算法中的一种启发式全局优化算法。蚁群算法的matlab实现(Ant colony algorithm is a probabilistic algorithm for finding optimal paths. It was put forward by Marco Dorigo in his doctoral dissertation in 1992, which is inspired by the behavior of ants in finding food in the process of finding food. This algorithm has the characteristics of distributed computing, positive feedback and heuristic search. In essence, it is a heuristic global optimization algorithm in evolutionary algorithm. Matlab implementation of ant colony algorithm)
Platform: | Size: 8192 | Author: 那拍拍 | Hits:

[Mathimatics-Numerical algorithms蚁群优化算法原理及Matlab编程实现

Description: 蚁群优化算法原理及其在旅行商问题中的应用的Matlab代码。(Principle of ant colony optimization algorithm and implementation of Matlab programming)
Platform: | Size: 342016 | Author: XIAOXIAGEGE | Hits:
« 12 »

CodeBus www.codebus.net