Local search enabled extremal optimisation for continuous inseparable multi-objective benchmark and real-world problems
MetadataShow full item record
Local search is an integral part of many meta-heuristic strategies that solve single objective optimisation problems. Essentially, the meta-heuristic is responsible for generating a good starting point from which a greedy local search will find the local optimum. Indeed, the best known solutions to many hard problems (such as the travelling salesman problem) have been generated in this hybrid way. However, for multiple objective problems, explicit local search strategies are relatively under studied, compared to other aspects of the search process. In this paper, a generic local search strategy is developed, particularly for problems where it is difficult or impossible to determine the contribution of individual solution components (often referred to as inseparable problems). The meta-heuristic adopted to test this is extremal optimisation, though the local search technique may be used by any meta-heuristic. To supplement the local search strategy a diversification strategy that draws from the external archive is incorporated into the local search strategy. Using benchmark problems, and a real-world airfoil design problem, it is shown that this combination leads to improved solutions.
Procedia Computer Science
© The Author(s) 2014. This is an Open Access article distributed under the terms of the Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0) License (http://creativecommons.org/licenses/by-nc-nd/3.0/) which permits unrestricted, non-commercial use, distribution and reproduction in any medium, providing that the work is properly cited. You may not alter, transform, or build upon this work.
Aerodynamics (excl. Hypersonic Aerodynamics)