Abstract
Course scheduling is a combinatorial optimization problem with multiple constraints. To achieve the reasonable allocation of teaching resources, all courses should be arranged under a number of specified constraints. With the increased number of courses, the solution space increases exponentially. However, the traditional methods cannot quickly find the optimal solution. In order to overcome the disadvantages of low efficiency and the possibility of high conflict in traditional course scheduling, this research study proposes a course scheduling, method based on an improved binary cuckoo search algorithm (IBCS). First of all, a multi-objective and multi-constraint mathematical model of course scheduling is established. Course scheduling involves issues, such as allocating teachers, courses, classes, classrooms and time under specific constraints. The class element is defined to represent the class and the course that the teachers will teach. Therefore, the problem of course scheduling is transformed into the process of mapping from the class element to the classroom-time pair. Six hard constraints and three soft constraints are also defined accordingly. Then, the BCS algorithm is used to search the best course scheduling scheme in the binary-encoded solution space. In order to control the convergence rate effectively and avoid falling into the local optimum, a dynamically adjustable, equilibrium coefficient is introduced. Therefore, the algorithm retains the diversity of the solutions while converging. Finally, this research study constructs the data set and carries out the simulation experiment. It also compares the IBCS algorithm in this paper with the genetic algorithm and the standard binary cuckoo search algorithm (BCS). Experimental results show that the IBCS algorithm can converge in effective time. Meanwhile, it can achieve an improved global scheduling scheme with higher stability.






