This paper presents a novel quantum-inspired algorithm(QGA) for the heavily constrained university scheduling problems(CUSP). The CUSP is a common problem for all institutions of higher education. It has been proved a NP problems. We propose a solving of CUSP based on the use of quantum-inspired algorithms. In the QGA, Q-bits based representation is employed by updating operator of quantum gate which is introduced as a variation operator to drive the individuals toward better solutions. The experimental results show that a set of high quality timetables can be achieved.
展开▼
