A Strength Pareto Gravitational Search Algorithm for Multi-Objective Optimization Problems

2015 ◽  
Vol 29 (06) ◽  
pp. 1559010 ◽  
Author(s):  
Xiaohui Yuan ◽  
Zhihuan Chen ◽  
Yanbin Yuan ◽  
Yuehua Huang ◽  
Xiaopan Zhang
Keyword(s):  
Optimization Problems ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Population Diversity ◽  
Benchmark Problems ◽  
Multi Objective Optimization ◽  
Local Optima ◽  
Multi Objective ◽  
Fine Grained ◽  
Gravitational Search

A novel strength Pareto gravitational search algorithm (SPGSA) is proposed to solve multi-objective optimization problems. This SPGSA algorithm utilizes the strength Pareto concept to assign the fitness values for agents and uses a fine-grained elitism selection mechanism to keep the population diversity. Furthermore, the recombination operators are modeled in this approach to decrease the possibility of trapping in local optima. Experiments are conducted on a series of benchmark problems that are characterized by difficulties in local optimality, nonuniformity, and nonconvexity. The results show that the proposed SPGSA algorithm performs better in comparison with other related works. On the other hand, the effectiveness of two subtle means added to the GSA are verified, i.e. the fine-grained elitism selection and the use of SBX and PMO operators. Simulation results show that these measures not only improve the convergence ability of original GSA, but also preserve the population diversity adequately, which enables the SPGSA algorithm to have an excellent ability that keeps a desirable balance between the exploitation and exploration so as to accelerate the convergence speed to the true Pareto-optimal front.

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

2012 ◽  
Vol 3 (3) ◽  
pp. 32-49 ◽  
Author(s):  
Hadi Nobahari ◽  
Mahdi Nikusokhan ◽  
Patrick Siarry
Keyword(s):  
Optimization Problems ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Gravitational Acceleration ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Mutation Operators ◽  
External Archive ◽  
Gravitational Search ◽  
New Criterion

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.

An Improved Quantum-Inspired Gravitational Search Algorithm to Optimize the Facial Features

2021 ◽  
Author(s):  
Yogesh Kumar ◽  
Shashi Kant Verma ◽  
Sandeep Sharma
Keyword(s):  
Facial Expression ◽  
Facial Expressions ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Research Work ◽  
Facial Features ◽  
Features Selection ◽  
Local Optima ◽  
Gravitational Search

The optimization of the features is vital to effectively detecting facial expressions. This research work has optimized the facial features by employing the improved quantum-inspired gravitation search algorithm (IQI-GSA). The improvement to the quantum-inspired gravitational search algorithm (QIGSA) is conducted to handle the local optima trapping. The QIGSA is the amalgamation of the quantum computing and gravitational search algorithm that owns the overall strong global search ability to handle the optimization problems in comparison with the gravitational search algorithm. In spite of global searching ability, the QIGSA can be trapped in local optima in the later iterations. This work has adapted the IQI-GSA approach to handle the local optima, stochastic characteristics and maintaining balance among the exploration and exploitation. The IQI-GSA is utilized for the optimized features selection from the set of extracted features using the LGBP (a hybrid approach of local binary patterns with the Gabor filter) method. The system performance is analyzed for the application of automated facial expressions recognition with the classification technique of deep convolutional neural network (DCNN). The extensive experimentation evaluation is conducted on the benchmark datasets of Japanese Female Facial Expression (JAFFE), Radboud Faces Database (RaFD) and Karolinska Directed Emotional Faces (KDEF). To determine the effectiveness of the proposed facial expression recognition system, the results are also evaluated for the feature optimization with GSA and QIGSA. The evaluation results clearly demonstrate the outperformed performance of the considered system with IQI-GSA in comparison with GSA, QIGSA and existing techniques available for the experimentation on utilized datasets.

scholarly journals An Improved Artificial Electric Field Algorithm for Multi-Objective Optimization

Processes ◽  
2020 ◽  
Vol 8 (5) ◽  
pp. 584
Author(s):  
Hemant Petwal ◽  
Rinkle Rani
Keyword(s):  
Electric Field ◽  
Density Estimation ◽  
Optimization Problems ◽  
Population Based ◽  
Population Diversity ◽  
Multi Objective Optimization ◽  
Local Optima ◽  
Multi Objective ◽  
Polynomial Mutation ◽  
Optimum Solution

Real-world problems such as scientific, engineering, mechanical, etc., are multi-objective optimization problems. In order to achieve an optimum solution to such problems, multi-objective optimization algorithms are used. A solution to a multi-objective problem is to explore a set of candidate solutions, each of which satisfies the required objective without any other solution dominating it. In this paper, a population-based metaheuristic algorithm called an artificial electric field algorithm (AEFA) is proposed to deal with multi-objective optimization problems. The proposed algorithm utilizes the concepts of strength Pareto for fitness assignment and the fine-grained elitism selection mechanism to maintain population diversity. Furthermore, the proposed algorithm utilizes the shift-based density estimation approach integrated with strength Pareto for density estimation, and it implements bounded exponential crossover (BEX) and polynomial mutation operator (PMO) to avoid solutions trapping in local optima and enhance convergence. The proposed algorithm is validated using several standard benchmark functions. The proposed algorithm’s performance is compared with existing multi-objective algorithms. The experimental results obtained in this study reveal that the proposed algorithm is highly competitive and maintains the desired balance between exploration and exploitation to speed up convergence towards the Pareto optimal front.

Sign in / Sign up

Export Citation Format

Share Document