[1]蔡良伟,张基宏.用自适应遗传算法求解一类组合调度优化问题[J].深圳大学学报理工版,2004,21(3):206-209.
 CAI Liang-wei and ZHANG Ji-hong.An adaptive genetic algorithm for solving a class of combinational scheduling problems[J].Journal of Shenzhen University Science and Engineering,2004,21(3):206-209.
点击复制

用自适应遗传算法求解一类组合调度优化问题()
分享到:

《深圳大学学报理工版》[ISSN:1000-2618/CN:44-1401/N]

卷:
第21卷
期数:
2004年3期
页码:
206-209
栏目:
光电与信息工程
出版日期:
2004-07-30

文章信息/Info

Title:
An adaptive genetic algorithm for solving a class of combinational scheduling problems
文章编号:
1000-2618(2004)03-0206-04
作者:
蔡良伟张基宏
深圳大学信息工程学院,深圳 518060
Author(s):
CAI Liang-wei and ZHANG Ji-hong
College of Information Engineering Shenzhen University, Shenzhen 518060, P. R. China
关键词:
Job Shop调度优化自适应遗传算法
Keywords:
Job Shop scheduling optimization adaptive genetic algorithm
分类号:
TN 18
文献标志码:
A
摘要:
针对Job Shop组合调度优化问题,提出一种改进的自适应遗传算法,该算法在经典遗传算法的基础上增加了重构和局部寻优操作,构造了新的交叉和变异算子,自适应地确定交叉和变异概率,提高了算法的搜索效率. 算例表明,该算法能有效求解Job Shop调度等组合优化问题.
Abstract:
An improved adaptive genetic algorithm is proposed to solve a class of combinational scheduling optimization problems Job Shop scheduling problems. In this algorithm, Reconstruction and Local-Search operations are developed, new crossover and mutation operators are constructed. The probabilities for crossover and mutation are determined adaptively. Computation example shows that this algorithm can solve Job Shop scheduling optimization problem and other combinational optimization problems effectively.
更新日期/Last Update: 2015-11-06