Analysis of Brute Force and Branch & Bound Algorithms to solve the Traveling Salesperson Problem (TSP)

Main Article Content

Sriyani Violina

Abstract

 Brute Force and Branch & Bound algorithms are two methods commonly used to solve optimization problems. Some examples of problems that can be solved by both Brute Force and Branch & Bound are the Knapsack Problem, Traveling Salesman Problem, Scheduling Problem and many other optimization problems. The solution to the TSP problem with the Brute Force algorithm always reaches the optimal solution, but it takes time and a long stage and will get into trouble if the number of cities increases. The Branch and Bound algorithm can solve the TSP problem more efficiently because it does not calculate all possibilities.

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

Article Details

How to Cite
Sriyani Violina. (2021). Analysis of Brute Force and Branch & Bound Algorithms to solve the Traveling Salesperson Problem (TSP). Turkish Journal of Computer and Mathematics Education (TURCOMAT), 12(8), 1226–1229. Retrieved from https://turcomat.org/index.php/turkbilmat/article/view/3031
Section
Research Articles