{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:54:48Z","timestamp":1743008088165,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031285394"},{"type":"electronic","value":"9783031285400"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-28540-0_13","type":"book-chapter","created":{"date-parts":[[2023,3,17]],"date-time":"2023-03-17T14:03:08Z","timestamp":1679061788000},"page":"160-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Artificial Orca Algorithm for\u00a0Solving University Course Timetabling Issue"],"prefix":"10.1007","author":[{"given":"Abdelhamid","family":"Rahali","sequence":"first","affiliation":[]},{"given":"KamelEddine","family":"Heraguemi","sequence":"additional","affiliation":[]},{"given":"Samir","family":"Akhrouf","sequence":"additional","affiliation":[]},{"given":"Mouhamed","family":"Benouis","sequence":"additional","affiliation":[]},{"given":"Brahim","family":"Bouderah","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,18]]},"reference":[{"issue":"3","key":"13_CR1","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.: Discrete optimization 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."},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s11750-015-0366-z","volume":"23","author":"A Bettinelli","year":"2015","unstructured":"Bettinelli, A., Cacchiani, V., Roberti, R., Toth, P.: An overview of curriculum-based course timetabling. TOP 23(2), 313\u2013349 (2015). https:\/\/doi.org\/10.1007\/s11750-015-0366-z","journal-title":"TOP"},{"key":"13_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113943","volume":"165","author":"JS Tan","year":"2021","unstructured":"Tan, J.S., Goh, S.L., Kendall, G., Sabar, N.R.: A survey of the state-of-the-art of optimisation methodologies in school timetabling problems. Exp. Syst. Appl. 165, 113943 (2021)","journal-title":"Exp. Syst. Appl."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Tan, J.S., Goh, S.L., Sura, S., Kendall, G., Sabar, N.R.: Hybrid particle swarm optimization with particle elimination for the high school timetabling problem. Evol. Intell. 1\u201316 (2020)","DOI":"10.1007\/s12065-020-00473-x"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Habashi, S.S., Salama, C., Yousef, A.H., Fahmy, H.M.: Adaptive diversifying hyper-heuristic based approach for timetabling problems. In: 2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON), pp. 259\u2013266 (2018)","DOI":"10.1109\/IEMCON.2018.8615035"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0038-0121(76)90008-2","volume":"10","author":"JA Breslaw","year":"1976","unstructured":"Breslaw, J.A.: A linear programming solution to the faculty assignment problem. Soc.-Econ. Plan. Sci. 10, 227\u2013230 (1976)","journal-title":"Soc.-Econ. Plan. Sci."},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/S0377-2217(96)00082-3","volume":"101","author":"TH Hultberg","year":"1997","unstructured":"Hultberg, T.H., Cardoso, D.M.: The teacher assignment problem: a special case of the fixed charge transportation problem. Eur. J. Oper. Res. 101, 463\u2013473 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR8","unstructured":"Abdullah, S., Turabieh, H., McCollum, B., Burke, E.K.: An investigation of a genetic algorithm and sequential local search approach for curriculum-based course timetabling problems. In: Proceedings of the Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2009), pp. 10\u201312, Dublin, Ireland (2009)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.ejor.2008.12.007","volume":"200","author":"Z Lu","year":"2010","unstructured":"Lu, Z., Hao, J.K.: Adaptive Tabu search for course timetabling. Eur. J. Oper. Res. 200, 235\u2013244 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s10489-020-01833-x","volume":"51","author":"A Rezaeipanah","year":"2020","unstructured":"Rezaeipanah, A., Matoori, S.S., Ahmadi, G.: A hybrid algorithm for the university course timetabling problem using the improved parallel genetic algorithm and local search. Appl. Intell. 51(1), 467\u2013492 (2020). https:\/\/doi.org\/10.1007\/s10489-020-01833-x","journal-title":"Appl. Intell."},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00291-007-0097-0","volume":"30","author":"R Lewis","year":"2008","unstructured":"Lewis, R.: A survey of metaheuristic-based techniques for university timetabling problems. OR Spectr. 30(1), 167\u2013190 (2008). https:\/\/doi.org\/10.1007\/s00291-007-0097-0","journal-title":"OR Spectr."},{"issue":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10479-016-2151-2","volume":"252","author":"A Kiefer","year":"2016","unstructured":"Kiefer, A., Hartl, R.F., Schnell, A.: Adaptive large neighborhood search for the curriculum-based course timetabling problem. Ann. Oper. Res. 252(2), 255\u2013282 (2016). https:\/\/doi.org\/10.1007\/s10479-016-2151-2","journal-title":"Ann. Oper. Res."},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cor.2017.09.014","volume":"90","author":"Y Nagata","year":"2018","unstructured":"Nagata, Y.: Random partial neighborhood search for the post enrollment course timetabling problem. Comput. Oper. Res. 90, 84\u201396 (2018)","journal-title":"Comput. Oper. Res."},{"issue":"7","key":"13_CR14","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1016\/j.cor.2011.09.014","volume":"39","author":"S Ceschia","year":"2012","unstructured":"Ceschia, S., Di Gaspero, L., Schaerf, A.: Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timeta-bling problem. Comput. Oper. Res. 39(7), 1615\u20131624 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10479-010-0696-z","volume":"194","author":"R Lewis","year":"2010","unstructured":"Lewis, R.: A time-dependent metaheuristic algorithm for post enrolment based course timetabling. Ann. Oper. Res. 194(1), 273\u2013289 (2010)","journal-title":"Ann. Oper. Res."},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1016\/j.procs.2018.08.024","volume":"126","author":"M Assi","year":"2018","unstructured":"Assi, M., Halawi, B., Haraty, R.A.: Genetic algorithm analysis using the graph coloring method for solving the university timetable problem. Proc. Comput. Sci. 126, 899\u2013906 (2018)","journal-title":"Proc. Comput. Sci."},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Harada, T., Alba., E.: Parallel genetic algorithms: a useful survey. ACM Comput. Surv. (CSUR) 53(4), 1\u201339 (2020)","DOI":"10.1145\/3400031"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Badoni, R.P., Gupta, D.K.: A new algorithm based on students groupings for university course timetabling problem. In: 2015 2nd International Conference on Recent Advances in Engineering & Computational Sciences (RAECS), pp. 1\u20135. IEEE (2015)","DOI":"10.1109\/RAECS.2015.7453340"},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10479-012-1078-5","volume":"194","author":"C Nothegger","year":"2012","unstructured":"Nothegger, C., Mayer, A., Chwatal, A., Raidl, G.R.: Solving the post enrolment course timetabling problem by ant colony optimization. Ann. Oper. Res. 194(1), 325\u2013339 (2012)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"13_CR20","doi-asserted-by":"publisher","first-page":"227","DOI":"10.3390\/a6020227","volume":"6","author":"RM Chen","year":"2013","unstructured":"Chen, R.M., Shih, H.F.: Solving university course timetabling problems using constriction particle swarm optimization with local search. Algorithms 6(2), 227\u2013244 (2013)","journal-title":"Algorithms"},{"key":"13_CR21","first-page":"201","volume":"49","author":"D Werra","year":"1985","unstructured":"Werra, D.: Graphs, hypergraphs and timetabling. Methods Oper. Res. 49, 201\u2013213 (1985)","journal-title":"Methods Oper. Res."},{"key":"13_CR22","unstructured":"Burke, E.K., Kingston, J., De Werra, D.: 5.6: Applications to timetabling. Handb. Graph Theory 445, 4 (2004)"},{"issue":"2","key":"13_CR23","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1080\/10556781003664739","volume":"26","author":"Y Liu","year":"2011","unstructured":"Liu, Y., Zhang, D., Chin, F.Y.: A clique-based algorithm for constructing feasible timetables. Optim. Methods Softw. 26(2), 281\u2013294 (2011)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"13_CR24","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10951-018-0582-0","volume":"22","author":"NCF Bagger","year":"2019","unstructured":"Bagger, N.C.F., Desaulniers, G., Desrosiers, J.: Daily course pattern formulation and valid inequalities for the curriculum based course timetabling problem. J. Sched. 22(2), 155\u2013172 (2019)","journal-title":"J. Sched."},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1016\/j.procs.2019.11.169","volume":"161","author":"A Muklason","year":"2019","unstructured":"Muklason, A., Irianti, R.G., Marom, A.: Automated course timeta-bling optimization using tabu-variable neighborhood search based hyper-heuristic algorithm. Proc. Comput. Sci. 161, 656\u2013664 (2019)","journal-title":"Proc. Comput. Sci."},{"issue":"4","key":"13_CR26","first-page":"1638","volume":"2","author":"SM Shatnawi","year":"2012","unstructured":"Shatnawi, S.M., Albalooshi, F., Rababa\u2019h, K.: Generating timetable and students schedule based on data mining techniques. Int. J. Eng. Res. Appl. 2(4), 1638\u20131644 (2012)","journal-title":"Int. J. Eng. Res. Appl."},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Sze, S.N., Bong, C.L., Chiew, K.L., Tiong, W.K., Bolhassan, N.A.: Case study: university lecture timetabling without pre-registration data. In: Proceedings of the 2017 IEEE International Conference on Applied System Innovation: Applied System Innovation for Modern Technology, ICASI 2017, pp. 732\u2013735 (2017)","DOI":"10.1109\/ICASI.2017.7988533"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Matias, J.B., Fajardo, A.C., Medina, R.P.: A hybrid genetic algorithm for course scheduling and teaching workload management. In: 2018 IEEE 10th International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment and Management, HNICEM 2018, pp. 1\u20136 (2019)","DOI":"10.1109\/HNICEM.2018.8666332"},{"issue":"2","key":"13_CR29","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1016\/j.ejor.2019.11.024","volume":"283","author":"A G\u00fclc\u00fc","year":"2020","unstructured":"G\u00fclc\u00fc, A., Akkan, C.: Robust university course timetabling problem subject to single and multiple disruptions. Eur. J. Oper. Res. 283(2), 630\u2013646 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR30","doi-asserted-by":"publisher","unstructured":"Bendimerad L.S., Drias, H.: An artificial orca algorithm for continuous problems. In: Abraham, A., Hanne, T., Castillo, O., Gandhi, N., Nogueira Rios, T., Hong, T.-P. (eds.) HIS 2020. AISC, vol. 1375, pp. 700\u2013709. Springer, Cham (2021).https:\/\/doi.org\/10.1007\/978-3-030-73050-568","DOI":"10.1007\/978-3-030-73050-568"},{"key":"13_CR31","doi-asserted-by":"crossref","unstructured":"Sylejmani, K., Gashi, E., Ymeri, A.: Simulated annealing with penalization for university course timetabling. J. Sched. 1-21 (2022)","DOI":"10.1007\/s10951-022-00747-5"}],"container-title":["Communications in Computer and Information Science","Artificial Intelligence: Theories and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-28540-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,17]],"date-time":"2023-03-17T14:12:37Z","timestamp":1679062357000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-28540-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031285394","9783031285400"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-28540-0_13","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAITA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Intelligence: Theories and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mascara","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Algeria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaita2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.univ-mascara.dz\/icaita22","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}