I have been trying to find examples of major research studies examining the properties and performance of the "Branch and Bound" Algorithm compared to "Evolutionary Algorithms".
For instance, in terms of popular types of mixed integer programming and combinatorics optimization problems (e.g. scheduling, knapsack problem, traveling salesman problem, etc.), have we developed any common consensus on "Branch and Bound" vs "Evolutionary Algorithms"?
It would be very interesting to learn more about which of these two types of algorithms (Branch and Bound vs Evolutionary Algorithms) are preferred in the Operations Research Industry for solving different types of mixed integer programming and combinatorics optimization problems. Perhaps there might be some tradeoffs, for example:
- Branch and Bound works better when the search space is bigger
- Evolutionary Algorithms take less time to run