This topic contains a solution. Click here to go to the answer

Author Question: A mail truck must deliver packages to 5 different homes (A, B, C, D, and E). The trip must start and ... (Read 2074 times)

809779

  • Hero Member
  • *****
  • Posts: 579
A mail truck must deliver packages to 5 different homes (A, B, C, D, and E). The trip must start and end at A. The graph below shows the distances (in miles) between locations. We want to minimize the total distance traveled.



The repetitive nearest-neighbor tour starting with vertex A is given by:
◦ A, B, C, D, E, A.
◦ A, E, C, D, B, A.
◦ A, D, B, E, C, A.
◦ A, C, D, B, E, A.
◦ none of these


Related Topics

Need homework help now?

Ask unlimited questions for free

Ask a Question

ahriuashd

  • Hero Member
  • *****
  • Posts: 535
A mail truck must deliver packages to 5 different homes (A, B, C, D, and E). The trip must start and end at A. The graph below shows the distances (in miles) between locations. We want to minimize the total distance traveled.



The cheapest-link tour starting with vertex A is given by:
◦ A, D, B, E, C, A.
◦ A, E, C, D, B, A.
◦ A, C, D, B, E, A.
◦ A, B, C, D, E, A.
◦ none of these




future617RT

  • Hero Member
  • *****
  • Posts: 543
A mail truck must deliver packages to 5 different homes (A, B, C, D, and E). The trip must start and end at A. The graph below shows the distances (in miles) between locations. We want to minimize the total distance traveled.



The cheapest-link tour starting with vertex A is given by:
◦ A, D, B, E, C, A.
◦ A, E, C, D, B, A.
◦ A, B, C, D, E, A.
◦ A, C, D, B, E, A.
◦ none of these




shofmannx20

  • Hero Member
  • *****
  • Posts: 562
A mail truck must deliver packages to 5 different homes (A, B, C, D, and E). The trip must start and end at A. The graph below shows the distances (in miles) between locations. We want to minimize the total distance traveled.



The shortest trip in this situation can be found using
◦ the cheapest-link algorithm.
◦ the nearest-neighbor algorithm.
◦ both the nearest-neighbor and the cheapest-link algorithms.
◦ the repetitive nearest-neighbor algorithm.
◦ all of these algorithms give the shortest trip in this situation.



Laurenleakan

  • Sr. Member
  • ****
  • Posts: 309
the repetitive nearest-neighbor algorithm.



anjilletteb

  • Hero Member
  • *****
  • Posts: 569
A mail truck must deliver packages to 5 different homes (A, B, C, D, and E). The trip must start and end at A. The graph below shows the distances (in miles) between locations. We want to minimize the total distance traveled.



Using both the cheapest-link and the repetitive nearest-neighbor algorithm, the length of the shortest trip we can find (without using brute force) is:
◦ 28 miles.
◦ 68 miles.
◦ 58 miles.
◦ 57 miles.
◦ none of these




 

Did you know?

When taking monoamine oxidase inhibitors, people should avoid a variety of foods, which include alcoholic beverages, bean curd, broad (fava) bean pods, cheese, fish, ginseng, protein extracts, meat, sauerkraut, shrimp paste, soups, and yeast.

Did you know?

Alzheimer's disease affects only about 10% of people older than 65 years of age. Most forms of decreased mental function and dementia are caused by disuse (letting the mind get lazy).

Did you know?

The Romans did not use numerals to indicate fractions but instead used words to indicate parts of a whole.

Did you know?

The U.S. Preventive Services Task Force recommends that all women age 65 years of age or older should be screened with bone densitometry.

Did you know?

Hippocrates noted that blood separates into four differently colored liquids when removed from the body and examined: a pure red liquid mixed with white liquid material with a yellow-colored froth at the top and a black substance that settles underneath; he named these the four humors (for blood, phlegm, yellow bile, and black bile).

For a complete list of videos, visit our video library