Cargando…

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

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 mod...

Descripción completa

Detalles Bibliográficos
Autores principales: Nand, Ravneil, Sharma, Bibhya, Chaudhary, Kaylash
Formato: Online Artículo Texto
Lenguaje:English
Publicado: PeerJ Inc. 2022
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9455270/
https://www.ncbi.nlm.nih.gov/pubmed/36091985
http://dx.doi.org/10.7717/peerj-cs.1068
_version_ 1784785545716563968
author Nand, Ravneil
Sharma, Bibhya
Chaudhary, Kaylash
author_facet Nand, Ravneil
Sharma, Bibhya
Chaudhary, Kaylash
author_sort Nand, Ravneil
collection PubMed
description 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.
format Online
Article
Text
id pubmed-9455270
institution National Center for Biotechnology Information
language English
publishDate 2022
publisher PeerJ Inc.
record_format MEDLINE/PubMed
spelling pubmed-94552702022-09-09 An introduction of preference based stepping ahead firefly algorithm for the uncapacitated examination timetabling Nand, Ravneil Sharma, Bibhya Chaudhary, Kaylash PeerJ Comput Sci Algorithms and Analysis of Algorithms 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. PeerJ Inc. 2022-09-02 /pmc/articles/PMC9455270/ /pubmed/36091985 http://dx.doi.org/10.7717/peerj-cs.1068 Text en © 2022 Nand et al. https://creativecommons.org/licenses/by/4.0/This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/) , which permits unrestricted use, distribution, reproduction and adaptation in any medium and for any purpose provided that it is properly attributed. For attribution, the original author(s), title, publication source (PeerJ Computer Science) and either DOI or URL of the article must be cited.
spellingShingle Algorithms and Analysis of Algorithms
Nand, Ravneil
Sharma, Bibhya
Chaudhary, Kaylash
An introduction of preference based stepping ahead firefly algorithm for the uncapacitated examination timetabling
title An introduction of preference based stepping ahead firefly algorithm for the uncapacitated examination timetabling
title_full An introduction of preference based stepping ahead firefly algorithm for the uncapacitated examination timetabling
title_fullStr An introduction of preference based stepping ahead firefly algorithm for the uncapacitated examination timetabling
title_full_unstemmed An introduction of preference based stepping ahead firefly algorithm for the uncapacitated examination timetabling
title_short An introduction of preference based stepping ahead firefly algorithm for the uncapacitated examination timetabling
title_sort introduction of preference based stepping ahead firefly algorithm for the uncapacitated examination timetabling
topic Algorithms and Analysis of Algorithms
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9455270/
https://www.ncbi.nlm.nih.gov/pubmed/36091985
http://dx.doi.org/10.7717/peerj-cs.1068
work_keys_str_mv AT nandravneil anintroductionofpreferencebasedsteppingaheadfireflyalgorithmfortheuncapacitatedexaminationtimetabling
AT sharmabibhya anintroductionofpreferencebasedsteppingaheadfireflyalgorithmfortheuncapacitatedexaminationtimetabling
AT chaudharykaylash anintroductionofpreferencebasedsteppingaheadfireflyalgorithmfortheuncapacitatedexaminationtimetabling
AT nandravneil introductionofpreferencebasedsteppingaheadfireflyalgorithmfortheuncapacitatedexaminationtimetabling
AT sharmabibhya introductionofpreferencebasedsteppingaheadfireflyalgorithmfortheuncapacitatedexaminationtimetabling
AT chaudharykaylash introductionofpreferencebasedsteppingaheadfireflyalgorithmfortheuncapacitatedexaminationtimetabling