The new model of parallel genetic algorithm in multi-objective optimization problems - divided range multi-objective genetic algorithm

2002 ◽  
Author(s):  
T. Hiroyasu ◽  
M. Miki ◽  
S. Watanabe
Keyword(s):  
Genetic Algorithm ◽  
Optimization Problems ◽  
Multi Objective Optimization ◽  
Parallel Genetic Algorithm ◽  
New Model ◽  
Multi Objective ◽  
Multi Objective Genetic Algorithm

An Improved Constrained Optimization Multi-Objective Genetic Algorithm and its Application in Engineering

2014 ◽  
Vol 962-965 ◽  
pp. 2903-2908
Author(s):  
Yun Lian Liu ◽  
Wen Li ◽  
Tie Bin Wu ◽  
Yun Cheng ◽  
Tao Yun Zhou ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Constrained Optimization ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Crossover Operator ◽  
Multi Objective Optimization ◽  
Constrained Optimization Problem ◽  
Great Ability ◽  
Multi Objective ◽  
Multi Objective Genetic Algorithm

An improved multi-objective genetic algorithm is proposed to solve constrained optimization problems. The constrained optimization problem is converted into a multi-objective optimization problem. In the evolution process, our algorithm is based on multi-objective technique, where the population is divided into dominated and non-dominated subpopulation. Arithmetic crossover operator is utilized for the randomly selected individuals from dominated and non-dominated subpopulation, respectively. The crossover operator can lead gradually the individuals to the extreme point and improve the local searching ability. Diversity mutation operator is introduced for non-dominated subpopulation. Through testing the performance of the proposed algorithm on 3 benchmark functions and 1 engineering optimization problems, and comparing with other meta-heuristics, the result of simulation shows that the proposed algorithm has great ability of global search. Keywords: multi-objective optimization;genetic algorithm;constrained optimization problem;engineering application

scholarly journals Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems

1999 ◽  
Vol 7 (3) ◽  
pp. 205-230 ◽  
Author(s):  
Kalyanmoy Deb
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Optimization Problems ◽  
Test Problems ◽  
Pareto Optimal ◽  
Multi Objective Optimization ◽  
Pareto Optimal Front ◽  
Multi Objective ◽  
Multi Objective Genetic Algorithm ◽  
Single Objective

In this paper, we study the problem features that may cause a multi-objective genetic algorithm (GA) difficulty in converging to the true Pareto-optimal front. Identification of such features helps us develop difficult test problems for multi-objective optimization. Multi-objective test problems are constructed from single-objective optimization problems, thereby allowing known difficult features of single-objective problems (such as multi-modality, isolation, or deception) to be directly transferred to the corresponding multi-objective problem. In addition, test problems having features specific to multi-objective optimization are also constructed. More importantly, these difficult test problems will enable researchers to test their algorithms for specific aspects of multi-objective optimization.

Cognitive Radio Decision Engine Based on Multi-Objective Genetic Algorithm

2011 ◽  
Vol 48-49 ◽  
pp. 314-317
Author(s):  
Di Wu ◽  
Sheng Yao Yang ◽  
J.C. Liu
Keyword(s):  
Genetic Algorithm ◽  
Cognitive Radio ◽  
Performance Optimization ◽  
Optimization Problem ◽  
Simulation Analysis ◽  
Multi Objective Optimization ◽  
Weighting Method ◽  
Multi Objective ◽  
Multi Objective Genetic Algorithm ◽  
Decision Engine

The performance optimization of cognitive radio is a multi-objective optimization problem. Existing genetic algorithms are difficult to assign the weight of each objective when the linear weighting method is used to simplify the multi-objective optimization problem into a single objective optimization problem. In this paper, we propose a new cognitive decision engine algorithm using multi-objective genetic algorithm with population adaptation. A multicarrier system is used for simulation analysis, and experimental results show that the proposed algorithm is effective and meets the real-time requirement.

A New Interval Multi-Objective Optimization Method for Uncertain Problems with Dependent Interval Variables

2020 ◽  
Vol 17 (10) ◽  
pp. 2050007
Author(s):  
Guiping Liu ◽  
Rui Luo ◽  
Sheng Liu
Keyword(s):  
Genetic Algorithm ◽  
Iterative Algorithm ◽  
Correlation Coefficients ◽  
Optimization Method ◽  
Multi Objective Optimization ◽  
Interval Model ◽  
Numerical Examples ◽  
Multi Objective ◽  
Multi Objective Genetic Algorithm ◽  
Interval Variables

In this paper, a new interval multi-objective optimization (MOO) method integrating with the multidimensional parallelepiped (MP) interval model has been proposed to handle the uncertain problems with dependent interval variables. The MP interval model is integrated to depict the uncertain domain of the problem, where the uncertainties are described by marginal intervals and the degree of the dependencies among the interval variables is described by correlation coefficients. Then an efficient multi-objective iterative algorithm combining the micro multi-objective genetic algorithm (MOGA) with an approximate optimization method is formulated. Three numerical examples are presented to demonstrate the efficiency of the proposed approach.

Sign in / Sign up

Export Citation Format

Share Document