Metaheuristic research: a comprehensive survey

• Published in: The Artificial intelligence review 2019-12, Vol.52 (4), p.2191-2233
• Main Authors: Hussain, Kashif, Mohd Salleh, Mohd Najib, Cheng, Shi, Shi, Yuhui
• Format: Article
• Language: English
• Subjects: Algorithms; Artificial Intelligence; Black boxes; Comparative analysis; Computer Science; Heuristic; Heuristic methods; Optimization; Optimization algorithms; Performance tests; Surveys
• ISSN: 0269-2821; 1573-7462
• DOI: 10.1007/s10462-017-9605-z

Because of successful implementations and high intensity, metaheuristic research has been extensively reported in literature, which covers algorithms, applications, comparisons, and analysis. Though, little has been evidenced on insightful analysis of metaheuristic performance issues, and it is still a “black box” that why certain metaheuristics perform better on specific optimization problems and not as good on others. The performance related analyses performed on algorithms are mostly quantitative via performance validation metrics like mean error, standard deviation, and co-relations have been used. Moreover, the performance tests are often performed on specific benchmark functions—few studies are those which involve real data from scientific or engineering optimization problems. In order to draw a comprehensive picture of metaheuristic research, this paper performs a survey of metaheuristic research in literature which consists of 1222 publications from year 1983 to 2016 (33 years). Based on the collected evidence, this paper addresses four dimensions of metaheuristic research: introduction of new algorithms, modifications and hybrids, comparisons and analysis, and research gaps and future directions. The objective is to highlight potential open questions and critical issues raised in literature. The work provides guidance for future research to be conducted more meaningfully that can serve for the good of this area of research.