Travelling Salesman Problem (TSP): Given the following distance matrix, use the nearest neighbor (NN) heuristic to find a route that starts from the warehouse (W), visits each customer only once, and finishes at the warehouse to minimize the distance traveled. What is the route and the corresponding distance? Distances W 1 2 3 4 in miles w 18 57 27 50 18 0 65 29 61 57 65 36 99 3 27 29 36 0 76 4 50 61 99 76 0 Route=W-1-3-2-4, Distance=182 miles Route=W-3-1-2-4-W, Distance=270 miles Route = W-3-1-2-4, Distance=220 miles Route=W-1-3-2-4-W, Distance=232 miles Route=W-1-3-4-2, Distance=272 miles 1, 2.
Travelling Salesman Problem (TSP): Given the following distance matrix, use the nearest neighbor (NN) heuristic to find a route that starts from the warehouse (W), visits each customer only once, and finishes at the warehouse to minimize the distance traveled. What is the route and the corresponding distance? Distances W 1 2 3 4 in miles w 18 57 27 50 18 0 65 29 61 57 65 36 99 3 27 29 36 0 76 4 50 61 99 76 0 Route=W-1-3-2-4, Distance=182 miles Route=W-3-1-2-4-W, Distance=270 miles Route = W-3-1-2-4, Distance=220 miles Route=W-1-3-2-4-W, Distance=232 miles Route=W-1-3-4-2, Distance=272 miles 1, 2.
Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter2: Introduction To Spreadsheet Modeling
Section: Chapter Questions
Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...
Related questions
Question
![Travelling Salesman Problem (TSP); Given the following distance matrix, use the nearest neighbor
(NN) heuristic to find a route that starts from the warehouse (W), visits each customer only once,
and finishes at the warehouse to minimize the distance traveled. What is the route and the
corresponding distance?
Distances
W 1 2 3 4
in miles
18
57
27
50
18 0 65
29
61
57
65
0 36
99
3
27
29
36 0 76
4
50
61
99
76
Route=W-1-3-2-4, Distance=182 miles
Route=W-3-1-2-4-W, Distance=270 miles
Route = W-3-1-2-4, Distance=220 miles
Route=W-1-3-2-4-W, Distance=232 miles
Route=W-1-3-4-2, Distance=272 miles
1,
2.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Faba1a10a-1592-4d9d-84a1-a9a034aea59f%2Fc15df5e0-e068-4076-b64e-d444e93bce08%2F456hwdp_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Travelling Salesman Problem (TSP); Given the following distance matrix, use the nearest neighbor
(NN) heuristic to find a route that starts from the warehouse (W), visits each customer only once,
and finishes at the warehouse to minimize the distance traveled. What is the route and the
corresponding distance?
Distances
W 1 2 3 4
in miles
18
57
27
50
18 0 65
29
61
57
65
0 36
99
3
27
29
36 0 76
4
50
61
99
76
Route=W-1-3-2-4, Distance=182 miles
Route=W-3-1-2-4-W, Distance=270 miles
Route = W-3-1-2-4, Distance=220 miles
Route=W-1-3-2-4-W, Distance=232 miles
Route=W-1-3-4-2, Distance=272 miles
1,
2.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.Recommended textbooks for you
![Practical Management Science](https://www.bartleby.com/isbn_cover_images/9781337406659/9781337406659_smallCoverImage.gif)
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
![Operations Management](https://www.bartleby.com/isbn_cover_images/9781259667473/9781259667473_smallCoverImage.gif)
Operations Management
Operations Management
ISBN:
9781259667473
Author:
William J Stevenson
Publisher:
McGraw-Hill Education
![Operations and Supply Chain Management (Mcgraw-hi…](https://www.bartleby.com/isbn_cover_images/9781259666100/9781259666100_smallCoverImage.gif)
Operations and Supply Chain Management (Mcgraw-hi…
Operations Management
ISBN:
9781259666100
Author:
F. Robert Jacobs, Richard B Chase
Publisher:
McGraw-Hill Education
![Practical Management Science](https://www.bartleby.com/isbn_cover_images/9781337406659/9781337406659_smallCoverImage.gif)
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
![Operations Management](https://www.bartleby.com/isbn_cover_images/9781259667473/9781259667473_smallCoverImage.gif)
Operations Management
Operations Management
ISBN:
9781259667473
Author:
William J Stevenson
Publisher:
McGraw-Hill Education
![Operations and Supply Chain Management (Mcgraw-hi…](https://www.bartleby.com/isbn_cover_images/9781259666100/9781259666100_smallCoverImage.gif)
Operations and Supply Chain Management (Mcgraw-hi…
Operations Management
ISBN:
9781259666100
Author:
F. Robert Jacobs, Richard B Chase
Publisher:
McGraw-Hill Education
![Business in Action](https://www.bartleby.com/isbn_cover_images/9780135198100/9780135198100_smallCoverImage.gif)
![Purchasing and Supply Chain Management](https://www.bartleby.com/isbn_cover_images/9781285869681/9781285869681_smallCoverImage.gif)
Purchasing and Supply Chain Management
Operations Management
ISBN:
9781285869681
Author:
Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:
Cengage Learning
![Production and Operations Analysis, Seventh Editi…](https://www.bartleby.com/isbn_cover_images/9781478623069/9781478623069_smallCoverImage.gif)
Production and Operations Analysis, Seventh Editi…
Operations Management
ISBN:
9781478623069
Author:
Steven Nahmias, Tava Lennon Olsen
Publisher:
Waveland Press, Inc.