Change search
ReferencesLink to record
Permanent link

Direct link
Description and Application of Genetic Algorithm
Blekinge Institute of Technology, School of Engineering.
2012 (English)Independent thesis Advanced level (degree of Master (Two Years))Student thesis
Abstract [en]

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.
Keyword [en]
Genetic Algorithm (GA), Time Table Problem (TTP), Selection, Crossover, Mutation
National Category
Mathematical Analysis Mathematics
URN: urn:nbn:se:bth-2362Local ID: diva2:829634
Physics, Chemistry, Mathematics
Available from: 2015-04-22 Created: 2012-06-08 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(1521 kB)98 downloads
File information
File name FULLTEXT01.pdfFile size 1521 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
School of Engineering
Mathematical AnalysisMathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 98 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 121 hits
ReferencesLink to record
Permanent link

Direct link