Chapter Three: Traditional methods
Abstract
The focus of this chapter is on solving the one-max and deceptive problems using the exhaustive search (ES) and hill climbing (HC) algorithms. First, the search behavior and pseudocode of ES and HC are given. Next, the implementation is given to help the audience understand not only the ideas of ES and HC but also how they are realized. Then, simulation results are given to show the features of ES and HC and to explain how difficult optimization problems can be. Finally, a discussion is given that is focused on the probability analysis of finding better regions and on the convergence analysis of ES and HC to show their search behavior during the convergence process.
Keywords
exhaustive search; hill climbing; ...
Get Handbook of Metaheuristic Algorithms now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
