A memetic algorithm based on MOEA/D for the examination timetabling problem
- 176 Downloads
A memetic algorithm based on MOEA/D is presented to deal with the uncapacitated multiobjective examination timetabling problem in this paper. The examination timetabling problem is considered as a two-objective optimization problem in this paper, while it is modeled as a single-objective optimization problem generally. The framework of a multiobjective evolutionary algorithm with decomposition (MOEA/D) is first employed to guide the evolutionary process. Two special local search operators are designed to find better individuals. The proposed algorithm is tested on 11 benchmark examination timetabling instances. Experimental results prove that the proposed algorithm can produce a promising set of nondominated solutions for each examination timetabling instance.
KeywordsUncapacitated examination timetabling problem Multiobjective optimization MOEA/D Local search
This work is supported by the National Natural Science Foundation of China. (Grant Nos. 61603299 and 61602385) and China Postdoctoral Science Foundation (2017M613204).
Compliance with ethical standards
Conflict of interest
Yu Lei and Jiao Shi declare that they have no conflict of interest.
This article does not contain any studies with human participants or animals performed by any of the authors.
- Asmuni H, Burke EK, Garibaldi JM, McCollum B (2005) Fuzzy multiple heuristic orderings for examination timetabling. Lecture notes in computer science. In: Proceedings of the 5th international conference on the practice and theory of automated timetabling, vol 3616, pp 334–353Google Scholar
- Burke EK, Silva JD Landa (2004) The design of memetic algorithms for scheduling and timetabling problems. Recent advances in memetic algorithms and related search technologies. Studies in fuzziness and soft computing, pp 289–312Google Scholar
- Burke EK, Elliman DG, Ford PH, Weare RF (1995) Specialised recombinative operators for the timetabling problem. Lecture notes in computer science. Evolutionary computing. AISB workshop, vol 993, Sheffield, UK. Springer, Berlin, pp 75–85Google Scholar
- Burke EK, Elliman DG, Ford PH, Weare RF (1996a) Examination timetabling in British universities—a survey. Lecture notes in computer science. Proceedings of the 1st international conference on the practice and theory of automated timetabling, PATAT 1995, vol 1153, Edinburgh, Scotland, pp 76–90Google Scholar
- Burke EK, Newall JP, Weare RF (1996b) A memetic algorithm for university exam timetabling. Lecture notes in computer science. Proceedings of the 1st international conference on the practice and theory of automated timetabling, PATAT 1995, vol. 1153, Edinburgh, Scotland, pp 241–250Google Scholar
- Chan CK, Gooi HB, Lim MH (2002) Co-evolutionary algorithm approach to a university timetable system. In: Proceedings of the 2002 congress on evolutionary computation, CEC 2002, vol 2, Honolulu, HI, USA, pp 1946–1951Google Scholar
- Cheong CY, Tan KC, Veeravalli B (2007) Solving the exam timetabling problem via a multi-objective evolutionary algorithm—a more general approach. In: Proceedings of the 2007. IEEE symposium on computational intelligence in scheduling, CISched 2007, Honolulu, HI, USA, pp. 165–172Google Scholar
- Christine LM (2007) An order based evolutionary approach to dual objective examination timetabling. In: Proceedings of the 2007 IEEE symposium on computational intelligence in scheduling, pp 179–186Google Scholar
- Corne D, Ross P, Fang H (1996) Evolutionary timetabling: Practice, prospects and work in progress. In: Proceedings of UK planning and scheduling SIG workshop strathclyde, vol 7, pp 3164–3168Google Scholar
- Cote P, Wong T, Sabouri R (2005) Application of a hybrid multi-objective evolutionary algorithm to the uncapacitated exam proximity problem. Practice and theory of automated timetabling: selected papers from the 5th international conference. Springer Lecture Notes in Computer Science, vol 3616, pp 151–168Google Scholar
- Merlot LTG, Boland N, Hughes BD, Stuckey PJ (2003) A hybrid algorithm for the examination timetabling problem. Practice and theory of automated timetabling: selected papers from the 4th international conference. Lecture notes in computer science, Springer, Berlin, pp 207–231Google Scholar
- Moscato P, Norman MG (1992). A memetic approach for the travelling salesman problem implementation of a computational ecology for combinatorial optimization on message passing systems. In: Proceedings of the international conference on parallel computing and transporter applications, pp 177–186Google Scholar
- Ross P, Hart E, Corne D (2003) Genetic algorithms and timetabling. Theory and applications. Advances in evolutionary computing. Springer, New York, pp 755–771Google Scholar
- Terashima-Marin H, Ross P, Valenzuela-Rendon M (1999) Clique-based crossover for solving the timetabling problem with GAs. In: Proceedings of CEC 99 conference, pp 1200–1206Google Scholar
- Wong T, Côté P, Sabourin R (2004) A hybrid MOEA for the capacitated exam proximity problem. In: Proceedings of the 2004congress on evolutionary computation, CEC 2004, vol 2, Portland, OR, USA. pp 1495–1501Google Scholar
- Wu M, Kwong S, Zhang Q, Li K, Wang R, Liu B (2015) Two-Level Stable Matching-Based Selection in MOEA/D. In:’ 2015 IEEE international conference on systems, man, and cybernetics, Kowloon, pp 1720–1725Google Scholar
- Zhang X, Zhou Y, Zhang Q, Lee V, Li M (2015) Multiobjecitve optimization of barrier coverage with wireless sensors. In: Evolutionary multi-criterion optimization, pp 557–572Google Scholar
- Zhang X, Zhou Y, Zhang Q, Lee V, Li M (2016) Problem Specific MOEA/D for barrier coverage with wireless sensors. IEEE transactions on cybernetics, pp 1–12Google Scholar
- Zhou Y, Kwong S, Zhang Q, Wu M (2016) Adaptive patch-based sparsity estimation for image via MOEA/D. IEEE congress on evolutionary computationGoogle Scholar