.png){kind=icon}
.png){kind=icon}
Return
MOGOA algorithm for constrained and unconstrained multi-objective optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-017-1074-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Grasshopper Optimization Algorithm (GOA) was modified in this paper, to optimize multi-objective problems, and the modified version is called Multi-Objective Grasshopper Optimization Algorithm (MOGOA). An external archive is integrated with the GOA for saving the Pareto optimal solutions. The archive is then employed for defining the social behavior of the GOA in the multi-objective search space. To evaluate and verify the effectiveness of the MOGOA, a set of standard unconstrained and constrained test functions are used. Moreover, the proposed algorithm was compared with three well-known optimization algorithms: Multi-Objective Particle Swarm Optimization (MOPSO), Multi-Objective Ant Lion Optimizer (MOALO), and Non-dominated Sorting Genetic Algorithm version 2 (NSGA-II); and the obtained results show that the MOGOA algorithm is able to provide competitive results and outperform other algorithms.
Keywords:
Multi-objective optimization
Grasshopper optimization algorithm
Pareto optimal solutions
Evolutionary algorithm
Constrained optimization
Unconstrained optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.5
Papers:
7.5K
Citations:
1.7W