Analysis of Brute Force and Branch & Bound Algorithms to solve the Traveling Salesperson Problem (TSP)
Main Article Content
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
Metrics
Article Details
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.