{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T16:14:26Z","timestamp":1779380066152,"version":"3.53.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,2,9]],"date-time":"2012-02-09T00:00:00Z","timestamp":1328745600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10479-012-1078-5","type":"journal-article","created":{"date-parts":[[2012,2,8]],"date-time":"2012-02-08T15:56:06Z","timestamp":1328716566000},"page":"325-339","source":"Crossref","is-referenced-by-count":53,"title":["Solving the post enrolment course timetabling problem by ant colony optimization"],"prefix":"10.1007","volume":"194","author":[{"given":"Clemens","family":"Nothegger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alfred","family":"Mayer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andreas","family":"Chwatal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,2,9]]},"reference":[{"key":"1078_CR1","first-page":"1","volume":"16","author":"D. Abramson","year":"1999","unstructured":"Abramson, D., Krishnamoorthy, M., & Dang, H. (1999). Simulated annealing cooling schedules for the school timetabling problem. Asia-Pacific Journal of Operational Research, 16, 1\u201322.","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"2","key":"1078_CR2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.2298\/YJOR0302139B","volume":"13","author":"E. K. Burke","year":"2003","unstructured":"Burke, E. K., Bykov, Y., Newall, J., & Petrovic, S. (2003). A time-predefined approach to course timetabling. Yugoslav Journal of Operational Research, 13(2), 139\u2013151.","journal-title":"Yugoslav Journal of Operational Research"},{"issue":"2","key":"1078_CR3","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/S0377-2217(02)00069-3","volume":"140","author":"E. K. Burke","year":"2002","unstructured":"Burke, E. K., & Petrovic, S. (2002). Recent research directions in automated timetabling. European Journal of Operational Research, 140(2), 266\u2013280.","journal-title":"European Journal of Operational Research"},{"key":"1078_CR4","unstructured":"Cambazard, H., Hebrard, E., O\u2019Sullivan, B., & Papadopoulos, A. (2010). Local search and constraint programming for the post enrolment-based course timetabling problem. Annals of Operations Research, 1\u201325."},{"issue":"5","key":"1078_CR5","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10951-006-8495-8","volume":"9","author":"M. Chiarandini","year":"2006","unstructured":"Chiarandini, M., Birattari, M., Socha, K., & Rossi-Doria, O. (2006). An effective hybrid algorithm for university course timetabling. Journal of Scheduling, 9(5), 403\u2013432.","journal-title":"Journal of Scheduling"},{"key":"1078_CR6","volume-title":"Proceedings of the 7th international conference on the practice and theory of automated timetabling (PATAT 2008)","author":"M. Chiarandini","year":"2008","unstructured":"Chiarandini, M., Fawcett, C., & Hoos, H. H. (2008). A modular multiphase heuristic solver for post enrolment course timetabling. In Proceedings of the 7th international conference on the practice and theory of automated timetabling (PATAT 2008)."},{"key":"1078_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","volume-title":"Ant colony optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., & St\u00fctzle, T. (2004). Ant colony optimization. Cambridge: MIT Press."},{"key":"1078_CR8","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1007\/978-3-540-45157-0_17","volume-title":"Proc. of the 4th int. conf. on the practice and theory of automated timetabling (PATAT-2002)","author":"L. D. Gaspero","year":"2003","unstructured":"Gaspero, L. D., & Schaerf, A. (2003). Multi-neighbourhood local search with application to course timetabling. In Lecture notes in computer science: Vol.\u00a02740. Proc. of the 4th int. conf. on the practice and theory of automated timetabling (PATAT-2002) (pp.\u00a0262\u2013275). Berlin: Springer."},{"key":"1078_CR9","first-page":"449","volume-title":"Computer science and operations research: new developments in their interfaces","author":"F. Glover","year":"1992","unstructured":"Glover, F. (1992). New ejection chain and alternating path methods for traveling salesman problems. In Computer science and operations research: new developments in their interfaces (pp.\u00a0449\u2013509)."},{"key":"1078_CR10","unstructured":"ITC2007 (2007). http:\/\/www.cs.qub.ac.uk\/itc2007\/ Second international timetabling competition."},{"key":"1078_CR11","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/11593577_7","volume-title":"Practice and theory of automated timetabling\u00a0V","author":"P. Kostuch","year":"2005","unstructured":"Kostuch, P. (2005). The university course timetabling problem with a three-phase approach. In E. Burke, & M. Trick (Eds.), Lecture notes in computer science: Vol.\u00a03616. Practice and theory of automated timetabling\u00a0V (pp.\u00a0109\u2013125). Berlin: Springer."},{"key":"1078_CR12","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s00291-007-0097-0","volume":"30","author":"R. Lewis","year":"2008","unstructured":"Lewis, R. (2008). A survey of metaheuristic-based techniques for university timetabling problems. OR-Spektrum, 30, 167\u2013190.","journal-title":"OR-Spektrum"},{"key":"1078_CR13","unstructured":"Lewis, R. (2010). A time-dependent metaheuristic algorithm for post enrolment-based course timetabling. Annals of Operations Research, 1\u201317."},{"key":"1078_CR14","volume-title":"Proceedings of the 7th international conference on the practice and theory of automated timetabling (PATAT 2008)","author":"A. Mayer","year":"2008","unstructured":"Mayer, A., Nothegger, C., Chwatal, A., & Raidl, G. (2008). Solving the post enrolment course timetabling problem by ant colony optimization. In Proceedings of the 7th international conference on the practice and theory of automated timetabling (PATAT 2008)."},{"key":"1078_CR15","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1287\/ijoc.1090.0320","volume":"22","author":"B. McCollum","year":"2010","unstructured":"McCollum, B., Schaerf, A., Paechter, B., McMullan, P., Lewis, R., Parkes, A. J., Gaspero, L. D., Qu, R., & Burke, E. K. (2010). Setting the research agenda in automated timetabling: the second international timetabling competition. INFORMS Journal on Computing, 22, 120\u2013130.","journal-title":"INFORMS Journal on Computing"},{"key":"1078_CR16","unstructured":"MirHassani, S., & Habibi, F. (2011). Solution approaches to the course timetabling problem. Artificial Intelligence Review, 1\u201317."},{"key":"1078_CR17","unstructured":"Rossi-Doria, O., & Paechter, B. (2003). An hyperheuristic approach to course timetabling problem using an evolutionary algorithm. Technical Report CC-00970503, Napier University, Edinburgh, Scotland."},{"key":"1078_CR18","first-page":"56","volume-title":"Combinatorial optimisation 2004, Book of abstracts","author":"O. Rossi-Doria","year":"2004","unstructured":"Rossi-Doria, O., & Paechter, B. (2004). A memetic algorithm for university course timetabling. In Combinatorial optimisation 2004, Book of abstracts (p.\u00a056)."},{"key":"1078_CR19","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/978-3-540-45157-0_22","volume-title":"Practice and theory of automated timetabling IV","author":"O. Rossi-Doria","year":"2003","unstructured":"Rossi-Doria, O., Sampels, M., Birattari, M., Chiarandini, M., Dorigo, M., Gambardella, L., Knowles, J., Manfrin, M., Mastrolilli, M., Paechter, B., Paquete, L., & St\u00fctzle, T. (2003). A comparison of the performance of different metaheuristics on the timetabling problem. In E. Burke, & P.\u00a0De Causmaecker (Eds.), Lecture notes in computer science: Vol.\u00a02740. Practice and theory of automated timetabling IV (pp.\u00a0329\u2013351). Berlin: Springer."},{"issue":"2","key":"1078_CR20","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A. Schaerf","year":"1999","unstructured":"Schaerf, A. (1999). A survey of automated timetabling. Artificial Intelligence Review, 13(2), 87\u2013127.","journal-title":"Artificial Intelligence Review"},{"key":"1078_CR21","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-45724-0_1","volume-title":"Proceedings of the 3rd international workshop on ant algorithms, ANTS 2002","author":"K. Socha","year":"2002","unstructured":"Socha, K., Knowles, J., & Sampels, M. (2002). A Max-Min ant system for the university timetabling problem. In M. Dorigo, G. Di Caro, & M. Sampels (Eds.), Lecture notes in computer science: Vol.\u00a02463. Proceedings of the 3rd international workshop on ant algorithms, ANTS 2002 (pp.\u00a01\u201313). Berlin: Springer."},{"key":"1078_CR22","series-title":"Lecture notes in computer science","volume-title":"Proceedings of EvoCOP 2003\u20143rd European workshop on evolutionary computation in combinatorial optimization","author":"K. Socha","year":"2003","unstructured":"Socha, K., Sampels, M., & Manfrin, M. (2003). Ant algorithms for the university course timetabling problem with regard to the state-of-the-art. In J.\u00a0Gottlieb, & G.\u00a0Raidl (Eds.), Lecture notes in computer science: Vol.\u00a02611. Proceedings of EvoCOP 2003\u20143rd European workshop on evolutionary computation in combinatorial optimization. Berlin: Springer."},{"key":"1078_CR23","unstructured":"TTComp2002 (2002). http:\/\/www.idsia.ch\/Files\/ttcomp2002\/ First international timetabling competition (2002)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1078-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1078-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1078-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:33Z","timestamp":1559153373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1078-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,9]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["1078"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1078-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,9]]}}}