Solving Job-Shop Scheduling Problem by an Improved Genetic Algorithm

Article Preview

Abstract:

An improved genetic algorithm is proposed by introducing selection operation and crossover operation, which overcomes the limitations of the traditional genetic algorithm, avoids the local optimum, improves its convergence rate and the diversity of population, and solves the problems of population prematurity and slow convergence rate in the basic genetic algorithm. Simulation results show that compared with other improved genetic algorithms, the proposed algorithm is better in finding global optimal and convergent rate.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

588-591

Citation:

Online since:

November 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Wang Ling, Job shop scheduling and genetic algorithms, Tsinghua University Press, Beijing, 2003.

Google Scholar

[2] Xuan Guang-nan, Cheng Run-Wei, Genetic algorithms and engineering optimization, Tsinghua University Press. Beijing, 2003.

Google Scholar

[3] Shi Rui-feng, Zhou Hong, ShangGuan Chui-Xia, A Hybrid Multi-objective Genetic Algorithm and Its Applications to Job Shop Problem, J. Computer Engineering And Applications, 2005, 41(30):1-5.

Google Scholar

[4] Tao Ze, Xie Li-yang, Hao Chang-zhong, Liang Di, Study on JSP Based on Hybrid-Genetic Algorithm, J. Computer Engineering And Applications, 2005, 41(18).

Google Scholar

[5] Ko Myung-Sook, Kang Tae-Won, Hwang Chong-sun, Function optimization using an adaptive crossover operator based on locality, J. 1997, 10(06).

DOI: 10.1109/ijsis.1996.565046

Google Scholar

[6] Wang Bao-wen , Li Chun-ting , Liu Wen-yuan , Wang Ya-dong, Genetic algorithm for job shop scheduling based on work piect position crossover, J. Computer Engineering And Applications, 2007, 43(13).

Google Scholar