检索结果-南通市图书馆

An Enhanced Particle Swarm Optimization for itc2021 Sports Timetabling

Computers, Materials & Continua 2022年第7期72卷 1995-2014页

作者： Mutasem K.Alsmadi Ghaith M.Jaradat Malek Alzaqebah Ibrahim A.Lmarashdeh Fahad A.Alghamdi Rami Mustafa A.Mohammad Nahier Aldhafferi Abdullah Alqahtani Department of MIS College of Applied Studies and Community ServiceImam Abdulrahman Bin Faisal UniversityDammamSaudi Arabia Department of Computer Science Faculty of Computer Science and InformaticsAmman Arab UniversityAmmanJordan Department of Mathematics College of ScienceImam Abdulrahman Bin Faisal UniversityDammamSaudi Arabia Basic and Applied Scientific Research CenterImam Abdulrahman Bin Faisal UniversityDammamSaudi Arabia Computer Information Systems Department College of Computer Science and Information TechnologyImam Abdulrahman Bin Faisal UniversityDammamSaudi Arabia

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.

关键词： Sports timetabling particle swarm optimization itc2021 roundrobin tournament dynamic adaptive

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：