An improved quantum genetic algorithm for stochastic flexible scheduling problem with breakdown

Authors:
Jinwei Gu;Cuiwen Cao;Bin Jiao;Xingsheng Gu
Affiliations:
East China University of Science and Technology, ShangHai, China;East China University of Science and Technology, ShangHai, China;Shanghai Dianji University, ShangHai, China;East China University of Science and Technology, ShangHai, China
Venue:
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Year:
2009

Citing 2
Cited 0

A Cooperative Coevolutionary Approach to Function Optimization

PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A stochastic flexible scheduling problem subject to random breakdowns is studied in this paper, which objective is to minimize the expected value of makespan. We consider a preemptive-resume model of breakdown. The processing times, breakdown intervals and repair times are random variables subjected to independent normal distributions. An expanding method inspired by paper [1] is devised through predicting expected breakdown time of machines. Based on some concepts of quantum evolution, an Improved Quantum Genetic Algorithm (IQGA) is proposed, which is tested on a sampling problem compared with Cooperative Co-evolutionary Genetic Algorithm (CCGA) and Genetic Algorithm (GA). Experiment results show IQGA has better feasibility and effectiveness.