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 2606 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?

The first war in which wide-scale use of anesthetics occurred was the Civil War, and 80% of all wounds were in the extremities.

Did you know?

Malaria mortality rates are falling. Increased malaria prevention and control measures have greatly improved these rates. Since 2000, malaria mortality rates have fallen globally by 60% among all age groups, and by 65% among children under age 5.

Did you know?

Though methadone is often used to treat dependency on other opioids, the drug itself can be abused. Crushing or snorting methadone can achieve the opiate "rush" desired by addicts. Improper use such as these can lead to a dangerous dependency on methadone. This drug now accounts for nearly one-third of opioid-related deaths.

Did you know?

The senior population grows every year. Seniors older than 65 years of age now comprise more than 13% of the total population. However, women outlive men. In the 85-and-over age group, there are only 45 men to every 100 women.

Did you know?

Blood in the urine can be a sign of a kidney stone, glomerulonephritis, or other kidney problems.

For a complete list of videos, visit our video library