Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 37, Issue 5, Pages 927-937Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2009.07.002
Keywords
Stochastic; Job shop scheduling; Competitive; Co-evolution algorithm; Genetic algorithm
Categories
Funding
- National Natural Science Foundation of China [60774078]
- Shanghai Commission of Science and Technology [08JC1408200]
- Shanghai Leading Academic Discipline Project [B504]
- Doctor Foundation of Ministry of Education of China [200802510010]
- China Postdoctotal Science Foundation [20080430080]
- National High Technology Research and Development Program of China (863 Program) [2009AA04Z141]
Ask authors/readers for more resources
In this paper, a novel competitive co-evolutionary quantum genetic algorithm (CCQGA) is proposed for a stochastic job shop scheduling problem (SJSSP) with the objective to minimize the expected value of makespan. Three new strategies named as competitive hunter. cooperative surviving and the big fish eating small fish are developed in population growth process. Based on improved co-evolution idea of multi-population and concepts of quantum theory, this algorithm could not only adjust population size dynamically to increase the diversity of genes and avoid premature convergence, but also accelerate the convergence speed with Q-bit representation and quantum rotation gate. FT benchmark-based problems where the processing times are subjected to independent normal distributions are solved effectively by CCQGA. The experiment results achieved by CCQGA are compared with quantum-inspired genetic algorithm (QGA) and standard genetic algorithm (GA), which shows that CCQGA has better feasibility and effectiveness. (C) 2009 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available