A Multi-Objective Gravitational Search Algorithm Based on Non-Dominated Sorting

Hadi Nobahari, Mahdi Nikusokhan and Patrick Siarry
Additional contact information
Hadi Nobahari: Sharif University of Technology, Iran
Mahdi Nikusokhan: Sharif University of Technology, Iran
Patrick Siarry: Université Paris-Est Créteil (UPEC), France

International Journal of Swarm Intelligence Research (IJSIR), 2012, vol. 3, issue 3, 32-49

Abstract: This paper proposes an extension of the Gravitational Search Algorithm (GSA) to multi-objective optimization problems. The new algorithm, called Non-dominated Sorting GSA (NSGSA), utilizes the non-dominated sorting concept to update the gravitational acceleration of the particles. An external archive is also used to store the Pareto optimal solutions and to provide some elitism. It also guides the search toward the non-crowding and the extreme regions of the Pareto front. A new criterion is proposed to update the external archive and two new mutation operators are also proposed to promote the diversity within the swarm. Numerical results show that NSGSA can obtain comparable and even better performances as compared to the previous multi-objective variant of GSA and some other multi-objective optimization algorithms.

Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 4018/jsir.2012070103 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jsir00:v:3:y:2012:i:3:p:32-49

Access Statistics for this article

International Journal of Swarm Intelligence Research (IJSIR) is currently edited by Yuhui Shi

More articles in International Journal of Swarm Intelligence Research (IJSIR) from IGI Global
Bibliographic data for series maintained by Journal Editor ().