{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:59:46Z","timestamp":1761807586388},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642176210"},{"type":"electronic","value":"9783642176227"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17622-7_17","type":"book-chapter","created":{"date-parts":[[2010,11,24]],"date-time":"2010-11-24T03:00:06Z","timestamp":1290567606000},"page":"167-176","source":"Crossref","is-referenced-by-count":11,"title":["An Elitist-Ant System for Solving the Post-Enrolment Course Timetabling Problem"],"prefix":"10.1007","author":[{"given":"Ghaith M.","family":"Jaradat","sequence":"first","affiliation":[]},{"given":"Masri","family":"Ayob","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Operations Research\/Computer Science Interfaces Series","volume-title":"Metaheuristics: Progress in complex systems optimization","author":"S. Abdullah","year":"2007","unstructured":"Abdullah, S., Burke, E.K., McCollum, B.: Using a randomised iterative improvement algorithm with composite neighbourhood structures for university course timetabling. In: Metaheuristics: Progress in complex systems optimization. Operations Research\/Computer Science Interfaces Series, vol.\u00a0ch. 8, Springer, Heidelberg (2007a)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Abdullah, S., Burke, E.K., McCollum, B.: A hybrid evolutionary approach to the university course timetabling problem. In: IEEE Congres on Evolutionary Computation, Singapore, September 25-28, pp. 1764\u20131768 (2007b) ISBN: 1-4244-1340-0","DOI":"10.1109\/CEC.2007.4424686"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-642-02962-2_63","volume-title":"Rough Sets and Knowledge Technology","author":"S. Abdullah","year":"2009","unstructured":"Abdullah, S., Turabeih, H., McCollum, B.: Electromagnetism-like mechanism with force decay rate great deluge for CTP. In: Wen, P., Li, Y., Polkowski, L., Yao, Y., Tsumoto, S., Wang, G. (eds.) RSKT 2009. LNCS, vol.\u00a05589, pp. 497\u2013504. Springer, Heidelberg (2009)"},{"issue":"2002","key":"17_CR4","first-page":"512","volume":"137","author":"R. Alvarez-Valdes","year":"2002","unstructured":"Alvarez-Valdes, R., Crespo, E., Tamarit, J.M.: Design and implementation of a course scheduling system using Tabu Search. The Proceedings of the Production, Manufactoring and Logistics: European Journal of Operational Research\u00a0137(2002), 512\u2013523 (2002)","journal-title":"The Proceedings of the Production, Manufactoring and Logistics: European Journal of Operational Research"},{"key":"17_CR5","series-title":"LNCS (LNAI)","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-12842-4_9","volume-title":"Artificial Intelligence: Theories, Models and Applications","author":"A.M. Bernardino","year":"2010","unstructured":"Bernardino, A.M., Bernardino, E.M., Sanchez-Perez, J.M., Gomez-Pulido, J.A., Vega-Rodriguez, M.A.: A Hybrid Ant Colony Optimization Algorithm for Solving the Ring Arc-Loading Problem. In: Konstantopoulos, S., Perantonis, S., Karkaletsis, V., Spyropoulos, C.D., Vouros, G. (eds.) SETN 2010. LNCS (LNAI), vol.\u00a06040, pp. 49\u201359. Springer, Heidelberg (2010)"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-78295-7_1","volume-title":"Hybrid Metaheuristics: An Emerging Approach to Optimization, SCI","author":"C. Blum","year":"2008","unstructured":"Blum, C., Roli, A.: Hybrid Metaheuristics: An Introduction, Studies in Computational Intelligence. In: C. Blum, M.J.B. Aguilera, A. Roli, M. Samples (Eds.), Hybrid Metaheuristics: An Emerging Approach to Optimization, SCI, vol. 114, Springer-Verlag Berlin, Heidelberg, pp. 1-30, (2008)"},{"key":"17_CR7","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: An autocatalytic optimization process, Technical Report 91-016 revised, Dipartimento di Elettronica e Informazione, Policecnico di Milano, Italy (1991)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Ejaz, N., Javed, M.: An Approach for Course Scheduling Inspired by Die-Hard Co-Operative Ant Behavior. In: Proceedings of the IEEE International Conference on Automation and Logistics, Jinan, China, August 18 - 21 (2007)","DOI":"10.1109\/ICAL.2007.4339114"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/978-3-540-77345-0_23","volume-title":"PATAT 2008","author":"M. Eley","year":"2007","unstructured":"Eley, M.: Ant Algorithms for the Exam Timetabling Problem. In: Burke, E.D., Rudova, H. (eds.) PATAT 2007. LNCS, vol.\u00a03867, pp. 364\u2013382. Springer, Heidelberg (2007)"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the Complexity of Timetable and Multi commodity Flow Problem. SIAM J. Comput.\u00a05, 691\u2013703 (1976)","journal-title":"SIAM J. Comput."},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1057\/palgrave.jors.2600676","volume":"50","author":"L.M. Gambardella","year":"1999","unstructured":"Gambardella, L.M., Taillard, E.D., Dorigo, M.: Ant Colonies for the quadratic assignment problem. Journal of the Operational Research Society\u00a050, 167\u2013176 (1999)","journal-title":"Journal of the Operational Research Society"},{"key":"17_CR12","unstructured":"Mayer, A., Nothegger, C., Chawatal, A., Raidl, G.: Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization. In: The Proceeding of the 7thInternational Conference on the Practice and Theory of Automated Timetabling (PATAT 2008), Montreal, Canada (2008)"},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1142\/S1469026803000938","volume":"3","author":"J. Montgomery","year":"2003","unstructured":"Montgomery, J., Randall, M.: The accumulated experience ant colony for the travelling salesman problem. International Journal of Computational Intelligence and Applications\u00a03(2), 189\u2013198 (2003)","journal-title":"International Journal of Computational Intelligence and Applications"},{"key":"17_CR14","volume-title":"Handbook of Scheduling: Algorithms, Models and Performance Analysis","author":"S. Petrovic","year":"2004","unstructured":"Petrovic, S., Burke, E.K.: University timetabling. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models and Performance Analysis, ch. 45, CRC Press, Boca Raton (2004)"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.ejor.2008.10.001","volume":"198","author":"R. Qu","year":"2009","unstructured":"Qu, R., Burke, E.D., McCollum, B.: Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring. Discrete Optimization, European Journal of Operational Research\u00a0198, 392\u2013404 (2009)","journal-title":"Discrete Optimization, European Journal of Operational Research"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., Samples, M., Birattari, M., Chiarandini, M., Dorigo, M., Gambardella, L.M., Knowels, J., Manfrin, M., Mastrolilli, M., Paechter, B., Paquete, L., Stultzle, T.: A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 329\u2013354. Springer, Heidelberg (2003)"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45724-0_1","volume-title":"Ant Algorithms","author":"K. Socha","year":"2002","unstructured":"Socha, K., Knowles, J., Samples, M.: A max-min ant system for the university course timetabling problem. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol.\u00a02463, pp. 1\u201313. Springer, Heidelberg (2002)"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/3-540-36605-9_31","volume-title":"Applications of Evolutionary Computing","author":"K. Socha","year":"2003","unstructured":"Socha, K., Samples, M., Manfrin, M.: Ant algorithms for the university course timetabling problem with regard to the state-of-the-art. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB\/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol.\u00a02611, pp. 334\u2013345. Springer, Heidelberg (2003)"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-45105-6_5","volume-title":"Genetic and Evolutionary Computation - GECCO 2003","author":"K. Socha","year":"2003","unstructured":"Socha, K.: The Influence of Run-Time Limits on Choosing Ant System Parameters. In: Cantu-Paz, E., et al. (eds.) GECCO 2003. LNCS, vol.\u00a02723, pp. 49\u201360. Springer, Heidelberg (2003)"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Yang, S., Jat, S.N.: Genetic Algorithms with Guided and Local Search Strategies for University Course Timetabling. IEEE Transactions on Systems, Man, and Cybernetics\u2014Part C: Applications and Reviews, 1\u201314 (2010), doi:10.1109\/TSMCC.2010.2049200","DOI":"10.1109\/TSMCC.2010.2049200"}],"container-title":["Communications in Computer and Information Science","Database Theory and Application, Bio-Science and Bio-Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17622-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T06:45:00Z","timestamp":1553237100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17622-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642176210","9783642176227"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17622-7_17","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2010]]}}}