搜索资源列表
aco
- 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 the
ACO
- ACO.zip是一个蚁群优化算法，希望对大家有帮助-ACO.zip is an ant colony optimization algorithm, in the hope that we have to help
pso
- 自编的多目标粒子群优化算法，可以运行哦。-Written and directed the multi-objective particle swarm optimization, you can run, oh.
ACO-TSP
- 利用蚁群算法解决旅行商问题，其中运用智能蚂蚁算法-Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem
aco
- Ant colony optimization algorithm
simulatedannealing
- 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
ACO
- this paper introduce ant clony optimization
aco
- 蚁群算法实现tsp问题的解，适合初学者使用-Ant colony optimization tsp solution of the problem, for beginners
ACO
- Ant Colony Optimization
Ant-Colony-Optimization-(ACO)-applied-to-the-symm
- Ant Colony Optimization (ACO) applied to the symmetric TSP
Image-Edge-Detection-Using-ACO
- Image Edge Detection Using Ant Colony Optimization
aco system
- aco ant colony optimization of colonie de fourmis
ACO-PID
- 此函数实现蚁群算法，用于PID控制参数优化-The function realization of ant colony algorithm for PID parameters optimization
aco
- 基于蚁群算法matlab无功优化 可以参考-Ant colony algorithm matlab Reactive Power Optimization
ACO
- 基于蚁群算法的机器人的路径规划问题蚁群算法，一种与传统的数学规划原理截然不同的，模拟自然生态系统以求解复杂优化问题(如NPC(NP Complete)类问题，典型的有TSP(Traveling Saleman Problem)问题)的仿生优化算法，因其较强分布式计算机制、鲁棒性、易于与其他方法相结合等优点，使得蚁群算法具有较广泛应用领域，为那些最优化技术难以解决的组合优化问题提供了一类新的切实可行的解决方案。从最初的一维的静态优化问题扩展到多维的动态组合优化问题，包括车辆路径规划，工程设计，电力
ACO
- Ant Colony Algorithm for Non Constraint Optimization Problem
ACO-PID
- 除了蚁群算法，可用于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 s
Solve TSP using Ant Colony Optimization
- Solve Travelling Salesman Problem Using Ant Colony Optimization
ACO
- matlab code Ant colony optimization for solve Travelling salesman problem
aco
- In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. This algorithm is a member of the a