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

Thyroid conditions may make getting pregnant impossible.

Did you know?

The oldest recorded age was 122. Madame Jeanne Calment was born in France in 1875 and died in 1997. She was a vegetarian and loved olive oil, port wine, and chocolate.

Did you know?

Intradermal injections are somewhat difficult to correctly administer because the skin layers are so thin that it is easy to accidentally punch through to the deeper subcutaneous layer.

Did you know?

Certain chemicals, after ingestion, can be converted by the body into cyanide. Most of these chemicals have been removed from the market, but some old nail polish remover, solvents, and plastics manufacturing solutions can contain these substances.

Did you know?

A serious new warning has been established for pregnant women against taking ACE inhibitors during pregnancy. In the study, the risk of major birth defects in children whose mothers took ACE inhibitors during the first trimester was nearly three times higher than in children whose mothers didn't take ACE inhibitors. Physicians can prescribe alternative medications for pregnant women who have symptoms of high blood pressure.

For a complete list of videos, visit our video library