An introduction of preference based stepping ahead firefly algorithm for the uncapacitated examination timetabling.

PeerJ Computer Science Pub Date : 2022-09-02 eCollection Date: 2022-01-01 DOI:10.7717/peerj-cs.1068
Ravneil Nand, Bibhya Sharma, Kaylash Chaudhary
{"title":"An introduction of preference based stepping ahead firefly algorithm for the uncapacitated examination timetabling.","authors":"Ravneil Nand,&nbsp;Bibhya Sharma,&nbsp;Kaylash Chaudhary","doi":"10.7717/peerj-cs.1068","DOIUrl":null,"url":null,"abstract":"<p><p>In recent times, there has been a growing attention to intelligent optimization algorithms centred on swarm principles such as the firefly algorithm (FA). It was proposed for the continuous domain that mimics the attraction of fireflies to flashing light and has been used in discrete domains <i>via</i> modification. A discrete domain that is a major challenge in most higher education institutes (HEI) is examination timetabling. This article presents a new methodology based on FA for uncapacitated examination timetabling problems (UETP) where the proposed method is an extension of earlier work by the authors on the continuous domain. UETP is considered in this article as it is a university examination timetabling problem, which is still an active research area and has not been solved by FA algorithm as per authors knowledge. The proposed method concentrates on solving the initial solution using discrete FA where it consolidates the reordering of examinations and slots through a heuristic ordering known as neighborhood search. Three neighborhoods are employed in this research, where one is used during the initialization phase while two are utilized during solution improvement phase. Later, through preference parameters, a novel stepping ahead mechanism is used, which employs neighborhood searches built on previous searches. The proposed method is tested with 12 UETP problems where the preference based stepping ahead FA creates comparative results to the best ones available in the literature for the Toronto exam timetabling dataset. The results obtained are proof of concept at the preliminary stage and require further experiments on other educational datasets such as the second international timetable competition benchmark sets. The newly introduced preference based stepping ahead mechanism takes advantage of the current best solution space where it exploits the solution space for better solutions. This paves the way for researchers to utilize the mechanism in other domains such as robotics, <i>etc</i>.</p>","PeriodicalId":503620,"journal":{"name":"PeerJ Computer Science","volume":" ","pages":"e1068"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9455270/pdf/","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"PeerJ Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.7717/peerj-cs.1068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2022/1/1 0:00:00","PubModel":"eCollection","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In recent times, there has been a growing attention to intelligent optimization algorithms centred on swarm principles such as the firefly algorithm (FA). It was proposed for the continuous domain that mimics the attraction of fireflies to flashing light and has been used in discrete domains via modification. A discrete domain that is a major challenge in most higher education institutes (HEI) is examination timetabling. This article presents a new methodology based on FA for uncapacitated examination timetabling problems (UETP) where the proposed method is an extension of earlier work by the authors on the continuous domain. UETP is considered in this article as it is a university examination timetabling problem, which is still an active research area and has not been solved by FA algorithm as per authors knowledge. The proposed method concentrates on solving the initial solution using discrete FA where it consolidates the reordering of examinations and slots through a heuristic ordering known as neighborhood search. Three neighborhoods are employed in this research, where one is used during the initialization phase while two are utilized during solution improvement phase. Later, through preference parameters, a novel stepping ahead mechanism is used, which employs neighborhood searches built on previous searches. The proposed method is tested with 12 UETP problems where the preference based stepping ahead FA creates comparative results to the best ones available in the literature for the Toronto exam timetabling dataset. The results obtained are proof of concept at the preliminary stage and require further experiments on other educational datasets such as the second international timetable competition benchmark sets. The newly introduced preference based stepping ahead mechanism takes advantage of the current best solution space where it exploits the solution space for better solutions. This paves the way for researchers to utilize the mechanism in other domains such as robotics, etc.

Abstract Image

Abstract Image

Abstract Image

介绍了基于偏好的步进萤火虫算法在无能力考试排课中的应用。
近年来,人们越来越关注以群体原理为中心的智能优化算法,如萤火虫算法(FA)。该方法在连续域模拟萤火虫对闪光的吸引,并通过改进应用于离散域。考试排课是大多数高等教育机构(HEI)面临的主要挑战。本文提出了一种基于FA的无能力考试排课问题(UETP)的新方法,该方法是作者在连续领域的早期工作的扩展。本文认为UETP是一个大学考试排课问题,这是一个研究活跃的领域,据作者所知还没有用FA算法解决。所提出的方法侧重于使用离散FA来求解初始解,其中它通过称为邻域搜索的启发式排序来合并考试和槽的重新排序。本研究使用了三个邻域,其中一个在初始化阶段使用,两个在解决方案改进阶段使用。然后,通过偏好参数,采用一种新的步进机制,该机制在先前搜索的基础上进行邻域搜索。提出的方法用12个UETP问题进行了测试,其中基于偏好的步进FA创建了与多伦多考试时间表数据集文献中可用的最佳结果的比较结果。获得的结果是初步阶段的概念验证,需要在其他教育数据集(如第二届国际时间表竞赛基准集)上进行进一步的实验。新引入的基于偏好的步进机制利用了当前的最佳解决方案空间,它利用解决方案空间来获得更好的解决方案。这为研究人员在机器人等其他领域利用该机制铺平了道路。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书