.png){kind=icon}
返回
Solving effectively the school timetabling problem using particle swarm optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2011.12.013.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A new adaptive algorithm based on particle swarm optimization (PSO) is designed, developed and applied to the high school timetabling problem. The proposed PSO algorithm is used in order to create feasible and very efficient timetables for high schools in Greece. Experiments with real-world data coming from many different high schools have been conducted in order to show the efficiency of the proposed PSO algorithm. As well as that, the algorithm has been compared with four other effective techniques found in the literature in order to demonstrate its efficiency and superior performance. The proposed PSO algorithm outperforms, in most cases, other existing attempts to solve the same problem as shown by experimental results. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Particle swarm optimization
School timetabling problem
Educational organizations
Computer application
Artificial intelligence
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏The effect of neighborhood structures on tabu search algorithm in solving course timetabling problem邻域结构对禁忌搜索算法求解排课问题的影响
PREAI
分享收藏Solving examination timetabling problems through adaption of heuristic orderings通过启发式排序解决考试时间表问题
PREAI
分享收藏Case-based selection of initialisation heuristics for metaheuristic examination timetabling基于案例的元启发式考试时间表初始化启发式选择
PREAI
分享收藏
查看更多内容