Scribd Logo
Upload

Welcome to Scribd!

  • 130 views

    P6

    Uploaded by

    Dimitri Saunders
    The document describes a traveling salesman problem with 12 cities and the distances between each city pair. It provides the city names and numbers, and a distance matrix showing the miles between each city. It asks to find the shortest route that visits each city starting and ending in Brussels, which is 8822 miles along the route 4, 9, 11, 8, 6, 7, 10, 12, 2, 3, 5, 1, 4. If the tour does not need to end in Brussels, the shortest path through all cities starting in Brussels is 4, 9, 11, 8, 6, 7, 10, 12, 2, 3, 5, 1.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    P6

    Uploaded by

    Dimitri Saunders
    130 views2 pages
    The document describes a traveling salesman problem with 12 cities and the distances between each city pair. It provides the city names and numbers, and a distance matrix showing the miles between each city. It asks to find the shortest route that visits each city starting and ending in Brussels, which is 8822 miles along the route 4, 9, 11, 8, 6, 7, 10, 12, 2, 3, 5, 1, 4. If the tour does not need to end in Brussels, the shortest path through all cities starting in Brussels is 4, 9, 11, 8, 6, 7, 10, 12, 2, 3, 5, 1.

    Original Description:

    P6

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes a traveling salesman problem with 12 cities and the distances between each city pair. It provides the city names and numbers, and a distance matrix showing the miles between each city. It asks to find the shortest route that visits each city starting and ending in Brussels, which is 8822 miles along the route 4, 9, 11, 8, 6, 7, 10, 12, 2, 3, 5, 1, 4. If the tour does not need to end in Brussels, the shortest path through all cities starting in Brussels is 4, 9, 11, 8, 6, 7, 10, 12, 2, 3, 5, 1.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xlsx, pdf, or txt
    130 views2 pages

    P6

    Uploaded by

    Dimitri Saunders
    The document describes a traveling salesman problem with 12 cities and the distances between each city pair. It provides the city names and numbers, and a distance matrix showing the miles between each city. It asks to find the shortest route that visits each city starting and ending in Brussels, which is 8822 miles along the route 4, 9, 11, 8, 6, 7, 10, 12, 2, 3, 5, 1, 4. If the tour does not need to end in Brussels, the shortest path through all cities starting in Brussels is 4, 9, 11, 8, 6, 7, 10, 12, 2, 3, 5, 1.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xlsx, pdf, or txt
    of 2

    Traveling Salesman Problem

    Data

    Amsterdam
    Athens
    From Berlin
    Brussels
    Copenhagen
    Dublin
    Lisbon
    London
    Luxembourg
    Madrid
    Paris
    Rome

    1
    2
    3
    4
    5
    6
    7
    8
    9
    10
    11
    12

    Amsterdam
    1
    9999
    2166
    577
    175
    622
    712
    1889
    339
    319
    1462
    430
    1297

    Athens
    2
    2166
    9999
    1806
    2092
    2132
    2817
    2899
    2377
    1905
    2313
    2100
    1053

    Berlin
    3
    577
    1806
    9999
    653
    348
    1273
    2345
    912
    598
    1836
    878
    1184

    Brussels
    4
    175
    2092
    653
    9999
    768
    732
    1738
    300
    190
    1293
    262
    1173

    Copenhagen
    5
    622
    2132
    348
    768
    9999
    1203
    2505
    942
    797
    2046
    1027
    1527

    9
    190

    11
    293

    8
    331

    6
    440

    Decisions
    Tour
    Distances

    Objective
    Tour length

    8822

    Starting City

    Brussels

    What sequence achieves a minimum-distance tour of the cities, starting and ending in Brussels?
    4, 9, 11, 8, 6, 7, 10, 12, 2, 3, 5, 1, 4
    What is the length of the minimum-distance tour?
    8822 miles
    Suppose that Alastair need not return to Brussels, but can finish the tour in any of the cities.
    What sequence achieves a minimum-distance path through all the cities, starting in Brussels?
    4, 9, 11, 8, 6, 7, 10, 12, 2, 3, 5, 1

    Dublin
    6
    712
    2817
    1273
    732
    1203
    9999
    1656
    440
    914
    1452
    743
    1849

    Lisbon
    7
    1889
    2899
    2345
    1738
    2505
    1656
    9999
    1616
    1747
    600
    1482
    1907

    London
    8
    339
    2377
    912
    300
    942
    440
    1616
    9999
    475
    1259
    331
    1419

    To
    Luxembourg
    9
    319
    1905
    598
    190
    797
    914
    1747
    475
    9999
    1254
    293
    987

    7
    1656

    10
    600

    12
    1308

    2
    1053

    City Number

    Madrid
    10
    1462
    2313
    1836
    1293
    2046
    1452
    600
    1259
    1254
    9999
    1033
    1308

    Paris
    11
    430
    2100
    878
    262
    1027
    743
    1482
    331
    293
    1033
    9999
    1108

    Rome
    12
    1297
    1053
    1184
    1173
    1527
    1849
    1907
    1419
    987
    1308
    1108
    9999

    3
    1806

    5
    348

    1
    622

    Begin and end in same City?

    Yes

    g and ending in Brussels?

    ur in any of the cities.


    s, starting in Brussels?

    Yes
    No

    4
    175

    You might also like