Chaotic Maps and Meta-heuristic Algorithms
摘要
In meta-heuristic algorithms, two important stages of exploration and exploitation are considered in order to converge towards optimal answers. In the exploration phase, we settle on the points of the search space that have a privileged strategy, and in the exploitation phase, we carefully examine the area related to the neighborhood of the selected points. The Random Search algorithm (RS) is a fully exploration algorithm, while the Hill Climbing algorithm (HC) and Tabu Search algorithms (TS) are fully exploitation.