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
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.