Effect of Elite Pool and Euclidean Distance in Big Bang-Big Crunch Metaheuristic for Post-Enrolment Course TimetablingProblems

Ghaith M. Jaradat, Masri Ayob

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In this study, researchers present an investigation of enhancing the capability of the Big Bang-Big Crunch (BB-BC) metaheuristic to strike a balance between diversity and quality of the search. The BB-BC is tested on three post-enrolment course timetabling problems. The BB-BC is derived from one of the evolution theories of the universe in physics and astronomy. The BB-BC theory involves two phases (big bang and big crunch). The big bang phase generates a population of random initial solutions whilst the big crunch phase shrinks those solutions to a single elite solution presented by a centre of mass. The investigation focuses on finding the significance of incorporating an elite pool and controlling the search diversity via the Euclidean distance. Both strategies provide a balanced search of diverse and good quality population. This is achieved by a dynamic changing of the population size, the utilization of elite solutions and a probabilistic selection procedure to generate a diverse collection of promising elite solutions. The investigation is conducted in three stages, first researchers apply the original BB-BC with an iterated local search; second researchers apply the BB-BC with an elite pool and an iterated local search without considering the Euclidean distance and third researchers apply the BB-BC with an elite pool and a simple descent heuristic with utilizing the Euclidean distance. It is found that by incorporating an elite pool without using the Euclidean distance, the BB-BC performs better than the original BB-BC. However, utilizing both elite pool and Euclidean distance have a greater impact on the BB-BC. The third version of BB-BC performs better than both previous versions. Experiments showed that the third version produces high quality solutions and outperforms some approaches reported in the literature.

Original languageEnglish
Pages (from-to)96-107
Number of pages12
JournalInternational Journal of Soft Computing
Volume8
Issue number2
DOIs
Publication statusPublished - 2013

Fingerprint

Euclidean Distance
Metaheuristics
Iterated Local Search
Timetabling
Astronomy
Selection Procedures
Barycentre
Population Size
Descent
Physics
Heuristics
Experiment
Experiments

Keywords

  • Big Bang-Big Crunch metaheuristic
  • Elite pool
  • Euclidean distance
  • Malaysia
  • Post-enrolment course timetabling problems

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Modelling and Simulation

Cite this

@article{4701db6b3ed0470ba0badd019bd4230e,
title = "Effect of Elite Pool and Euclidean Distance in Big Bang-Big Crunch Metaheuristic for Post-Enrolment Course TimetablingProblems",
abstract = "In this study, researchers present an investigation of enhancing the capability of the Big Bang-Big Crunch (BB-BC) metaheuristic to strike a balance between diversity and quality of the search. The BB-BC is tested on three post-enrolment course timetabling problems. The BB-BC is derived from one of the evolution theories of the universe in physics and astronomy. The BB-BC theory involves two phases (big bang and big crunch). The big bang phase generates a population of random initial solutions whilst the big crunch phase shrinks those solutions to a single elite solution presented by a centre of mass. The investigation focuses on finding the significance of incorporating an elite pool and controlling the search diversity via the Euclidean distance. Both strategies provide a balanced search of diverse and good quality population. This is achieved by a dynamic changing of the population size, the utilization of elite solutions and a probabilistic selection procedure to generate a diverse collection of promising elite solutions. The investigation is conducted in three stages, first researchers apply the original BB-BC with an iterated local search; second researchers apply the BB-BC with an elite pool and an iterated local search without considering the Euclidean distance and third researchers apply the BB-BC with an elite pool and a simple descent heuristic with utilizing the Euclidean distance. It is found that by incorporating an elite pool without using the Euclidean distance, the BB-BC performs better than the original BB-BC. However, utilizing both elite pool and Euclidean distance have a greater impact on the BB-BC. The third version of BB-BC performs better than both previous versions. Experiments showed that the third version produces high quality solutions and outperforms some approaches reported in the literature.",
keywords = "Big Bang-Big Crunch metaheuristic, Elite pool, Euclidean distance, Malaysia, Post-enrolment course timetabling problems",
author = "Jaradat, {Ghaith M.} and Masri Ayob",
year = "2013",
doi = "10.3923/ijscomp.2013.96.107",
language = "English",
volume = "8",
pages = "96--107",
journal = "International Journal of Soft Computing",
issn = "1816-9503",
publisher = "Medwell Publishing",
number = "2",

}

