A Quantum-Inspired Genetic Algorithm for Scheduling Problems
- Cite this paper as:
- Wang L., Wu H., Zheng D. (2005) A Quantum-Inspired Genetic Algorithm for Scheduling Problems. In: Wang L., Chen K., Ong Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg
This paper is the first to propose a quantum-inspired genetic algorithm (QGA) for permutation flow shop scheduling problem to minimize the maximum completion time (makespan). In the QGA, Q-bit based representation is employed for exploration in discrete 0-1 hyperspace by using updating operator of quantum gate as well as genetic operators of Q-bit. Meanwhile, the Q-bit representation is converted to random key representation, which is then transferred to job permutation for objective evaluation. Simulation results and comparisons based on benchmarks demonstrate the effectiveness of the QGA, whose searching quality is much better than that of the famous NEH heuristic.
Unable to display preview. Download preview PDF.