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

Illicit drug use costs the United States approximately $181 billion every year.

Did you know?

Anesthesia awareness is a potentially disturbing adverse effect wherein patients who have been paralyzed with muscle relaxants may awaken. They may be aware of their surroundings but unable to communicate or move. Neurologic monitoring equipment that helps to more closely check the patient's anesthesia stages is now available to avoid the occurrence of anesthesia awareness.

Did you know?

The average older adult in the United States takes five prescription drugs per day. Half of these drugs contain a sedative. Alcohol should therefore be avoided by most senior citizens because of the dangerous interactions between alcohol and sedatives.

Did you know?

Increased intake of vitamin D has been shown to reduce fractures up to 25% in older people.

Did you know?

To prove that stomach ulcers were caused by bacteria and not by stress, a researcher consumed an entire laboratory beaker full of bacterial culture. After this, he did indeed develop stomach ulcers, and won the Nobel Prize for his discovery.

For a complete list of videos, visit our video library