A Hybrid Genetic Annealing Algorithm for Job Shop Scheduling Problem

摘要：

A hybrid genetic algorithm is proposed to solve the Job Shop scheduling problem.Firstly,the hybrid genetic annealing algorithm is designed by analyzing the advantages and disadvantages of the genetic algorithm and simulated annealing algorithm.A new crossover operator and high performance coding method are defined to apply to the algorithm.Finally,the proposed algorithm is tested on different scale benchmarks.Examples show that,the result of this method is better than the genetic algorithm and the annealing algorithm in processing time.

关键词： genetic algorithm annealing algorithm coding method crossover operator

作者: Jianwei Ding Kunling Hu Juanjuan Niu

作者单位: Department of Computer Science and Technology Hua Yu College of Henan Agricultural University Shangq Henan Kaifeng Power Supply Company Kaifeng,China College of Computer and Information Engineering of Henan University in China

会议类型: 国际会议

会议名称: 2011 3rd International Conference on Computer and Network Technology(ICCNT 2011)(2011第三届IEEE计算机与网络技术国际会议)

会议地点: 太原

会议语种:英文

页码: 462-465

在线出版日期: 2011-02-26（万方平台首次上网日期，不代表论文的发表时间）