Implementation Branch And Bound Algorithm For Travelling Salesman Problem
Daftar Isi:
- Traveling Salesman Problem is one of Ihe most intensively studied problems in computational mathematics. Travelling Salesman problem is a problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwisc distances, the task is to find a shortest possible tour that visits each city exactly once. Travelling Salesman Problem was invented by Hassler Whitney at Princeton. In the 1950s and 1960s, the problem became increasingly popular in scientific circles in Europe and the USA. These problems will be solved with branch and bound algorithm and using tree data structures. Branch and Bound was first proposed by A.H Land and A.G Dotg in 1960. Branch and bound is a general algorithm for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization. It consists of a systematic enumeration of all candidate solutions, where large subsets of fruitless candidates are discarded en masse, by using upper and lower estimated bounds of the quantity being optimized.