A clustering based archive multi objective gravitational search algorithm

DOI10.3233/FI-2015-1218MaRDI QIDQ2804183zbMATH OpenOpenAlexFDO

Authors Mohammad Amir Abbasian, Hossein Nezamabadi-Pour, Maryam Amoozegar

Publication date 28 April 2016

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2015-1218

zbMATH Keywords

elitismgravitational search algorithmmulti objective optimizationdiversity preservationarchive clustering

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Recommendations

• A new gravitational search optimization algorithm to solve single and multiobjective optimization problems
• KGSA: a gravitational search algorithm for multimodal optimization based on K-means niching technique and a novel elitism strategy
• Multi-objective gravitational search algorithm based on decomposition
• A gravitational search algorithm with a mixed strategy
• GSA: A gravitational search algorithm

Cited in

(4)

• KGSA: a gravitational search algorithm for multimodal optimization based on K-means niching technique and a novel elitism strategy
• Multi-objective grasshopper optimization algorithm based on multi-group and co-evolution
• A new gravitational search optimization algorithm to solve single and multiobjective optimization problems
• Multiple Objective Optimization with Weighted Superposition Attraction–Repulsion (moWSAR) Algorithm

This page was built for publication: A clustering based archive multi objective gravitational search algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804183)