Similar content being viewed by others
References
Yang XS (2021) Cuckoo search algorithm. Nature-inspired optimization algorithms. Elsevier, Amsterdam, pp 141–155
Zhang Y, Qi L (2018) Research and development of university laboratory course arrangement system. J Yulin College 28(3):97–99
Chen L, Gan W (2020) Li H (2020) Solving multi-objective optimization problem using cuckoo search algorithm based on decomposition. Appl Intel 9:143–160
Wang A, Gong H, Chen F (2020) Fault estimation and compensation for hypersonic flight vehicle via type-2 fuzzy technique and cuckoo search algorithm. Int J Adv Robotic Syst. https://doi.org/10.1177/1729881419891605
Bhandari AK, Maurya S (2019) Cuckoo search algorithm-based brightness preserving histogram scheme for low-contrast image enhancement. Soft Comput 24:1619
Fan J, Xu W, Huang Y (2021) Application of chaos cuckoo search algorithm in computer vision technology. Soft Comput 2021:884–888
Nguyen TT, Nguyen CT, Dai LV (2020) Finding optimal load dispatch solutions by using a proposed cuckoo search algorithm. Math Prob Eng 2019:1–29
Bavithra K, Charles RS, Anadhakumar K (2020) Parameter optimisation of FACTS using cuckoo search algorithm for ATC enhancement in restructured power systems. Int Energy J 18(2A):247–254
Oruc R, Baklacioglu T (2020) Modelling of fuel flow-rate of commercial aircraft for the climbing flight using cuckoo search algorithm. Aircraft Eng Aerosp Technol 92:495
Qin X, Xia B, Ding T (2021) An improved Cuckoo search localization algorithm for UWB sensor networks. Wirel Netw 27(21):527
Yaseen A, Nazir M, Sabah A (2020) Dimensionality reduction for internet of things using the cuckoo search algorithm: reduced implications of mesh sensor technologies. Wirel Commun Mobile Comput 2020:1–21
Catherina VP, Chella KN (2021) Prediction of compressive strength of recycled aggregate concrete using artificial neural network and cuckoo search method. 2021(46):8480–8488
García J, Maureira C (2021) A KNN quantum cuckoo search algorithm applied to the multidimensional knapsack problem. Appl Soft Comput 102:107077
Shitov Y (2021) Column subset selection is NP-complete-Science Direct. Linear Algebra Appl 610:52–58
Zhang Y, Wang Y, Fu L, Hu S (2020) New optimized genetic algorithm for middle school class arrangement. Comput Syst Appl 29(12):84–90
Chen L, Xiu W (2019) Solution to course-timetabling problem of mobile learning system based on improved genetic algorithm. Comput Eng Appl 55(06):224–230
Wang WH, Li WQ (2018) Timetabling algorithm of high school optional system based on improved genetic algorithm. J ZheJiang Univ Technol 044(006):601–607
Zhang HN, Zhang SW (2019) Improved hybrid genetic algorithm for university timetabling problem [J]. Comput Eng Appl 51(5):240–246
Sun Y, Hu Z (2019) Course schedule system based on genetic-ant colony hybrid algorithm. Comput Syst Appl 28(02):83–88
Song T, Chen M, Wu C (2019) Automated course arrangement algorithm based on multi-class iterated local search. Comput Appl 039(006):1760–1765
Pang S, Liu Q, Mou C (2019) Research on timetabling optimization algorithm based on inter curriculum association rules. Appl Res Comput 36(10):60–63
Shen G, Li J, Zhou Y (2019) Research of intelligent timetable based on the discrete glowworm swarm optimization algorithm. Math Pract Theory 46(019):23–30
Tang H, Gao J (2017) Application of simulated anneal algorithm for curriculum schedule problem in senior high schools. Comput Syst Appl 026(010):225–230
Luo Y, Chen Z (2018) Optimization of university course scheduling problem based on improved PSO algorithm. Computer Appl Softw 035(006):241–247
Liu X, Li Y (2020) Two subpopulations cuckoo search algorithm based on mean evaluation method for function optimization problems. Int J Pattern Recogn Artif Intell 34(08):106–275
Gosain A, Sachdeva K (2020) Materialized view selection for query performance enhancement using stochastic ranking based cuckoo search algorithm. Int J Reliab Qual Saf Eng 27(03):1–8
Han Z, Dong X, Lv X (2015) Self-adaptive cuckoo search algorithm for hybrid flow shop make span problem [C]. IEEE International Conference on Cyber Technology in Automation. IEEE, 2015.
Zhang HN, You XM, Sheng Liu (2020) Interactive learning cuckoo search algorithm. Comput Eng Appl 056(007):147–154
Wang XH, Nie T (2020) Research on optimized particle filtering by improved cuckoo algorithm. Comput Eng Appl 955(12):66–71
Huang M, He Q, Wen X (2020) Dynamically adaptive cuckoo search algorithm based on dimension by opposition-based learning. Appl Res Comput 037(004):1015–1019
Zang R (2020) Liu X X (2020) Segment weighted cuckoo algorithm and its application. Comput Sci 47:119–123
Yang RY, He Q, Wang X, Lin J (2020) Dynamic selection cuckoo search algorithm of information interaction. J Chin Mini-Micro Comput Syst 11:22–29
Zhang C, Zeng G, Wang H (2019) Hierarchical resource scheduling method using improved cuckoo search algorithm for internet of things. Peer-to-Peer Netw Appl 12(99):1606
Alqahtani F, Al-Makhadmeh Z, Tolba A (2020) Internet of things-based urban waste management system for smart cities using a Cuckoo Search Algorithm. Cluster Comput 23(1):1769
Salau HB, Onumanyi AJ, Abu-Mahfouz AM (2020) New discrete cuckoo search optimization algorithms for effective route discovery in IoT-based vehicular ad-hoc networks. IEEE Access 8:145469–145488
Sadeghi F, Avokh A (2020) Load-balanced data gathering in Internet of Things using an energy-ware cuckoo-search algorithm. Int J Commun Syst 33(9):e4385
Gherboudj A, Layeb A, Chikhi S (2012) Solving 0–1 knapsack problems by a discrete binary version of cuckoo search algorithm. Int J Bio Inspired Comput 4(4):229–236
Acknowledgements
This work was supported in part by the special project of Electronic Information Engineering Technology within the national double high program of Dongguan Polytechnic (NO. ZXF023) and in part by Guangdong Natural Science Youth Fund under Grant (No.2020A1515110162). This research was also supported by the key projects of Social Science and Technology Development in Dongguan under Grant (No. 2020507156156), in part by the special fund of the Science and Technology Innovation Strategy of Guangdong Province under Grant (No. pdjh2020a1261) and in part by the special project of Electronic Information Engineering Technology within the national double high program of Dongguan Polytechnic (NO. ZXF016).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Zheng, H., Peng, Y., Guo, J. et al. Course scheduling algorithm based on improved binary cuckoo search. J Supercomput 78, 11895–11920 (2022). https://doi.org/10.1007/s11227-022-04341-6
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-022-04341-6