Optimizing music course scheduling with real number encoding and chaos genetic algorithm

IF 3.6
Shu Li
{"title":"Optimizing music course scheduling with real number encoding and chaos genetic algorithm","authors":"Shu Li","doi":"10.1016/j.sasc.2025.200251","DOIUrl":null,"url":null,"abstract":"<div><div>The scheduling process of music courses in education is complex and difficult to optimize. Traditional scheduling systems usually use simple algorithms or manual intervention, resulting in low efficiency and uneven resource allocation. To optimize the resource allocation and course scheduling of music courses, considering the limitations of genetic algorithms, the randomness and traversal characteristics of introducing chaotic systems were studied to optimize population diversity, forming a new scheduling method based on chaotic genetic algorithms. This study used music course data from a particular school, including classroom resources, number of students, course time, etc. The results showed that after 300 iterations, the average running time of the research method decreased by 76.57 %, 66.46 %, 58.39 %, and 48.24 %, respectively. Meanwhile, this research method not only had the fastest convergence speed, but also had the highest fitness function value during the convergence process. In practical applications, this research method significantly improved students' music grades, demonstrating its effectiveness in optimizing the music course scheduling system. This study provides a new research direction for future educational scheduling systems.</div></div>","PeriodicalId":101205,"journal":{"name":"Systems and Soft Computing","volume":"7 ","pages":"Article 200251"},"PeriodicalIF":3.6000,"publicationDate":"2025-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Systems and Soft Computing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2772941925000699","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The scheduling process of music courses in education is complex and difficult to optimize. Traditional scheduling systems usually use simple algorithms or manual intervention, resulting in low efficiency and uneven resource allocation. To optimize the resource allocation and course scheduling of music courses, considering the limitations of genetic algorithms, the randomness and traversal characteristics of introducing chaotic systems were studied to optimize population diversity, forming a new scheduling method based on chaotic genetic algorithms. This study used music course data from a particular school, including classroom resources, number of students, course time, etc. The results showed that after 300 iterations, the average running time of the research method decreased by 76.57 %, 66.46 %, 58.39 %, and 48.24 %, respectively. Meanwhile, this research method not only had the fastest convergence speed, but also had the highest fitness function value during the convergence process. In practical applications, this research method significantly improved students' music grades, demonstrating its effectiveness in optimizing the music course scheduling system. This study provides a new research direction for future educational scheduling systems.
基于实数编码和混沌遗传算法的音乐课程调度优化
音乐教育课程调度过程复杂,难以优化。传统的调度系统通常采用简单的算法或人工干预,导致效率低,资源分配不均衡。为了优化音乐课程的资源分配和课程调度,考虑到遗传算法的局限性,研究了引入混沌系统的随机性和遍历特性来优化群体多样性,形成了一种新的基于混沌遗传算法的调度方法。本研究使用了某一学校的音乐课程数据,包括课堂资源、学生人数、课程时间等。结果表明,经过300次迭代后,研究方法的平均运行时间分别下降了76.57%、66.46%、58.39%和48.24%。同时,该研究方法不仅收敛速度最快,而且在收敛过程中适应度函数值最高。在实际应用中,该研究方法显著提高了学生的音乐成绩,证明了其在优化音乐排课系统方面的有效性。本研究为未来的教育调度系统提供了新的研究方向。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
2.20
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信