A Comprehensive Review on Scatter Search: Techniques, Applications, and Challenges

21Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Recent years have witnessed the use of metaheuristic algorithms to solve the optimization problems that usually require extensive computations and time. Among others, scatter search is the widely used evolutionary metaheuristic algorithm. It uses the information of global optima, which is stored in a different and unique set of solutions. In this paper, an updated review of scatter search (SS) is given. SS has been successfully applied in a variety of research problems, namely, data mining, bioinformatics, and engineering design. This paper presents the modified and hybrid versions of SS with their applications. The control strategies are discussed to show their impact on the performance of SS. various issues and future directions related to SS are also discussed. It inspires innovative researchers to use this algorithm for their research domains.

Cited by Powered by Scopus

Get full text
Get full text

This article is free to access.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Kalra, M., Tyagi, S., Kumar, V., Kaur, M., Mashwani, W. K., Shah, H., & Shah, K. (2021). A Comprehensive Review on Scatter Search: Techniques, Applications, and Challenges. Mathematical Problems in Engineering, 2021. https://doi.org/10.1155/2021/5588486

Readers over time

‘21‘22‘23‘24036912

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 7

44%

Professor / Associate Prof. 3

19%

Lecturer / Post doc 3

19%

Researcher 3

19%

Readers' Discipline

Tooltip

Computer Science 6

46%

Engineering 4

31%

Energy 2

15%

Social Sciences 1

8%

Save time finding and organizing research with Mendeley

Sign up for free
0