arrow
返回

Hybrid bee colony optimization for examination timetabling problems

delete2015-02-01
delete38
PRE
AI
M
Malek Alzaqebah *
S
Salwani Abdullah
DOI:10.1016/j.cor.2014.09.005delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Swarm intelligence is a branch of artificial intelligence that focuses on the actions of agents in self-organized systems. Researchers have proposed a bee colony optimization (BCO) algorithm as part of swarm intelligence. BCO is a meta-heuristic algorithm based on the foraging behavior of bees. This study presents a hybrid BCO algorithm for examination timetabling problems. Bees in the BCO algorithm perform two main actions: forward pass and backward pass. Each bee explores the search space in forward pass and then shares information with other bees in the hive in backward pass. This study found that a bee decides to be either a recruiter that searches for a food source or a follower that selects a recruiter bee to follow on the basis of roulette wheel selection. In forward pass, BCO is supported along with other local searches, including the Late Acceptance Hill Climbing and Simulated Annealing algorithms. We introduce three selection strategies (tournament, rank and disruptive selection strategies) for the follower bees to select a recruiter to maintain population diversity in backward pass. The disruptive selection strategy outperforms tournament and rank selections. We also introduce a self-adaptive mechanism to select a neighborhood structure to enhance the neighborhood search. The proposed algorithm is evaluated against the latest methodologies in the literature with respect to two standard examination timetabling problems, namely, uncapacitated and competition datasets. We demonstrate that the proposed algorithm produces one new best result on uncapacitated datasets and comparable results on competition datasets. (C) 2014 Elsevier Ltd. All rights reserved.
Keyword:
Bee colony optimization algorithm
Examination timetabling problems
Late acceptance hill climbing algorithm
Selection strategy
Self-adaptive mechanism
Simulated annealing
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Operations Research
IF:
4.3
论文数:
6.5K
被引数:
1.8W

机构

U
Universiti Kebangsaan Malaysia
学者数:
1.5W
论文数: 1.1W
被引数: 126
引用论文

引用论文

err
IF0
err
err0
PREAI
err
err分享
err收藏
err分享
err收藏
err分享
err收藏
Tension control: dancer rolls or load cells
err1993-01-01
err0
PREAI
errN.A. Ebler; R. Arnason; G. Michaelis; N. D'Sa
err分享
err收藏
OPTIMIZATION BY SIMULATED ANNEALING模拟退火优化
errSCIENCE
IF45.8
err1983-05-13
err3.2W
PREAI
errKIRKPATRICK, S; GELATT, CD; VECCHI, MP
err分享
err收藏
学者 查看更多内容