Optimizing TSP Routes with Branch & Bound Technique
Develop a branch & bound algorithm for the Travelling Salesman Problem (TSP). The algorithm should: (a) Set up partial routes by calculating a lower bound cost using a cost matrix reduction method. Explain how you derive the lower bound for each partial route. (b) Describe how you prune suboptimal solutions during the optimization process. Illustrate […]