Big Bang-Big Crunch optimization algorithm to solve the course timetabling problem

Ghaith M. Jaradat, Masri Ayob

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

In this study, we present the Big Bang-Big Crunch (BB-BC) method to solve the post-enrolment course timetabling problem. This method is derived from one of the evolution of the universe theories in physics and astronomy. The BB-BC theory involves two phases (Big Bang and Big Crunch). The Big Bang phase feeds the Big Crunch phase with many inputs and the Big Crunch phase is the shrinking destiny of the universe into singularity. Generally, the BB-BC algorithm generates a population of random initial solutions in the Big Bang phase and shrinks those solutions to a single good quality solution represented by a centre of mass. Experimental results show that the BB-BC can produce good quality solutions and comparable with some of the methods applied in the literature (with regards to Socha's benchmark instances).

Original languageEnglish
Title of host publicationProceedings of the 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10
Pages1448-1452
Number of pages5
DOIs
Publication statusPublished - 2010
Event2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10 - Cairo
Duration: 29 Nov 20101 Dec 2010

Other

Other2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10
CityCairo
Period29/11/101/12/10

Fingerprint

Astronomy
Physics

Keywords

  • Big Bang-Big Crunch
  • Post-enrolment course timetabling problem

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Science Applications
  • Hardware and Architecture

Cite this

Jaradat, G. M., & Ayob, M. (2010). Big Bang-Big Crunch optimization algorithm to solve the course timetabling problem. In Proceedings of the 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10 (pp. 1448-1452). [5687114] https://doi.org/10.1109/ISDA.2010.5687114

Big Bang-Big Crunch optimization algorithm to solve the course timetabling problem. / Jaradat, Ghaith M.; Ayob, Masri.

Proceedings of the 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10. 2010. p. 1448-1452 5687114.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Jaradat, GM & Ayob, M 2010, Big Bang-Big Crunch optimization algorithm to solve the course timetabling problem. in Proceedings of the 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10., 5687114, pp. 1448-1452, 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10, Cairo, 29/11/10. https://doi.org/10.1109/ISDA.2010.5687114
Jaradat GM, Ayob M. Big Bang-Big Crunch optimization algorithm to solve the course timetabling problem. In Proceedings of the 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10. 2010. p. 1448-1452. 5687114 https://doi.org/10.1109/ISDA.2010.5687114
Jaradat, Ghaith M. ; Ayob, Masri. / Big Bang-Big Crunch optimization algorithm to solve the course timetabling problem. Proceedings of the 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10. 2010. pp. 1448-1452
@inproceedings{17a538949d2b4128b0f2497928272850,
title = "Big Bang-Big Crunch optimization algorithm to solve the course timetabling problem",
abstract = "In this study, we present the Big Bang-Big Crunch (BB-BC) method to solve the post-enrolment course timetabling problem. This method is derived from one of the evolution of the universe theories in physics and astronomy. The BB-BC theory involves two phases (Big Bang and Big Crunch). The Big Bang phase feeds the Big Crunch phase with many inputs and the Big Crunch phase is the shrinking destiny of the universe into singularity. Generally, the BB-BC algorithm generates a population of random initial solutions in the Big Bang phase and shrinks those solutions to a single good quality solution represented by a centre of mass. Experimental results show that the BB-BC can produce good quality solutions and comparable with some of the methods applied in the literature (with regards to Socha's benchmark instances).",
keywords = "Big Bang-Big Crunch, Post-enrolment course timetabling problem",
author = "Jaradat, {Ghaith M.} and Masri Ayob",
year = "2010",
doi = "10.1109/ISDA.2010.5687114",
language = "English",
isbn = "9781424481354",
pages = "1448--1452",
booktitle = "Proceedings of the 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10",

}

TY - GEN

T1 - Big Bang-Big Crunch optimization algorithm to solve the course timetabling problem

AU - Jaradat, Ghaith M.

AU - Ayob, Masri

PY - 2010

Y1 - 2010

N2 - In this study, we present the Big Bang-Big Crunch (BB-BC) method to solve the post-enrolment course timetabling problem. This method is derived from one of the evolution of the universe theories in physics and astronomy. The BB-BC theory involves two phases (Big Bang and Big Crunch). The Big Bang phase feeds the Big Crunch phase with many inputs and the Big Crunch phase is the shrinking destiny of the universe into singularity. Generally, the BB-BC algorithm generates a population of random initial solutions in the Big Bang phase and shrinks those solutions to a single good quality solution represented by a centre of mass. Experimental results show that the BB-BC can produce good quality solutions and comparable with some of the methods applied in the literature (with regards to Socha's benchmark instances).

AB - In this study, we present the Big Bang-Big Crunch (BB-BC) method to solve the post-enrolment course timetabling problem. This method is derived from one of the evolution of the universe theories in physics and astronomy. The BB-BC theory involves two phases (Big Bang and Big Crunch). The Big Bang phase feeds the Big Crunch phase with many inputs and the Big Crunch phase is the shrinking destiny of the universe into singularity. Generally, the BB-BC algorithm generates a population of random initial solutions in the Big Bang phase and shrinks those solutions to a single good quality solution represented by a centre of mass. Experimental results show that the BB-BC can produce good quality solutions and comparable with some of the methods applied in the literature (with regards to Socha's benchmark instances).

KW - Big Bang-Big Crunch

KW - Post-enrolment course timetabling problem

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

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

U2 - 10.1109/ISDA.2010.5687114

DO - 10.1109/ISDA.2010.5687114

M3 - Conference contribution

AN - SCOPUS:79851470586

SN - 9781424481354

SP - 1448

EP - 1452

BT - Proceedings of the 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10

ER -