Show simple item record

dc.contributor.advisorPetkov, Doncho.
dc.creatorMcKenzie, Peter John Campbell.
dc.date.accessioned2012-10-20T10:33:59Z
dc.date.available2012-10-20T10:33:59Z
dc.date.created1996
dc.date.issued1996
dc.identifier.urihttp://hdl.handle.net/10413/7369
dc.descriptionThesis (M.Sc.)-University of Natal, Pietermaritzburg, 1996.en
dc.description.abstractGenetic Algorithms (GAs) can be easily applied to many different problems since they make few assumptions about the application domain and perform relatively well. They can also be modified with some success for handling a particular problem. The travelling salesperson problem (TSP) is a famous NP-hard problem in combinatorial optimization. As a result it has no known polynomial time solution. The aim of this dissertation will be to investigate the application of a number of GAs to the TSP. These results will be compared with those of traditional solutions to the TSP and with the results of other applications of the GA to the TSP.en
dc.language.isoenen
dc.subjectTheses--Computer science.en
dc.subjectTravelling salesperson problem.en
dc.subjectGenetic algorithms.en
dc.titleApplication of genetic algorithms to the travelling salesperson problem.en
dc.typeThesisen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record