搜索资源列表
PSO-for-TSP-of-51-city
- 为本人毕业设计里，粒子群算法的一个应用，求解51个城市的TSP问题，城市的个数和位置都可以改动，并与遗传算法求解的结果进行对比!-I graduated from the design, the application of the particle swarm algorithm for solving the 51 cities TSP problem, the number and location of the city can be altered, and compared with
ycsf
- matlab 遗传算法GA，粒子群算法PSO,蚁群算法AS 前段时间上智能计算方法实验课上，自己做的程序。帖到这里，希望有人能改进它们，交流经验这样更有价值。 遗传算法解决最小生成树问题，PURFER编码。 粒子群算法做无约束最优化问题。 蚁群算法解决TSP问题。 -matlab genetic algorithm GA, particle swarm optimization PSO, some time ago on the ant colony algorithm intelligent
tsp
- 粒子群算法求tsp问题，能得到很好的解，可以供初学者使用-Particle swarm algorithm for tsp problem, get a good solution, you can use for beginners
tsp_pso
- 基于JAVA语言，使用粒子群算法求解旅行商(TSP)问题(Using particle swarm optimization (pso) algorithm to solve the traveling salesman problem)
chapter14基于粒子群算法的PID控制器优化设计
- chapter15基于混合粒子群算法的TSP搜索算法(A TSP Search Algorithm Based on Hybrid Particle Swarm Optimization)
descente locale
- discrete particle swarm algorithm (Discrete PSO) C language source code. Incidental use of a D-PSO solve the traveling salesman problem (TSP) code can be used as a reference when the Demo
tabou
- discrete particle swarm algorithm (Discrete PSO) C language source code. Incidental use of a D-PSO solve the traveling salesman problem (TSP) code can be used as a reference when
recuit_simule
- discrete particle swarm algorithm (Discrete PSO) C language source code. Incidental use of a D-PSO solve the traveling salesman problem (TSP) code can be used as a
TSP-PSO
- 混合粒子群算法摒弃了传统粒子群算法中的通过跟踪极值来更新粒子位置的方法，而是引入了遗传算法中的交叉和变异操作，通过粒子同个体极值和群体极值的交叉以及粒子自身变异的方式来搜索最优解。(Hybrid particle swarm algorithm instead of the traditional particle swarm algorithm in the method to update the position of the particle by tracking the maximu
Balanced fuzzy particle swarm optimization
- matlab code for tsp using pso
混合粒子群算法原始
- 采用混合粒子群算法求解tsp问题MATLAB仿真(Hybrid particle swarm optimization (PSO) algorithm for MATLAB simulation of TSP problem)
避障
- 采用粒子群算法解决tsp问题，其中避障部分采用蚁群算法，找出每两个城市之间的避障路径 空间：三维(The particle swarm optimization (PSO) algorithm is used to solve the TSP problem, in which the obstacle avoidance part uses ant colony algorithm to find out the obstacle avoidance path between every t
code
- 基于蚁群算法的 TSP 求解，分别采用蚁群算法和蚁群算法-粒子群混合算法进行优化求解，使用不同的交叉和变异适应度函数更新粒子，从而实现 TSP问题的优化求解，更加逼近实际问题。(Based on the TSP solution of ant colony algorithm, ant colony algorithm and hybrid algorithm of ant colony algorithm particle swarm optimization are used to solv