• Login
    View Item 
    •   Carroll Scholars Home
    • Mathematics, Engineering and Computer Science
    • Mathematics, Engineering and Computer Science Undergraduate Theses
    • View Item
    •   Carroll Scholars Home
    • Mathematics, Engineering and Computer Science
    • Mathematics, Engineering and Computer Science Undergraduate Theses
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    The Traveling Salesperson Problem: A Look At NP-Completeness and Methods For Finding Solutions

    Thumbnail
    View/Open
    2002_WendtT_THS_000883.pdf (35.54Mb)
    Author
    Wendt, Theodore
    Advisor
    Holly Zullo; Mark Parker; Joan Stottlemyer
    Date of Issue
    2002-04-01
    Metadata
    Show full item record
    URI
    https://scholars.carroll.edu/handle/20.500.12647/3460
    Title
    The Traveling Salesperson Problem: A Look At NP-Completeness and Methods For Finding Solutions
    Type
    thesis
    Abstract
    Finding an efficient algorithm for solving NP-Complete problems has long been a goal of computer scientists and mathematicians. The purpose of this paper is to examine existing heuristics (approximate algorithms) and to construct original heuristics for solving the Traveling Salesperson Problem, a famous NP-Complete problem. Each heuristic is implemented on a personal computer using C++. The results of the heuristics are then compared against the best known solutions for specific well-studied instances of the problem.
    Degree Awarded
    Bachelor's
    Semester
    Spring
    Department
    Mathematics, Engineering & Computer Science
    Collections
    • Mathematics, Engineering and Computer Science Undergraduate Theses

    Browse

    All of Carroll ScholarsCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    DSpace software copyright © 2002-2023  DuraSpace
    DSpace Express is a service operated by 
    Atmire NV