Genetic 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. / Thesis (M.Sc.)-University of Natal, Pietermaritzburg, 1996.
| Identifer | oai:union.ndltd.org:netd.ac.za/oai:union.ndltd.org:ukzn/oai:http://researchspace.ukzn.ac.za:10413/7369 |
| Date | January 1996 |
| Creators | McKenzie, Peter John Campbell. |
| Contributors | Petkov, Don. |
| Source Sets | South African National ETD Portal |
| Language | English |
| Detected Language | English |
| Type | Thesis |
Page generated in 0.0017 seconds