IDEAS home Printed from https://ideas.repec.org/a/hin/complx/7252719.html
   My bibliography  Save this article

Improved Genetic Algorithm to Solve the Scheduling Problem of College English Courses

Author

Listed:
  • Jing Xu
  • Zhihan Lv

Abstract

In this paper, an improved genetic algorithm is designed to solve the above multiobjective optimization problem for the scheduling problem of college English courses. Firstly, a variable-length decimal coding scheme satisfying the same course that can be scheduled at different times, different classrooms, and different teaching weeks per week is proposed, which fully considers the flexibility of classrooms and time arrangements of the course and makes the scheduling problem more reasonable. Secondly, a problem-specific local search operator is designed to accelerate the convergence speed of the algorithm. Finally, under the framework of optimal individual retention, the selection operator, crossover operator, and variation operator are improved. It is experimentally demonstrated that the designed algorithm not only has a faster convergence speed but also improves the diversity of individuals to a certain extent to enhance the search space and jump out of the local optimum. Research shows that the improved genetic algorithm has improved average fitness value and time compared with traditional genetic algorithm. At the same time, the use of the largest fuzzy pattern algorithm effectively solves the conflict problem of college English lesson scheduling, thereby improving the solution of college English lesson scheduling. Through the research of this article, the management system of college English course scheduling has been made more intelligent, and the rational allocation of teaching resources and the completion of education and teaching plans have been improved.

Suggested Citation

  • Jing Xu & Zhihan Lv, 2021. "Improved Genetic Algorithm to Solve the Scheduling Problem of College English Courses," Complexity, Hindawi, vol. 2021, pages 1-11, June.
  • Handle: RePEc:hin:complx:7252719
    DOI: 10.1155/2021/7252719
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/7252719.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/7252719.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/7252719?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:7252719. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.