• Login
    View Item 
    •   ResearchSpace Home
    • College of Agriculture, Engineering and Science
    • School Mathematics, Statistics and Computer Science
    • Computer Science
    • Masters Degrees (Computer Science)
    • View Item
    •   ResearchSpace Home
    • College of Agriculture, Engineering and Science
    • School Mathematics, Statistics and Computer Science
    • Computer Science
    • Masters Degrees (Computer Science)
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Application of genetic algorithms to the travelling salesperson problem.

    Thumbnail
    View/Open
    Thesis. (6.215Mb)
    Date
    1996
    Author
    McKenzie, Peter John Campbell.
    Metadata
    Show full item record
    Abstract
    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.
    URI
    http://hdl.handle.net/10413/7369
    Collections
    • Masters Degrees (Computer Science) [79]

    DSpace software copyright © 2002-2013  Duraspace
    Contact Us | Send Feedback
    Theme by 
    @mire NV
     

     

    Browse

    All of ResearchSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsAdvisorsTypeThis CollectionBy Issue DateAuthorsTitlesSubjectsAdvisorsType

    My Account

    LoginRegister

    DSpace software copyright © 2002-2013  Duraspace
    Contact Us | Send Feedback
    Theme by 
    @mire NV