Chapter Sixteen: Local search algorithm
Abstract
Local search (LS) is widely used in metaheuristic algorithms, for it is typically simple and thus easy to implement for fine-tuning the searched solutions to further improve the end results. Several well-known LS algorithms are included in this chapter. Among them are iterated LS, guided local search, variable neighborhood search, and k-opt. Some examples using metaheuristic algorithms with LS are also described. The source code of a genetic algorithm with 2-opt (GA+2-opt) for solving the traveling salesman problem is given to explain how to add LS to a metaheuristic algorithm. GA+2-opt and GA are compared to show the possibilities and potential of metaheuristic algorithms with LS.
Keywords
local search; ...
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.
