欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
反序-杂交算子在求解TSP时容易陷入局部最优。为了优化电路板布局,提高计算快速性,对反序-杂交算子进行了改进,设计了1st-Inver-over算子和2nd-Inver-over算子。采用1st-Inver-over算子和2nd-Inver-over算子作为主要免疫基因操作算子实现了求解TSP的免疫克隆算法,在算法前期,只采用1st-Inver-over算子来保证算法的收敛速度,在算法后期,根据种群的多样性自适应的选取1st-Inver-over算子和2nd-Inver-over算子来协调算法的收敛速度和种群的多样性。仿真结果表明,Inver-over ICSA比经典的GT算法具有更好的收敛性和搜索效率。
英文摘要：
In order to solve the problems that Inver-over operator for TSP is easy to trap in local optima,two improved Inver-over operators—1st-Inver-over operator and 2nd-Inver-overoperator are purposed.Using two improved Inver-over operators as the immune genic operators,a immune clonal selection algorithm for TSP is implemented.In the prior period of the Inver-over ICSA,in order to guarantee the convergence rate of the population,the algorithm only use 1st-Inver-over operator.In the later period of the Inver-over ICSA,in order to coordinate the convergence rate and the diversity of the population,the algorithm chooses 1st-Inver-over operator or 2nd-Inver-over operator self-adaptively based on of the diversity of the population.The experiments results show that the Inver-over ICSA is improved a lot on the convergence rate and efficiency compared with the classic GT algorithm.
同期刊论文项目
同项目期刊论文
A hybrid particle swarm optimization and tabu search algorithm for flexible job-shop scheduling prob
A novel hybrid evolutionary algorithm for the integrated model of collaborative planning and schedul
A hybrid Pareto-based local search algorithm for multi-objective flexible job shop scheduling proble
A novel hybrid harmony search algorithm for the no-wait flow shop scheduling problems with total flo
Memetic Algorithm based on Improved Inver-over operator and Lin-Kernighan local search for the Eucli
An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with inte
期刊信息
位置：