Location:
Search - heuristic n m
Search list
Description: 实现了蚁群算法求解TSP问题。注释详细
function[R_best,L_best,L_ave,Shortest_Route,Shortest_Length]=ACATSP(C,NC_max,m,Alpha,Beta,Rho,Q)
-------------------------------------------------------------------------
主要符号说明
C n个城市的坐标，n×2的矩阵
NC_max最大迭代次数
m蚂蚁个数
Alpha表征信息素重要程度的参数
Beta表征启发式因子重要程度的参数
Rho信息素蒸发系数
Q信息素增加强度系数
R_best各代最佳路线
L_best各代最佳路线的长度
=========================================================================
-Ant Colony Algorithm for the realization of the TSP problem. Notes the detailed function [R_best, L_best, L_ave, Shortest_Route, Shortest_Length] = ACATSP (C, NC_max, m, Alpha, Beta, Rho, Q) ------------------------------------------------------------------- The main symbol------ C n that cities coordinates, n × 2 matrix NC_max the largest number of iterations m the number of Alpha ant pheromones characterized the importance of the parameters Beta factor heuristic importance of characterization of the parameters Rho evaporation coefficient of pheromone pheromone Q increase in intensity coefficient R_best best route generations generations L_best the length of the best route ====== ================================================== =================
Platform: |
Size: 2048 |
Author: 王晶 |
Hits:
Description: C表示 n个城市的坐标，为n×2的矩阵
NC_max为最大迭代次数
m表示蚂蚁个数
Alpha 表征信息素重要程度的参数
Beta 表征启发式因子重要程度的参数
Rho 信息素蒸发系数
Q 信息素增加强度系数
R_best 各代最佳路线
L_best 各代最佳路线的长度-C indicated that the coordinates of n cities, in order to n × 2 matrix NC_max maximum number of iterations m, said the number of Alpha characterization of ant pheromones importance of the parameters of Beta characterization of the parameters of heuristic importance of Rho factor pheromone pheromone evaporation coefficient Q increase the strength factor R_best generations of the best route L_best the length of each generation of the best route
Platform: |
Size: 2048 |
Author: 沈龙 |
Hits:
Description: 最短路径实现的蚁群算法
主要符号说明
C n个城市的坐标，n×2的矩阵
NC_max 最大迭代次数
m 蚂蚁个数
Alpha 表征信息素重要程度的参数
Beta 表征启发式因子重要程度的参数
Rho 信息素蒸发系数
Q 信息素增加强度系数
R_best 各代最佳路线
L_best 各代最佳路线的长度-Ant colony algorithm to achieve the shortest path
Description of the main symbols
C n cities coordinates, n × 2 matrix
NC_max maximum number of iterations
m number of ants
Alpha pheromone characterization of the degree of importance of parameters
Beta factor of importance of the characterization parameters of the heuristic
Rho pheromone evaporation coefficient
Q factor pheromone to increase strength
R_best generations the best route
L_best the length of each generation the best route
Platform: |
Size: 8192 |
Author: 屈林 |
Hits:
Description: CDS(Campbell-Dudek-Simth)：是Johnson算法的扩展，被认为是好的具有鲁棒性的启发式算法。用于求解n-job，m-machine的流水作业调度问题；即n项作业都需要顺序进行m个工序，m个工序中，每道工序仅有一台机器，如何安排n项作业的加工先后关系。-CDS (Campbell-Dudek-Simth): an extension of the Johnson algorithm is considered robust heuristic algorithm is good. Used to solve the n-job, m-machine flowshop scheduling problem the n tasks require the order of m processes m a process, each process is just a machine, how to arrange the the n job processing has relationship .
Platform: |
Size: 1024 |
Author: 郁小芳 |
Hits: