An Enhanced Particle Swarm Optimization for ITC2021 Sports Timetabling

作     者：Mutasem K.Alsmadi Ghaith M.Jaradat Malek Alzaqebah Ibrahim A.Lmarashdeh Fahad A.Alghamdi Rami Mustafa A.Mohammad Nahier Aldhafferi Abdullah Alqahtani 

作者机构：Department of MISCollege of Applied Studies and Community ServiceImam Abdulrahman Bin Faisal UniversityDammamSaudi Arabia Department of Computer ScienceFaculty of Computer Science and InformaticsAmman Arab UniversityAmmanJordan Department of MathematicsCollege of ScienceImam Abdulrahman Bin Faisal UniversityDammamSaudi Arabia Basic and Applied Scientific Research CenterImam Abdulrahman Bin Faisal UniversityDammamSaudi Arabia Computer Information Systems DepartmentCollege of Computer Science and Information TechnologyImam Abdulrahman Bin Faisal UniversityDammamSaudi Arabia 

出 版 物：《Computers, Materials & Continua》 (计算机、材料和连续体（英文）)

年 卷 期：2022年第72卷第7期

页      面：1995-2014页

核心收录：

学科分类：0711[理学-系统科学] 07[理学] 08[工学] 081101[工学-控制理论与控制工程] 0811[工学-控制科学与工程] 071102[理学-系统分析与集成] 081103[工学-系统工程] 

基　　金：supported by Deanship of Scientific Research at Imam Abdulrahman Bin Faisal University under the Project Number 2019-383-ASCS 

主　　题：Sports timetabling particle swarm optimization ITC2021 roundrobin tournament dynamic adaptive 

摘      要：Timetabling problem is among the most difficult operational tasks and is an important step in raising industrial productivity,capability,and *** tasks are usually tackled using metaheuristics techniques that provide an intelligent way of suggesting solutions or *** intelligence techniques including Particle Swarm Optimization(PSO)have proved to be effective *** recent experiments showed that the PSO algorithm is reliable for timetabling in many applications such as educational and personnel timetabling,machine scheduling,***,having an optimal solution is extremely challenging but having a sub-optimal solution using heuristics or metaheuristics is *** research paper seeks the enhancement of the PSO algorithm for an efficient timetabling *** algorithm aims at generating a feasible timetable within a reasonable *** enhanced version is a hybrid dynamic adaptive PSO algorithm that is tested on a round-robin tournament known as ITC2021 which is dedicated to sports *** competition includes several soft and hard constraints to be satisfied in order to build a feasible or sub-optimal *** consists of three categories of complexities,namely early,test,and middle *** showed that the proposed dynamic adaptive PSO has obtained feasible timetables for almost all of the *** feasibility is measured by minimizing the violation of hard constraints to *** performance of the dynamic adaptive PSO is evaluated by the consumed computational time to produce a solution of feasible timetable,consistency,and *** dynamic adaptive PSO showed a robust and consistent performance in producing a diversity of timetables in a reasonable computational time.