loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Siti Khatijah Nor Abdul Rahim 1 ; Andrzej Bargiela 2 and Rong Qu 3

Affiliations: 1 University of Nottingham (Malaysia Campus) and Universiti Teknologi MARA (Perak), Malaysia ; 2 University of Nottingham Jubilee Campus and Cracow Technical University, United Kingdom ; 3 University of Nottingham Jubilee Campus, United Kingdom

Keyword(s): Slots Permutations, Hill Climbing (HC), Genetic Algorithm (GA).

Related Ontology Subjects/Areas/Topics: Agents ; Artificial Intelligence ; Bioinformatics ; Biomedical Engineering ; Enterprise Information Systems ; Information Systems Analysis and Specification ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Methodologies and Technologies ; Operational Research ; Optimization ; Simulation ; Symbolic Systems

Abstract: In this paper, we compare the incorporation of Hill Climbing (HC) and Genetic Algorithm (GA) optimization in our proposed methodology in solving the examination scheduling problem. It is shown that our greedy HC optimization outperforms the GA in all cases when tested on the benchmark datasets. In our implementation, HC consumes more time to execute compared to GA which manages to improve the quality of the initial schedules in a very fast and efficient time. Despite this, since the amount of time taken by HC in producing improved schedules is considered reasonable and it never fails to produce better results, it is suggested that we incorporate the Hill Climbing optimization rather than GA in our work.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.15.156.140

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Rahim, S.; Bargiela, A. and Qu, R. (2013). Hill Climbing versus Genetic Algorithm Optimization in Solving the Examination Timetabling Problem. In Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems - ICORES; ISBN 978-989-8565-40-2; ISSN 2184-4372, SciTePress, pages 43-52. DOI: 10.5220/0004286600430052

@conference{icores13,
author={Siti Khatijah Nor Abdul Rahim. and Andrzej Bargiela. and Rong Qu.},
title={Hill Climbing versus Genetic Algorithm Optimization in Solving the Examination Timetabling Problem},
booktitle={Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems - ICORES},
year={2013},
pages={43-52},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004286600430052},
isbn={978-989-8565-40-2},
issn={2184-4372},
}

TY - CONF

JO - Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems - ICORES
TI - Hill Climbing versus Genetic Algorithm Optimization in Solving the Examination Timetabling Problem
SN - 978-989-8565-40-2
IS - 2184-4372
AU - Rahim, S.
AU - Bargiela, A.
AU - Qu, R.
PY - 2013
SP - 43
EP - 52
DO - 10.5220/0004286600430052
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic