An Annealing Memetic Algorithm for Instructional Scheduling
DOI:
https://doi.org/10.3991/ijet.v13i11.9601Keywords:
instructional scheduling, Memetic algorithm, scheduling programAbstract
In order to solve the problems of large-scale instructional scheduling, many constraints, and complex interrelation, it is studied based on the changes in the scheduling problem and the adjustment of related algorithms. Firstly, the problem of instructional scheduling is described as a whole, and the relationship between each stage, in particular the impact of the combined plan on scheduling is also described, and an optimization plan is proposed. Then the optimal scheduling scheme is solved with Memetic algorithm. According to the constraints, the fitness value function in the algorithm is designed flexibly. Finally, the convergence of the algorithm is proved based on the Banach compression mapping theorem. Practice has proved that: Memetic algorithm can effectively solve the problem of inadequate teaching resources and difficult of instructional scheduling. Therefore, the Memntic algorithm can be used in instructional scheduling.
Downloads
Published
How to Cite
Issue
Section
License
The submitting author warrants that the submission is original and that she/he is the author of the submission together with the named co-authors; to the extend the submission incorporates text passages, figures, data or other material from the work of others, the submitting author has obtained any necessary permission.
Articles in this journal are published under the Creative Commons Attribution Licence (CC-BY What does this mean?). This is to get more legal certainty about what readers can do with published articles, and thus a wider dissemination and archiving, which in turn makes publishing with this journal more valuable for you, the authors.
By submitting an article the author grants to this journal the non-exclusive right to publish it. The author retains the copyright and the publishing rights for his article without any restrictions.