1. Start from node 1 and use the myopic (greedy) approach to determine a suboptimal Hamiltonian cycle. Write down the route you have found and the total traveled distance.
2. Start from node 5 and use the myopic (greedy) approach to determine a Hamiltonian cycle. Write down the route you have found and the total traveled distance.
3. Consider node 1 as the depot and use Clarke & Wright Heuristic to find a suboptimal Hamiltonian cycle. You need to show your savings table, the ordered list of edges according to decreasing savings, and explain how you have found the final solution. Write down the route you have found and the total traveled distance.

1. Consider the network that is represented by the following direct distance matrix. Our objective is to identify the shortest Hamiltonian cycle. Cij 1 2 3 1 2 3 45 6 7 0 34 21 49 64 55 97 34 0 35 21 34 47 94 21 350 43 56 36 76 49 21 43 0 14 36 64 34 56 14 0 41 82 55 47 36 36 41 0 47 97 94 76 81 82 47 0 81 4 5 6 7