.png){kind=icon}
返回
Preference-Based Stepping Ahead Firefly Algorithm for Solving Real-World Uncapacitated Examination Timetabling Problem
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2024.3365734.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Swarm-based intelligent optimization algorithms that employ the principles of collective behavior have been gaining traction as viable solutions in optimization research. One area of optimization is the Examination Timetabling Problem (ETP), which presents a significant challenge for many Higher Education Institutes (HEIs). This study proposes a novel approach for solving the Uncapacitated Examination Timetabling Problem (UETP), where a stepping-ahead mechanism is utilized with threshold acceptance in the Firefly Algorithm (FA). The proposed method improves exploration with the use of the stepping-ahead mechanism, while threshold acceptance allows for better exploitation of the search space. Initially, a neighborhood search mechanism is employed as the discretization of FA to improve solution quality, known as Kempe Chain-based neighborhoods. The proposed method is tested on seven UETP problems, with the results showing comparative performance to the best solutions available in the literature for the Toronto exam timetabling dataset. The selection of seven problems is made with exams totaling less than 400, this allows to create a manageable yet representative benchmark. The study further extends the experiment to a real-world dataset collected from an HEI. The use of a real-world dataset allows us to see the potential of the algorithm and at the same time evaluate its performance under realistic conditions and resource constraints. The proposed stepping-ahead mechanism has the potential for use in other domains, such as robotics and engineering. Overall, this paper presents a new methodology for solving the UETP that has the potential to offer superior results when compared to existing approaches.
Keyword:
Optimization methods
Particle swarm optimization
Benchmark testing
Task analysis
Schedules
Education
Behavioral sciences
Time factors
Mathematical models
Scheduling
Testing
Educational institutions
Performance analysis
Firefly algorithm
optimization
swarm intelligence
uncapacitated examination timetabling problem
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
Hybrid particle swarm optimization transplanted into a hyper-heuristic structure for solving examination timetabling problem混合粒子群优化算法移植到超启发式结构中，用于解决考试时间表问题
PREAI
分享收藏分享收藏
查看更多内容