Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/7183
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mohammed, Mazin Abed | - |
dc.contributor.author | Ghani, Mohd khanapi Abd | - |
dc.contributor.author | Mostafa, Salama A. | - |
dc.contributor.author | Ibrahim, Dheyaa Ahmed | - |
dc.date.accessioned | 2022-10-27T10:07:30Z | - |
dc.date.available | 2022-10-27T10:07:30Z | - |
dc.date.issued | 2017 | - |
dc.identifier.issn | 1816-949X | - |
dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/7183 | - |
dc.description.abstract | University of Anbar like whatever other universities of higher education, faces comparable issue and is utilized as real case in this study. Setting up the examination timetable takes a significant part of the department head’s role and it includes all the distinctive tools the errand is overpowering. Timetabling is confounded because of various reasons table such as limited time to create schedule, number of halls usually is specific, number of staff work 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 achieve 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 including 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 showed the ability to evaluate the performance of SS between the different operators, hence identifying the best results. The adaptive mutation demonstrated its ability as well to provide variety in the generations and as result the SS was able to exploremore variety of solutions and then better solution was found. The optimal settings and configurations found have demonstrated their accurateness and suitability to produce better quality timetable representing very good solution to the problem being addressed. The proposed technique 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 generations | en_US |
dc.publisher | Journal of Engineering And Applied Sciences | en_US |
dc.relation.ispartofseries | 12;8 | - |
dc.subject | Scatter Search Algorithm | en_US |
dc.subject | Timetabling | en_US |
dc.title | Using Scatter Search Algorithm in Implementing Examination Timetabling Problem | en_US |
dc.type | Article | en_US |
Appears in Collections: | قسم نظم المعلومات |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
4792-4800.pdf | 387.41 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.