Publication:
Using scatter search algorithm in implementing examination timetabling problem

Simple item page
dc.citedby15
dc.contributor.authorMohammed M.A.en_US
dc.contributor.authorGhani M.K.A.en_US
dc.contributor.authorMostafa S.A.en_US
dc.contributor.authorIbrahim D.A.en_US
dc.contributor.authorid57192089894en_US
dc.contributor.authorid24491611800en_US
dc.contributor.authorid37036085800en_US
dc.contributor.authorid57191545030en_US
dc.date.accessioned2023-05-29T06:39:48Z
dc.date.available2023-05-29T06:39:48Z
dc.date.issued2017
dc.description.abstractUniversity of Anbar like whatever other universities of higher education, faces comparable issue and is utilized as real case in hs study. Setting up the examination timetable takes a significant paJt of the depaJtment head's role and it includes all the dstinctive tools the errand is overpowering. Timetabling is confounded because of various reasom table such as limited time to create schedule, number of halls usually is specific, number of staffwork on create timetable is limited and etc. Attempt to find an optimal result for timetable scheduling of Anbar university by using Scatter Search Algorithm (SSA). To acheve an optimal solution for timetable scheduling of Anbar university with the accompanying targets: to create a tool for final examination time tabling for the colleges in university of Anbar and to investigate the efficiency and the performance of the SSA operators includng adaptive mutation and other schemes on the SS. The approach has been presented to improve the efficiency and accuracy of scheduling examination timetables and improve the speed of preparing the schedule. The study investigates the most suitable parameters of Scatter Search algorithm for the population based algorithm. The findings outcome from this study have shown that. The results showedthe ability to evaluate the performance of SS between the dfferent operators, hence identifying the best results. The adaptive mutation demomtrated its ability as well to provide variety in the generations and as result the SS was able to explore more variety of solutions and then better solution was found. The optimal settings and configurations found have demomtrated their accurateness and suitability to produce better quality timetable representing veIy good solution to the problem being addressed. The proposed techmque is tested and validated with real case study data and the results are satisfactory The SS performance is examined in light of the varieties of the chose parameters. The best outcomes are gotten in direct population of 50 tests, 150 generatiom. � Medwell Journals, 2017.en_US
dc.description.natureFinalen_US
dc.identifier.epage4800
dc.identifier.issue18
dc.identifier.scopus2-s2.0-85042162679
dc.identifier.spage4792
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85042162679&partnerID=40&md5=4a2880b339c852bab428d3127fbcea5c
dc.identifier.urihttps://irepository.uniten.edu.my/handle/123456789/23366
dc.identifier.volume12
dc.publisherMedwell Journalsen_US
dc.sourceScopus
dc.sourcetitleJournal of Engineering and Applied Sciences
dc.titleUsing scatter search algorithm in implementing examination timetabling problemen_US
dc.typeArticleen_US
dspace.entity.typePublication
Files
Collections
SCOPUS