Show simple item record

dc.contributor.authorAlam, Md. Ashraful
dc.contributor.authorIslam, Toushika
dc.contributor.authorJoseph, Duke
dc.date.accessioned2016-01-20T12:29:50Z
dc.date.available2016-01-20T12:29:50Z
dc.date.issued2015
dc.identifier.otherID 12101108
dc.identifier.otherID 11101002
dc.identifier.otherID 10201038
dc.identifier.urihttp://hdl.handle.net/10361/4902
dc.descriptionThis thesis report is submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2015.en_US
dc.description.abstractA study on course timetabling problem which is a combinatorial optimization NP-hard problem. The aim of this thesis is to find optimal or near optimal solution of course scheduling for Computer Science and Engineering Department of BRAC University. Different solution methods for course timetabling exist hence in this thesis Genetic Algorithms is used to generate feasible solution and Q-learning is action for evaluating results. Experimental data sets are parsed from a given structure. Different constraints are handled with discrete fitness evaluation. Schedule conflicts are handled after producing random generation. Finally, results are tested according to their performance and presented with a feasible representation mode.en_US
dc.language.isoenen_US
dc.publisherBRAC Universityen_US
dc.subjectComputer science and engineeringen_US
dc.titleSolving university course scheduling problem using genetic algorithm and analyzing results with other algorithmsen_US
dc.typeThesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record