Gravitational Search Algorithm with Nearest-Better Neighborhood for Multimodal Optimization Problems

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

DOWLATSHAHI MOHAMMAD BAGHER; DERHAMI VALI; NEZAMABADI POUR HOSSEIN

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF SOFT COMPUTING AND INFORMATION TECHNOLOGY (JSCIT) Year:2019 | Volume:8 | Issue:3 Page(s): 10-19

Download Full-Text

Persian Verion

View:

416

Download:

Cites:

Information Journal Paper

Title

Gravitational Search Algorithm with Nearest-Better Neighborhood for Multimodal Optimization Problems

Author(s)

DOWLATSHAHI MOHAMMAD BAGHER | DERHAMI VALI | NEZAMABADI POUR HOSSEIN | Issue Writer Certificate

Keywords

Gravitational Search AlgorithmQ2

Swarm IntelligenceQ1

Nearest-better NeighborhoodQ1

Multimodal OptimizationQ1

Abstract

Gravitational Search Algorithm (GSA) is a simple and efficient optimization method recently proposed for solving single-objective optimization problems. In this paper, for the first time, the Nearest-better Neighborhoods are defined in Swarm Intelligence algorithms and then used in the GSA to solve multi-modal optimization problems. For this purpose, two neighborhoods are defined, called Topological Nearest-Better (TNB) and Distance-based Nearest-Better (DNB), and then these two structures are used separately in the GSA and two different versions of the GSA for multi-modal optimization problems are provided. To investigate the efficiency of the proposed algorithms, an empirical assessment has been performed on several standard multi-modal benchmark functions. The results of these experiments show that the proposed algorithms can achieve good results compared to other multi-modal optimizer algorithms.

Cites

No record.

References

No record.

Cite

APA: Copy

DOWLATSHAHI, MOHAMMAD BAGHER, DERHAMI, VALI, & NEZAMABADI POUR, HOSSEIN. (2019). Gravitational Search Algorithm with Nearest-Better Neighborhood for Multimodal Optimization Problems. JOURNAL OF SOFT COMPUTING AND INFORMATION TECHNOLOGY (JSCIT), 8(3 ), 10-19. SID. https://sid.ir/paper/245852/en

Vancouver: Copy

DOWLATSHAHI MOHAMMAD BAGHER, DERHAMI VALI, NEZAMABADI POUR HOSSEIN. Gravitational Search Algorithm with Nearest-Better Neighborhood for Multimodal Optimization Problems. JOURNAL OF SOFT COMPUTING AND INFORMATION TECHNOLOGY (JSCIT)[Internet]. 2019;8(3 ):10-19. Available from: https://sid.ir/paper/245852/en

IEEE: Copy

MOHAMMAD BAGHER DOWLATSHAHI, VALI DERHAMI, and HOSSEIN NEZAMABADI POUR, “Gravitational Search Algorithm with Nearest-Better Neighborhood for Multimodal Optimization Problems,” JOURNAL OF SOFT COMPUTING AND INFORMATION TECHNOLOGY (JSCIT), vol. 8, no. 3 , pp. 10–19, 2019, [Online]. Available: https://sid.ir/paper/245852/en

Related Journal Papers