A multi-objective post enrolment course timetabling problems

A new case study

Salwani Abdullah, Hamza Turabieh, Barry McCollum, Paul McMullan

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

4 Citations (Scopus)

Abstract

This paper presents a multi-objective post enrolment course timetabling problem as a new case study. We added a new soft constraint to the original single objective problem to both increase the complexity and represent a real world course timetabling problem. The new soft constraint introduced here attempts to minimize the total number of waiting timeslots in between courses for every student in a day. We proposed a Non-dominated Sorting Genetic Algorithm-II with a variable population size, called NSGA-II VPS, based on a given lifetime for each individual that is evaluated at the time of its birth. The algorithm was tested on the standard benchmark problems and experimental results show that the proposed method demonstrably improved upon the original approach (NSGA-II).

Original languageEnglish
Title of host publication2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010
DOIs
Publication statusPublished - 2010
Event2010 6th IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010 - Barcelona
Duration: 18 Jul 201023 Jul 2010

Other

Other2010 6th IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010
CityBarcelona
Period18/7/1023/7/10

Fingerprint

Timetabling
Sorting
Genetic algorithms
Students
Soft Constraints
NSGA-II
Sorting algorithm
Population Size
Lifetime
Genetic Algorithm
Benchmark
Minimise
Experimental Results

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics

Cite this

Abdullah, S., Turabieh, H., McCollum, B., & McMullan, P. (2010). A multi-objective post enrolment course timetabling problems: A new case study. In 2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010 [5586227] https://doi.org/10.1109/CEC.2010.5586227

A multi-objective post enrolment course timetabling problems : A new case study. / Abdullah, Salwani; Turabieh, Hamza; McCollum, Barry; McMullan, Paul.

2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010. 2010. 5586227.

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

Abdullah, S, Turabieh, H, McCollum, B & McMullan, P 2010, A multi-objective post enrolment course timetabling problems: A new case study. in 2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010., 5586227, 2010 6th IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010, Barcelona, 18/7/10. https://doi.org/10.1109/CEC.2010.5586227
Abdullah S, Turabieh H, McCollum B, McMullan P. A multi-objective post enrolment course timetabling problems: A new case study. In 2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010. 2010. 5586227 https://doi.org/10.1109/CEC.2010.5586227
Abdullah, Salwani ; Turabieh, Hamza ; McCollum, Barry ; McMullan, Paul. / A multi-objective post enrolment course timetabling problems : A new case study. 2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010. 2010.
@inproceedings{d6fde8e5699041a79ff57d8b432f00c8,
title = "A multi-objective post enrolment course timetabling problems: A new case study",
abstract = "This paper presents a multi-objective post enrolment course timetabling problem as a new case study. We added a new soft constraint to the original single objective problem to both increase the complexity and represent a real world course timetabling problem. The new soft constraint introduced here attempts to minimize the total number of waiting timeslots in between courses for every student in a day. We proposed a Non-dominated Sorting Genetic Algorithm-II with a variable population size, called NSGA-II VPS, based on a given lifetime for each individual that is evaluated at the time of its birth. The algorithm was tested on the standard benchmark problems and experimental results show that the proposed method demonstrably improved upon the original approach (NSGA-II).",
author = "Salwani Abdullah and Hamza Turabieh and Barry McCollum and Paul McMullan",
year = "2010",
doi = "10.1109/CEC.2010.5586227",
language = "English",
isbn = "9781424469109",
booktitle = "2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010",

}

TY - GEN

T1 - A multi-objective post enrolment course timetabling problems

T2 - A new case study

AU - Abdullah, Salwani

AU - Turabieh, Hamza

AU - McCollum, Barry

AU - McMullan, Paul

PY - 2010

Y1 - 2010

N2 - This paper presents a multi-objective post enrolment course timetabling problem as a new case study. We added a new soft constraint to the original single objective problem to both increase the complexity and represent a real world course timetabling problem. The new soft constraint introduced here attempts to minimize the total number of waiting timeslots in between courses for every student in a day. We proposed a Non-dominated Sorting Genetic Algorithm-II with a variable population size, called NSGA-II VPS, based on a given lifetime for each individual that is evaluated at the time of its birth. The algorithm was tested on the standard benchmark problems and experimental results show that the proposed method demonstrably improved upon the original approach (NSGA-II).

AB - This paper presents a multi-objective post enrolment course timetabling problem as a new case study. We added a new soft constraint to the original single objective problem to both increase the complexity and represent a real world course timetabling problem. The new soft constraint introduced here attempts to minimize the total number of waiting timeslots in between courses for every student in a day. We proposed a Non-dominated Sorting Genetic Algorithm-II with a variable population size, called NSGA-II VPS, based on a given lifetime for each individual that is evaluated at the time of its birth. The algorithm was tested on the standard benchmark problems and experimental results show that the proposed method demonstrably improved upon the original approach (NSGA-II).

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

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

U2 - 10.1109/CEC.2010.5586227

DO - 10.1109/CEC.2010.5586227

M3 - Conference contribution

SN - 9781424469109

BT - 2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010

ER -