Operations Research for Technology and Innovation Management
Winter Term 2020 / 21
Travelling salesman problem
List of contents
Introduction
Problem
Solution
Summary
References
Introduction
Travelling salesman problem
Problem definition
Below is the list of 13 cities in Europe.
As part of the problem, we need to determine the best Travelling Salesman Tour for these set of
cities. Following needs to be considered while solving the instance of Travelling salesman problem:
a. This needs to be solved using at least one of the methods for determining a lower bound and
b. To be solved using at least one of the heuristic methods.
c. Solution should be optimal by using Branch and Bound.
Solution
a) We determine lower bound using Kruskal algorithm :
Lower bound value = 1494.49
b) We use Nearest insertion algorithm as one of the heuristic methods :
Summary
References