Description and Application of Genetic Algorithm
Independent thesis Advanced level (degree of Master (Two Years))Student thesis
Genetic Algorithm (GA) as a class of Evolutionary Algorithm (EA) is a search algorithm based on the mechanics of natural selection and natural genetics. This dissertation presents the description, solving procedures and application of GA. The definitions of selection, crossover and mutation operators are given in details and an application based on GA in Time Table Problem (TTP) is performed in a new way. Due to its high capability of overall search, GA is particularly appropriate for solving timetabling and scheduling problems. TTP (Time Table Problem) which belongs to NP-hard problem is a special problem concerning resource management. In this dissertation, a new chromosome coding is designed in order to solve TTP more effectively. And the result presented by MATLAB will converge to a steady condition.
Place, publisher, year, edition, pages
2012. , 60 p.
Genetic Algorithm (GA), Time Table Problem (TTP), Selection, Crossover, Mutation
Mathematical Analysis Mathematics
IdentifiersURN: urn:nbn:se:bth-2362Local ID: oai:bth.se:arkivex22D33C8210FBDF2CC1257A170078279FOAI: oai:DiVA.org:bth-2362DiVA: diva2:829634
UppsokPhysics, Chemistry, Mathematics