TY - JOUR

T1 - Effect of Elite Pool and Euclidean Distance in Big Bang-Big Crunch Metaheuristic for Post-Enrolment Course TimetablingProblems

AU - Jaradat, Ghaith M.

AU - Ayob, Masri

PY - 2013

Y1 - 2013

N2 - In this study, researchers present an investigation of enhancing the capability of the Big Bang-Big Crunch (BB-BC) metaheuristic to strike a balance between diversity and quality of the search. The BB-BC is tested on three post-enrolment course timetabling problems. The BB-BC is derived from one of the evolution theories of the universe in physics and astronomy. The BB-BC theory involves two phases (big bang and big crunch). The big bang phase generates a population of random initial solutions whilst the big crunch phase shrinks those solutions to a single elite solution presented by a centre of mass. The investigation focuses on finding the significance of incorporating an elite pool and controlling the search diversity via the Euclidean distance. Both strategies provide a balanced search of diverse and good quality population. This is achieved by a dynamic changing of the population size, the utilization of elite solutions and a probabilistic selection procedure to generate a diverse collection of promising elite solutions. The investigation is conducted in three stages, first researchers apply the original BB-BC with an iterated local search; second researchers apply the BB-BC with an elite pool and an iterated local search without considering the Euclidean distance and third researchers apply the BB-BC with an elite pool and a simple descent heuristic with utilizing the Euclidean distance. It is found that by incorporating an elite pool without using the Euclidean distance, the BB-BC performs better than the original BB-BC. However, utilizing both elite pool and Euclidean distance have a greater impact on the BB-BC. The third version of BB-BC performs better than both previous versions. Experiments showed that the third version produces high quality solutions and outperforms some approaches reported in the literature.

AB - In this study, researchers present an investigation of enhancing the capability of the Big Bang-Big Crunch (BB-BC) metaheuristic to strike a balance between diversity and quality of the search. The BB-BC is tested on three post-enrolment course timetabling problems. The BB-BC is derived from one of the evolution theories of the universe in physics and astronomy. The BB-BC theory involves two phases (big bang and big crunch). The big bang phase generates a population of random initial solutions whilst the big crunch phase shrinks those solutions to a single elite solution presented by a centre of mass. The investigation focuses on finding the significance of incorporating an elite pool and controlling the search diversity via the Euclidean distance. Both strategies provide a balanced search of diverse and good quality population. This is achieved by a dynamic changing of the population size, the utilization of elite solutions and a probabilistic selection procedure to generate a diverse collection of promising elite solutions. The investigation is conducted in three stages, first researchers apply the original BB-BC with an iterated local search; second researchers apply the BB-BC with an elite pool and an iterated local search without considering the Euclidean distance and third researchers apply the BB-BC with an elite pool and a simple descent heuristic with utilizing the Euclidean distance. It is found that by incorporating an elite pool without using the Euclidean distance, the BB-BC performs better than the original BB-BC. However, utilizing both elite pool and Euclidean distance have a greater impact on the BB-BC. The third version of BB-BC performs better than both previous versions. Experiments showed that the third version produces high quality solutions and outperforms some approaches reported in the literature.

KW - Big Bang-Big Crunch metaheuristic

KW - Elite pool

KW - Euclidean distance

KW - Malaysia

KW - Post-enrolment course timetabling problems

UR - http://www.scopus.com/inward/record.url?scp=84884560076&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84884560076&partnerID=8YFLogxK

U2 - 10.3923/ijscomp.2013.96.107

DO - 10.3923/ijscomp.2013.96.107

M3 - Article

AN - SCOPUS:84884560076

VL - 8

SP - 96

EP - 107

JO - International Journal of Soft Computing

JF - International Journal of Soft Computing

SN - 1816-9503

IS - 2

ER -