• 论文 •    

求解车间调度问题的一种新遗传退火混合策略

梁  旭,黄  明,常  征   

  1. 1.大连交通大学 电气信息学院,辽宁 大连  116028;2.山东理工大学 物理学院,山东 淄博  255013
  • 出版日期:2005-06-15 发布日期:2005-06-25

New genetic annealing hybrid strategy for job-shop scheduling problem

LIANG Xu, HUANG Ming, CHANG Zheng   

  1. 1.Sch. of Electrical Eng., Dalian Jiaotong Univ., Dalian  116028, China; 2.Sch. of Physics, Shandong Univ. of Tech., Zibo  255013, China
  • Online:2005-06-15 Published:2005-06-25

摘要: 综合了遗传算法和模拟退火算法的优点,提出了一种新的遗传退火混合优化策略。该算法引入模拟退火算法作为遗传算法种群的变异算子,增强和补充了遗传算法的进化能力,同时将机器学习原理引入混合算法中,增加了种群的平均适值,有效地避免了最优解的丢失,加快了进化速度,使系统能够在很短的时间内得到最优解。针对车间调度的典型问题进行了仿真,结果证明了新算法的有效性。

关键词: 机器学习, 遗传算法, 模拟退火算法, 混合策略

Abstract: Combining advantages of Genetic Algorithm (GA) with Simulated Annealing (SA)algorithm, a new genetic annealing hybrid strategy, Modified Genetic Algorithm and Simulated Annealing(MGASA), was proposed. SA was regarded as the variation operator of GA population, which improved the local search ability and evolution. At the same time, the theory of machine-learning was introduced to MGASA, and so the average fitness of chromosomes was improved, the loss of the best solution was prevented and the speed of the evolution was increased. Then, the best solution could be obtained earlier. The simulation results of classic job-shop scheduling problems indicated the effectiveness of MGASA.

Key words: achine-learning, genetic algorithm, simulated annealing algorithm, hybrid strategy

中图分类号: