Skip to main content
SpringerLink
Log in

Artificial Orca Algorithm for Solving University Course Timetabling Issue

  • Conference paper
  • First Online:
Artificial Intelligence: Theories and Applications (ICAITA 2022)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1769))

  • 297 Accesses

Abstract

Timetabling problem for university courses (UCTP) is one of most traditional challenges that have been emphasized for a long time by many researches. This issue belong to NP-Hard problems, which are hard to solved with classical algorithms due to their complexity. Swarm intelligence become a trend to solve NP-hard problems, and also solve real life issues. This paper proposes a new based Artificial Orca Algorithm (AOA) solver for university courses timetabling problem. In order to evaluate our proposal, A series of are carried out on Ghardaia University Timetabling data, the performance of the proposed approach are evaluated and compared with other algorithms developed to solve the same problem. The results show a clear superiority of our proposal against the other in terms of execution time and result quality.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Zhang, D., Liu, Y., M’Hallah, 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–558 (2010)

    Article  MATH  Google Scholar 

  2. Bettinelli, A., Cacchiani, V., Roberti, R., Toth, P.: An overview of curriculum-based course timetabling. TOP 23(2), 313–349 (2015). https://doi.org/10.1007/s11750-015-0366-z

    Article  MathSciNet  MATH  Google Scholar 

  3. 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)

    Article  Google Scholar 

  4. 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–16 (2020)

    Google Scholar 

  5. 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–266 (2018)

    Google Scholar 

  6. Breslaw, J.A.: A linear programming solution to the faculty assignment problem. Soc.-Econ. Plan. Sci. 10, 227–230 (1976)

    Article  Google Scholar 

  7. 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–473 (1997)

    Article  MATH  Google Scholar 

  8. 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–12, Dublin, Ireland (2009)

    Google Scholar 

  9. Lu, Z., Hao, J.K.: Adaptive Tabu search for course timetabling. Eur. J. Oper. Res. 200, 235–244 (2010)

    Article  MATH  Google Scholar 

  10. 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–492 (2020). https://doi.org/10.1007/s10489-020-01833-x

    Article  Google Scholar 

  11. Lewis, R.: A survey of metaheuristic-based techniques for university timetabling problems. OR Spectr. 30(1), 167–190 (2008). https://doi.org/10.1007/s00291-007-0097-0

    Article  MathSciNet  MATH  Google Scholar 

  12. Kiefer, A., Hartl, R.F., Schnell, A.: Adaptive large neighborhood search for the curriculum-based course timetabling problem. Ann. Oper. Res. 252(2), 255–282 (2016). https://doi.org/10.1007/s10479-016-2151-2

    Article  MathSciNet  MATH  Google Scholar 

  13. Nagata, Y.: Random partial neighborhood search for the post enrollment course timetabling problem. Comput. Oper. Res. 90, 84–96 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  14. 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–1624 (2012)

    Article  Google Scholar 

  15. Lewis, R.: A time-dependent metaheuristic algorithm for post enrolment based course timetabling. Ann. Oper. Res. 194(1), 273–289 (2010)

    Article  MATH  Google Scholar 

  16. 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–906 (2018)

    Article  Google Scholar 

  17. Harada, T., Alba., E.: Parallel genetic algorithms: a useful survey. ACM Comput. Surv. (CSUR) 53(4), 1–39 (2020)

    Google Scholar 

  18. 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–5. IEEE (2015)

    Google Scholar 

  19. 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–339 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  20. Chen, R.M., Shih, H.F.: Solving university course timetabling problems using constriction particle swarm optimization with local search. Algorithms 6(2), 227–244 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  21. Werra, D.: Graphs, hypergraphs and timetabling. Methods Oper. Res. 49, 201–213 (1985)

    MathSciNet  MATH  Google Scholar 

  22. Burke, E.K., Kingston, J., De Werra, D.: 5.6: Applications to timetabling. Handb. Graph Theory 445, 4 (2004)

    Google Scholar 

  23. Liu, Y., Zhang, D., Chin, F.Y.: A clique-based algorithm for constructing feasible timetables. Optim. Methods Softw. 26(2), 281–294 (2011)

    Article  MATH  Google Scholar 

  24. 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–172 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  25. 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–664 (2019)

    Article  Google Scholar 

  26. Shatnawi, S.M., Albalooshi, F., Rababa’h, K.: Generating timetable and students schedule based on data mining techniques. Int. J. Eng. Res. Appl. 2(4), 1638–1644 (2012)

    Google Scholar 

  27. 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–735 (2017)

    Google Scholar 

  28. 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–6 (2019)

    Google Scholar 

  29. Gülcü, A., Akkan, C.: Robust university course timetabling problem subject to single and multiple disruptions. Eur. J. Oper. Res. 283(2), 630–646 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  30. 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–709. Springer, Cham (2021).https://doi.org/10.1007/978-3-030-73050-568

  31. Sylejmani, K., Gashi, E., Ymeri, A.: Simulated annealing with penalization for university course timetabling. J. Sched. 1-21 (2022)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. M’Sila University, M’Sila, Algeria

    Abdelhamid Rahali, KamelEddine Heraguemi, Samir Akhrouf, Mouhamed Benouis & Brahim Bouderah

  2. Informatics and Mathematics Laboratory - Souk-Ahras University, Souk Ahras, Algeria

    Abdelhamid Rahali

Authors
  1. Abdelhamid Rahali
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. KamelEddine Heraguemi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Samir Akhrouf
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mouhamed Benouis
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Brahim Bouderah
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Abdelhamid Rahali .

Editor information

Editors and Affiliations

  1. University of Mascara, Mascara, Algeria

    Mohammed Salem

  2. University of Granada, Granada, Spain

    Juan Julián Merelo

  3. Université Paris-Est Créteil, Créteil, France

    Patrick Siarry

  4. University of Mascara, Mascara, Algeria

    Rochdi Bachir Bouiadjra

  5. University of Mascara, Mascara, Algeria

    Mohamed Debakla

  6. University of Mascara, Mascara, Algeria

    Fatima Debbat

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Rahali, A., Heraguemi, K., Akhrouf, S., Benouis, M., Bouderah, B. (2023). Artificial Orca Algorithm for Solving University Course Timetabling Issue. In: Salem, M., Merelo, J.J., Siarry, P., Bachir Bouiadjra, R., Debakla, M., Debbat, F. (eds) Artificial Intelligence: Theories and Applications. ICAITA 2022. Communications in Computer and Information Science, vol 1769. Springer, Cham. https://doi.org/10.1007/978-3-031-28540-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-28540-0_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-28539-4

  • Online ISBN: 978-3-031-28540-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation