Basic Metaheuristic Optimization Algorithms
Pedro Ponce Cruz, Arturo Molina, Ricardo A. Ramírez-Mendoza, Efrain Mendez-Flores, Alexandro Antonio Ortiz Espinoza, David Christopher Balderas Silva · 2020
The most basic form of search is to look at all possible solutions and to decide which one is the best. This method is called exhaustive search or brute force method. Although this search ideally guarantees the finding of an optimal solution, the time it requires is high, and in some cases, it is inefficient. As an alternative, it is possible to use an algorithm that limits the search using some kind of heuristics.