Scribd Logo
Upload

Welcome to Scribd!

  • ANS!

    Uploaded by

    John Aeron So Abrina
    6 views1 page
    The document describes two methods for solving the Travelling Salesperson Problem: the Nearest Neighbor method and the Cheapest Link method. The Nearest Neighbor method involves selecting a random starting city and then traveling to the nearest neighboring cities in order of shortest distance. This results in a path of A->B->D->E->F->C with a total distance of 63. The Cheapest Link method finds the cheapest links between cities to form a path, in this case C->B->D->E->A->F, also with a total distance of 63.

    Original Description:

    answer to

    Original Title

    ANS! (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes two methods for solving the Travelling Salesperson Problem: the Nearest Neighbor method and the Cheapest Link method. The Nearest Neighbor method involves selecting a random starting city and then traveling to the nearest neighboring cities in order of shortest distance. This results in a path of A->B->D->E->F->C with a total distance of 63. The Cheapest Link method finds the cheapest links between cities to form a path, in this case C->B->D->E->A->F, also with a total distance of 63.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views1 page

    ANS!

    Uploaded by

    John Aeron So Abrina
    The document describes two methods for solving the Travelling Salesperson Problem: the Nearest Neighbor method and the Cheapest Link method. The Nearest Neighbor method involves selecting a random starting city and then traveling to the nearest neighboring cities in order of shortest distance. This results in a path of A->B->D->E->F->C with a total distance of 63. The Cheapest Link method finds the cheapest links between cities to form a path, in this case C->B->D->E->A->F, also with a total distance of 63.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Answer the following problem

    Using the 2 different Travelling Salesperson Problem methods.

    (Nearest Neighbor Method and Cheapest Link Method)

    Ans.
    Nearest Neighbor method- it’s saying that selecting any random city and then reaching to the
    nearest neighbor cities i.e., with shortest distance.
    g A B D E F C
    12 + 3 + 4 + 16 + 28 = 63
    Cheapest link method
    Same distance can be also be assured by path.
    C B D E A F
    19 + 3 + 4 + 13 + 24 = 63

    You might also like