As a business person you need to visit each of the following cities once. You need to start in Atlanta and end in Atlanta. Use the "Nearest Neighbor" Algorithm to find one of the cheaper routes to visit each city and return home again.
The algorithm employing "Nearest Neighbour" to determine one of the cheaper routes to visit every city and get back home again would be:
B). ATL-CHI-BOS-DEN-ATL
Algorithm is described as the compilation of sequenced steps that assist in resolving a mathematical problem.
This involves a step-by-step organization that assists in determining the final value post following the steps.
In the given scenario, the cheaper route to visit all the given cities once and returning home again would be beginning from Atlanta via Chicago, Boston, Denver, and returning back to Atlanta.
