University examination timetabling algorithm based on genetic algorithm / (Record no. 442)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 02472nam a2200241 4500 |
001 - CONTROL NUMBER | |
control field | UPMIN-00000010139 |
003 - CONTROL NUMBER IDENTIFIER | |
control field | UPMIN |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20221205103606.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 221205b |||||||| |||| 00| 0 eng d |
040 ## - CATALOGING SOURCE | |
Original cataloging agency | DLC |
Transcribing agency | UPMin |
Modifying agency | upmin |
041 ## - LANGUAGE CODE | |
Language code of text/sound track or separate title | eng |
090 #0 - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN) | |
Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) | LG993.5 2004 |
Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) | A64 C36 |
100 1# - MAIN ENTRY--PERSONAL NAME | |
Personal name | Capacillo, Annie C. |
9 (RLIN) | 317 |
245 00 - TITLE STATEMENT | |
Title | University examination timetabling algorithm based on genetic algorithm / |
Statement of responsibility, etc. | Annie C. Capacillo |
260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
Date of publication, distribution, etc. | 2004 |
300 ## - PHYSICAL DESCRIPTION | |
Extent | 53 leaves |
502 ## - DISSERTATION NOTE | |
Dissertation note | Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2004 |
520 3# - SUMMARY, ETC. | |
Summary, etc. | Examination timetabling deals with the scheduling of exams to the set of time slots subject to some constraints. Genetic algorithm was used as framework in making the examination timetabling algorithm. An algorithm for each genetic algorithm operators such as initialization, evaluation, selection, recombination, repair and mutation was developed to apply in the examination timetabling problem. The examination timetabling algorithm developed start with obtaining the initial population then evaluating each timetable and the population. After which, the parent timetables are selected and then recombined to produce a new set of populations. The recombined timetable is repaired to maintain feasibility and mutated afterwards. Whichever of the repaired and mutated population has the higher evaluation is compared to the previous population. If the produced population has the higher evaluation than the previous population, it will undergo the same process again, else the iteration stops and the previous population will be the set of the final timetables. The algorithm also end if the number of iteration predetermined is reached. Using the data of the University of the Philippines in Mindanao, the evaluation of the population after three iterations is higher by 0.093015262 compared with the initial population. Since this was done manually, it is recommended to encode the algorithm into a computer program. This study presented only one process of the possible combination of initialization, evaluation, selection, recombination, repair and mutation. It is thus recommended to experiment on the combination of these genetic algorithm operators in order to understand better and improve the performance of the genetic algorithm applied to the timetabling problem. |
658 ## - INDEX TERM--CURRICULUM OBJECTIVE | |
Main curriculum objective | Undergraduate Thesis |
Curriculum code | AMAT200 |
905 ## - LOCAL DATA ELEMENT E, LDE (RLIN) | |
a | Fi |
905 ## - LOCAL DATA ELEMENT E, LDE (RLIN) | |
a | UP |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Source of classification or shelving scheme | Library of Congress Classification |
Koha item type | Thesis |
Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Status | Collection | Home library | Current library | Shelving location | Date acquired | Source of acquisition | Accession Number | Total Checkouts | Full call number | Barcode | Date last seen | Koha item type | Price effective from |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Library of Congress Classification | Not For Loan | Preservation Copy | University Library | University Library | Theses | 2005-03-22 | donation | UAR-T-gd511 | LG993.5 2004 A64 C36 | 3UPML00021484 | 2022-09-21 | Thesis | |||||
Library of Congress Classification | Not For Loan | Room-Use Only | College of Science and Mathematics | University Library | Theses | 2005-03-01 | donation | CSM-T-gd1205 | LG993.5 2004 A64 C36 | 3UPML00011308 | 2022-09-21 | Thesis | 2022-09-21 |