engleski

Solving the travelling salesman problem using the branch and bound method

The goal of this paper is to optimize delivering of packages at five randomly chosen addresses in the city of Rijeka. This problem is also known as the Travelling Salesman Problem and it is an NP hard problem. To achieve this goal, the concepts of a Hamilton path and cycle, as well as a Hamilton graph are defined. The theoretical basis for the branch and bound method is also given. The use of this method in the process of finding a solution for a problem is provided at the end of this paper.

Travelling Salesman Problem, Branch and Bound Method, Hamilton path, Hamilton cycle, NP complete problem, NP hard problem

nije evidentirano