{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:31:49Z","timestamp":1743071509576,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319226880"},{"type":"electronic","value":"9783319226897"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22689-7_21","type":"book-chapter","created":{"date-parts":[[2015,8,31]],"date-time":"2015-08-31T08:25:49Z","timestamp":1441009549000},"page":"285-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Arbitrary Heuristic Room Matching Algorithm in Obtaining an Enhanced Initial Seed for the University Course Timetabling Problem"],"prefix":"10.1007","author":[{"given":"Teoh Chong","family":"Keat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Habibollah","family":"Haron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoni","family":"Wibowo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohd.","family":"Salihin Ngadiman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,1]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.ins.2011.12.018","volume":"191","author":"S Abdullah","year":"2012","unstructured":"Abdullah, S., Turabieh, H.: On the use of multi neighbourhood structures within a Tabu-based memetic approach to university timetabling problems. Inf. Sci. 191, 146\u2013168 (2012)","journal-title":"Inf. Sci."},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"7234","DOI":"10.1016\/j.eswa.2008.09.020","volume":"36","author":"LE Agust\u00edn-Blas","year":"2009","unstructured":"Agust\u00edn-Blas, L.E., Salcedo-Sanz, S., Ortiz-Garc\u00eda, E.G., Portilla-Figueras, A., P\u00e9rez-Bellido, \u00c1.M.: A hybrid grouping genetic algorithm for assigning students to preferred laboratory groups. Expert Syst. Appl. 36, 7234\u20137241 (2009)","journal-title":"Expert Syst. Appl."},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/S0377-2217(01)00091-1","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. Eur. J. Oper. Res. 137, 512\u2013523 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Aycan, E., Ayav, T.: Solving the course scheduling problem using simulated annealing. In: 2009 IEEE International Advance Computing Conference (IACC), pp. 6\u20137 (2009)","DOI":"10.1109\/IADCC.2009.4809055"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/3-540-61794-9_50","volume-title":"Practice and Theory of Automated Timetabling","author":"VA Bardadym","year":"1996","unstructured":"Bardadym, V.A.: Practice and theory of automated timetabling. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 22\u201325. Springer, Heidelberg (1996)"},{"key":"21_CR6","unstructured":"Brownlee, J.: Clever Algorithms. Nature-Inspired Programming Recipes, Lulu Enterprises, pp. 401\u2013402 (2011)"},{"key":"21_CR7","unstructured":"Burke, E.K., Elliman, D.G., Weare, R.F.: A hybrid genetic algorithm for highly constrained timetabling problems. In: Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 605\u2013610 (1995)"},{"key":"21_CR8","unstructured":"Caldeira, J.P., Rosa, A.C.: School timetabling using genetic search. In: Proceedings of the 2nd International Conference on the Practice and Theory of Automated Timetabling, Toronto, pp. 115\u2013122 (1997)"},{"issue":"5","key":"21_CR9","doi-asserted-by":"publisher","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.: An effective hybrid algorithm for university course timetabling. J. Sched. 9(5), 403\u2013432 (2006)","journal-title":"J. Sched."},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/978-3-540-88636-5_64","volume-title":"MICAI 2008: Advances in Artificial Intelligence","author":"J Frausto-Sol\u00eds","year":"2008","unstructured":"Frausto-Sol\u00eds, J., Alonso-Pecina, F., Mora-Vargas, J.: An efficient simulated annealing algorithm for feasible solutions of course timetabling. In: Gelbukh, A., Morales, E.F. (eds.) MICAI 2008. LNCS (LNAI), vol. 5317, pp. 675\u2013685. Springer, Heidelberg (2008)"},{"key":"21_CR11","unstructured":"Gaspero, L., Di Mccollum, B., Schaerf, A.: The Second International Timetabling Competition (ITC-2007): Curriculum-Based Course Timetabling (Track 3), pp. 1\u201312 (2007)"},{"issue":"7\u20138","key":"21_CR12","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1016\/j.mcm.2007.03.012","volume":"46","author":"NA Ismayilova","year":"2007","unstructured":"Ismayilova, N.A., Sa\u011fir, M., Gasimov, R.N.: A multiobjective faculty\u2013course\u2013time slot assignment problem with preferences. Math. Comput. Model. 46(7\u20138), 1017\u20131029 (2007)","journal-title":"Math. Comput. Model."},{"key":"21_CR13","unstructured":"Jain, A., Jain, S., Chande, P.K.: Formulation of genetic algorithm to generate good quality course timetable 1(3), 248\u2013251 (2010)"},{"issue":"2","key":"21_CR14","first-page":"446","volume":"9","author":"M Kohshori","year":"2012","unstructured":"Kohshori, M., Abadeh, M.: Hybrid genetic algorithms for university course timetabling. Int. J. Comput. Sci. 9(2), 446\u2013455 (2012)","journal-title":"Int. J. Comput. Sci."},{"issue":"1","key":"21_CR15","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.ejor.2008.12.007","volume":"200","author":"Z L\u00fc","year":"2010","unstructured":"L\u00fc, Z., Hao, J.K.: Adaptive Tabu search for course timetabling. Eur. J. Oper. Res. 200(1), 235\u2013244 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Lutuksin, T., Pongcharoen, P.: Best-worst ant colony system parameter investigation by using experimental design and analysis for course timetabling problem. In: 2010 Second International Conference on Computer and Network Technology, pp. 467\u2013471 (2010)","DOI":"10.1109\/ICCNT.2010.24"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Qarouni-Fard, D., Najafi-Ardabili, A., Moeinzadeh, M.-H.: Finding feasible timetables with particle swarm optimization. In: 4th International Conference on Innovations in Information Technology, IIT 2007, pp. 387\u2013391 (2007)","DOI":"10.1109\/IIT.2007.4430422"},{"issue":"1","key":"21_CR18","first-page":"38","volume":"16","author":"M Rizam","year":"2008","unstructured":"Rizam, M., Bakar, A.: Selecting quality initial random seed for metaheuristic approaches : a case of timetabling problem. Int. J. Comput. Internet Manage. 16(1), 38\u201345 (2008)","journal-title":"Int. J. Comput. Internet Manage."},{"key":"21_CR19","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., et al.: A comparison of the performance of different metaheuristics on the timetabling problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 329\u2013351. Springer, Heidelberg (2003)"},{"issue":"1","key":"21_CR20","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.eswa.2010.06.051","volume":"38","author":"DF Shiau","year":"2011","unstructured":"Shiau, D.F.: A hybrid particle swarm optimization for a university course scheduling problem with flexible preferences. Expert Syst. Appl. 38(1), 235\u2013248 (2011)","journal-title":"Expert Syst. Appl."},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-13232-2_28","volume-title":"Artifical Intelligence and Soft Computing","author":"S Suyanto","year":"2010","unstructured":"Suyanto, S.: An informed genetic algorithm for university course and student timetabling problems. In: Rutkowski, L., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2010, Part II. LNCS, vol. 6114, pp. 229\u2013236. Springer, Heidelberg (2010)"},{"issue":"5","key":"21_CR22","doi-asserted-by":"publisher","first-page":"6029","DOI":"10.1016\/j.eswa.2011.12.013","volume":"39","author":"IX Tassopoulos","year":"2012","unstructured":"Tassopoulos, I.X., Beligiannis, G.N.: Solving effectively the school timetabling problem using particle swarm optimization. Expert Syst. Appl. 39(5), 6029\u20136040 (2012)","journal-title":"Expert Syst. Appl."},{"key":"21_CR23","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.ijpe.2013.04.026","volume":"149","author":"T Thepphakorn","year":"2009","unstructured":"Thepphakorn, T., Hicks, C., Pongcharoen, P.: An ant colony based timetabling tool. Int. J. Prod. Econ. 149, 131\u2013144 (2009)","journal-title":"Int. J. Prod. Econ."},{"issue":"3","key":"21_CR24","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1016\/j.ejor.2009.09.014","volume":"203","author":"D Zhang","year":"2010","unstructured":"Zhang, D., Liu, Y., M\u2019Hallah, R., Leung, S.C.H.H.: A Simulated Annealing with a new neighborhood structure based algorithm for high school timetabling problems. Eur. J. Oper. Res. 203(3), 550\u2013558 (2010)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Communications in Computer and Information Science","Intelligent Software Methodologies, Tools and Techniques"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22689-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T06:22:20Z","timestamp":1676960540000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22689-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319226880","9783319226897"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22689-7_21","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"1 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}