Evaluation of Genetic Algorithm and Hybrid Genetic Algorithm-Hill Climbing with Elitist for Lecturer University Timetabling Problem

Lecturer university timetabling is an NP-hard real-world problem still needs great attention. The occurrences of the creation of timetable in every university prior to semester starts are compulsory. Its inclusively must cater both hard and soft constraints to satisfy both lecturers and students as...

Full description

Bibliographic Details
Published in:ADVANCES IN SWARM INTELLIGENCE, ICSI 2019, PT I
Main Authors: Yusoff, Marina; Roslan, Nurhikmah
Format: Proceedings Paper
Language:English
Published: SPRINGER INTERNATIONAL PUBLISHING AG 2019
Subjects:
Online Access:https://www-webofscience-com.uitm.idm.oclc.org/wos/woscc/full-record/WOS:001315715800034
author Yusoff
Marina; Roslan
Nurhikmah
spellingShingle Yusoff
Marina; Roslan
Nurhikmah
Evaluation of Genetic Algorithm and Hybrid Genetic Algorithm-Hill Climbing with Elitist for Lecturer University Timetabling Problem
Computer Science
author_facet Yusoff
Marina; Roslan
Nurhikmah
author_sort Yusoff
spelling Yusoff, Marina; Roslan, Nurhikmah
Evaluation of Genetic Algorithm and Hybrid Genetic Algorithm-Hill Climbing with Elitist for Lecturer University Timetabling Problem
ADVANCES IN SWARM INTELLIGENCE, ICSI 2019, PT I
English
Proceedings Paper
Lecturer university timetabling is an NP-hard real-world problem still needs great attention. The occurrences of the creation of timetable in every university prior to semester starts are compulsory. Its inclusively must cater both hard and soft constraints to satisfy both lecturers and students as the space and time are highly concerned. Genetic Algorithm and Hybrid Genetic Algorithms-Hill Climbing with embedded with elitist mechanism are evaluated with the use of real data sets. The findings have shown Hybrid Genetic Algorithms-Hill Climbing with elitist outperformed Genetic Algorithm with elitist in obtaining an optimal solution. The beauty element offered by Hill Climbing seeking local best individual of the population has given fast convergences with the capability avoiding local optimum. In future, more soft constraints identification of a real problem of lecturer timetabling problem should very much considered as to ensure satisfactions of lecturers and students.
SPRINGER INTERNATIONAL PUBLISHING AG
0302-9743
1611-3349
2019
11655

10.1007/978-3-030-26369-0_34
Computer Science

WOS:001315715800034
https://www-webofscience-com.uitm.idm.oclc.org/wos/woscc/full-record/WOS:001315715800034
title Evaluation of Genetic Algorithm and Hybrid Genetic Algorithm-Hill Climbing with Elitist for Lecturer University Timetabling Problem
title_short Evaluation of Genetic Algorithm and Hybrid Genetic Algorithm-Hill Climbing with Elitist for Lecturer University Timetabling Problem
title_full Evaluation of Genetic Algorithm and Hybrid Genetic Algorithm-Hill Climbing with Elitist for Lecturer University Timetabling Problem
title_fullStr Evaluation of Genetic Algorithm and Hybrid Genetic Algorithm-Hill Climbing with Elitist for Lecturer University Timetabling Problem
title_full_unstemmed Evaluation of Genetic Algorithm and Hybrid Genetic Algorithm-Hill Climbing with Elitist for Lecturer University Timetabling Problem
title_sort Evaluation of Genetic Algorithm and Hybrid Genetic Algorithm-Hill Climbing with Elitist for Lecturer University Timetabling Problem
container_title ADVANCES IN SWARM INTELLIGENCE, ICSI 2019, PT I
language English
format Proceedings Paper
description Lecturer university timetabling is an NP-hard real-world problem still needs great attention. The occurrences of the creation of timetable in every university prior to semester starts are compulsory. Its inclusively must cater both hard and soft constraints to satisfy both lecturers and students as the space and time are highly concerned. Genetic Algorithm and Hybrid Genetic Algorithms-Hill Climbing with embedded with elitist mechanism are evaluated with the use of real data sets. The findings have shown Hybrid Genetic Algorithms-Hill Climbing with elitist outperformed Genetic Algorithm with elitist in obtaining an optimal solution. The beauty element offered by Hill Climbing seeking local best individual of the population has given fast convergences with the capability avoiding local optimum. In future, more soft constraints identification of a real problem of lecturer timetabling problem should very much considered as to ensure satisfactions of lecturers and students.
publisher SPRINGER INTERNATIONAL PUBLISHING AG
issn 0302-9743
1611-3349
publishDate 2019
container_volume 11655
container_issue
doi_str_mv 10.1007/978-3-030-26369-0_34
topic Computer Science
topic_facet Computer Science
accesstype
id WOS:001315715800034
url https://www-webofscience-com.uitm.idm.oclc.org/wos/woscc/full-record/WOS:001315715800034
record_format wos
collection Web of Science (WoS)
_version_ 1818940498155405312