Global search in single-solution-based metaheuristics
Authors:
- 12 March 2020
- journal article
- research article
- Published by Emerald Publishing in Data Technologies and Applications
- Vol. 54 (3) , 275-296
Abstract
Purpose: Metaheuristic algorithms are classified into two categories namely: single-solution and population-based algorithms. Single-solution algorithms perform local search process by employing a single candidate solution trying to improve this solution in its neighborhood. In contrast, population-based algorithms guide the search process by maintaining multiple solutions located in different points of search space. However, the main drawback of single-solution algorithms is that the global optimum may not reach and it may get stuck in local optimum. On the other hand, population-based algorithms with several starting points that maintain the diversity of the solutions globally in the search space and results are of better exploration during the search process. In this paper more chance of finding global optimum is provided for single-solution-based algorithms by searching different regions of the search space.Design/methodology/approach: In this method, different starting points in initial step, searching locally in neighborhood of each solution, construct a global search in search space for the single-solution algorithm.Findings: The proposed method was tested based on three single-solution algorithms involving hill-climbing (HC), simulated annealing (SA) and tabu search (TS) algorithms when they were applied on 25 benchmark test functions. The results of the basic version of these algorithms were then compared with the same algorithms integrated with the global search proposed in this paper. The statistical analysis of the results proves outperforming of the proposed method. Finally, 18 benchmark feature selection problems were used to test the algorithms and were compared with recent methods proposed in the literature.Originality/value: In this paper more chance of finding global optimum is provided for single-solution-based algorithms by searching different regions of the search space.Keywords
This publication has 35 references indexed in Scilit:
- Optimization and Metaheuristic Algorithms in Engineering2013
- Designing simulated annealing and subtractive clustering based fuzzy classifierApplied Soft Computing, 2010
- Extended great deluge algorithm for the imperfect preventive maintenance optimization of multi-state systemsReliability Engineering & System Safety, 2008
- Data mining with a simulated annealing based fuzzy classification systemPattern Recognition, 2008
- LINEAR ANTENNA ARRAY DESIGN WITH USE OF GENETIC, MEMETIC AND TABU SEARCH OPTIMIZATION ALGORITHMSProgress in Electromagnetics Research C, 2008
- A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practiceComputer Methods in Applied Mechanics and Engineering, 2005
- A New Heuristic Optimization Algorithm: Harmony SearchSIMULATION, 2001
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problemAnnals of Operations Research, 1993
- New Optimization HeuristicsJournal of Computational Physics, 1993
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealingJournal of Computational Physics, 1990