{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T01:47:32Z","timestamp":1783648052713,"version":"3.55.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,11,17]],"date-time":"2017-11-17T00:00:00Z","timestamp":1510876800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s00500-017-2886-y","type":"journal-article","created":{"date-parts":[[2017,11,17]],"date-time":"2017-11-17T05:08:10Z","timestamp":1510895290000},"page":"1511-1523","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A memetic algorithm based on MOEA\/D for the examination timetabling problem"],"prefix":"10.1007","volume":"22","author":[{"given":"Yu","family":"Lei","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiao","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhen","family":"Yan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,11,17]]},"reference":[{"key":"2886_CR1","doi-asserted-by":"crossref","unstructured":"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\u2013353","DOI":"10.1007\/11593577_19"},{"issue":"1","key":"2886_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/4235.752921","volume":"3","author":"EK Burke","year":"1999","unstructured":"Burke EK, Newall JP (1999) A multi-stage evolutionary algorithm for the timetable problem. IEEE Trans Evol Comput 3(1):63\u201374","journal-title":"IEEE Trans Evol Comput"},{"key":"2886_CR3","unstructured":"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\u2013312"},{"key":"2886_CR4","doi-asserted-by":"crossref","unstructured":"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\u201385","DOI":"10.1007\/3-540-60469-3_26"},{"key":"2886_CR5","doi-asserted-by":"crossref","unstructured":"Burke EK, Elliman DG, Ford PH, Weare RF (1996a) Examination timetabling in British universities\u2014a 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\u201390","DOI":"10.1007\/3-540-61794-9_52"},{"key":"2886_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013250","DOI":"10.1007\/3-540-61794-9_63"},{"issue":"2","key":"2886_CR7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1287\/opre.34.2.193","volume":"34","author":"MW Carter","year":"1986","unstructured":"Carter MW (1986) A survey of practical applications of examination timetabling algorithms. Oper Res 34(2):193\u2013202","journal-title":"Oper Res"},{"issue":"3","key":"2886_CR8","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1057\/jors.1996.37","volume":"47","author":"MW Carter","year":"1996","unstructured":"Carter MW, Laporte G, Lee SY (1996) Examination timetabling: algorithmic strategies and applications. J Oper Res Soc 47(3):373\u2013383","journal-title":"J Oper Res Soc"},{"key":"2886_CR9","doi-asserted-by":"crossref","unstructured":"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\u20131951","DOI":"10.1109\/CEC.2002.1004541"},{"key":"2886_CR10","doi-asserted-by":"crossref","unstructured":"Cheong CY, Tan KC, Veeravalli B (2007) Solving the exam timetabling problem via a multi-objective evolutionary algorithm\u2014a more general approach. In: Proceedings of the 2007. IEEE symposium on computational intelligence in scheduling, CISched 2007, Honolulu, HI, USA, pp. 165\u2013172","DOI":"10.1109\/SCIS.2007.367685"},{"key":"2886_CR11","unstructured":"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\u2013186"},{"key":"2886_CR12","unstructured":"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\u20133168"},{"key":"2886_CR13","unstructured":"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\u2013168"},{"issue":"4","key":"2886_CR14","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S Even","year":"1976","unstructured":"Even S, Itai A, Shamir A (1976) On the complexity of timetable and multicommodity flow problems. SIAM J Comput 5(4):691\u2013703","journal-title":"SIAM J Comput"},{"issue":"6","key":"2886_CR15","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1109\/TEVC.2013.2293776","volume":"18","author":"K Li","year":"2014","unstructured":"Li K, Zhang Q, Kwong S, Li M, Wang R (2014) Stable matching-based selection in evolutionary multiobjective optimization. IEEE Trans Evol Comput 18(6):909\u2013923","journal-title":"IEEE Trans Evol Comput"},{"key":"2886_CR16","doi-asserted-by":"crossref","unstructured":"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\u2013231","DOI":"10.1007\/978-3-540-45157-0_14"},{"key":"2886_CR17","unstructured":"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\u2013186"},{"key":"2886_CR18","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10951-008-0077-5","volume":"12","author":"R Qu","year":"2009","unstructured":"Qu R, Burke EK, McCollum B, Merlot LTG, Lee SY (2009) A survey of search methodologies and automated system development for examination timetabling. J Sched 12:55\u201389","journal-title":"J Sched"},{"key":"2886_CR19","first-page":"755","volume-title":"Genetic algorithms and timetabling","author":"P Ross","year":"2003","unstructured":"Ross P, Hart E, Corne D (2003) Genetic algorithms and timetabling. Theory and applications. Advances in evolutionary computing. Springer, New York, pp 755\u2013771"},{"key":"2886_CR20","doi-asserted-by":"crossref","unstructured":"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\u20131206","DOI":"10.1109\/CEC.1999.782572"},{"key":"2886_CR21","doi-asserted-by":"crossref","unstructured":"Wong T, C\u00f4t\u00e9 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\u20131501","DOI":"10.1109\/CEC.2004.1331073"},{"key":"2886_CR22","doi-asserted-by":"crossref","unstructured":"Wu M, Kwong S, Zhang Q, Li K, Wang R, Liu B (2015) Two-Level Stable Matching-Based Selection in MOEA\/D. In:\u2019 2015 IEEE international conference on systems, man, and cybernetics, Kowloon, pp 1720\u20131725","DOI":"10.1109\/SMC.2015.302"},{"key":"2886_CR23","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1109\/TEVC.2017.2656922","volume":"21","author":"M Wu","year":"2017","unstructured":"Wu M, Li K, Kwong S, Zhang Q, Zhou Y, Zhang Q (2017) Adaptive two-level matching based selection for decomposition multi-objective optimization. IEEE Trans Evol Comput 21:554\u2013568","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"2886_CR24","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) Moea\/d: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"key":"2886_CR25","doi-asserted-by":"crossref","unstructured":"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\u2013572","DOI":"10.1007\/978-3-319-15892-1_38"},{"key":"2886_CR26","doi-asserted-by":"crossref","unstructured":"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\u201312","DOI":"10.1109\/TCYB.2016.2585745"},{"key":"2886_CR27","doi-asserted-by":"crossref","unstructured":"Zhou Y, Kwong S, Zhang Q, Wu M (2016) Adaptive patch-based sparsity estimation for image via MOEA\/D. IEEE congress on evolutionary computation","DOI":"10.1109\/CEC.2016.7744110"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-017-2886-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2886-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2886-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,6]],"date-time":"2019-10-06T08:07:21Z","timestamp":1570349241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-017-2886-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,17]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["2886"],"URL":"https:\/\/doi.org\/10.1007\/s00500-017-2886-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,17]]}}}