文件名称:ant-colony-optimization-algorithm
介绍说明--下载内容来自于网络,使用问题请自行百度
建立了带约束条件的物流配送问题的数学模型,运用蚁群算法解决物流配送路径
优化问题,并将遗传算法的复制、交叉、变异等遗传算子引入蚁群算法,同时改进信息素的
更新方式、客户点选择策略,以提高算法的收敛速度和全局搜索能力。经过多次实验和计算 ,证明了用改进的蚁群算法优化物流配送线路,可以有效而快速地求得问题的最优解或近似最
优解。-A mathematical model with the constraints of logistics and distribution issues, the use of ant colony algorithm to solve the problem of logistics distribution route optimization, replication and genetic algorithms, crossover and mutation genetic operators to introduce ant colony algorithm, while improving the way pheromone update customer point selection strategy to improve the convergence speed and global search capability. After several experiments and calculations prove that the optimal solution with improved ant colony algorithm to optimize logistics and distribution lines, can effectively and quickly determined the problem or near optimal solution.
优化问题,并将遗传算法的复制、交叉、变异等遗传算子引入蚁群算法,同时改进信息素的
更新方式、客户点选择策略,以提高算法的收敛速度和全局搜索能力。经过多次实验和计算 ,证明了用改进的蚁群算法优化物流配送线路,可以有效而快速地求得问题的最优解或近似最
优解。-A mathematical model with the constraints of logistics and distribution issues, the use of ant colony algorithm to solve the problem of logistics distribution route optimization, replication and genetic algorithms, crossover and mutation genetic operators to introduce ant colony algorithm, while improving the way pheromone update customer point selection strategy to improve the convergence speed and global search capability. After several experiments and calculations prove that the optimal solution with improved ant colony algorithm to optimize logistics and distribution lines, can effectively and quickly determined the problem or near optimal solution.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
02_算法实现部分源代码/
02_算法实现部分源代码/Ant.cpp
02_算法实现部分源代码/Ant.h
02_算法实现部分源代码/Common.cpp
02_算法实现部分源代码/common.h
02_算法实现部分源代码/TSP.cpp
02_算法实现部分源代码/TSP.h
02_算法实现部分源代码/Ant.cpp
02_算法实现部分源代码/Ant.h
02_算法实现部分源代码/Common.cpp
02_算法实现部分源代码/common.h
02_算法实现部分源代码/TSP.cpp
02_算法实现部分源代码/TSP.h
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.