A multiobjective genetic algorithm based on a discrete selection procedure
type: Item
instance of: scholarly article
title: A multiobjective genetic algorithm based on a discrete selection procedure
zbMATH Open document ID: 1394.90516
DOI: 10.1155/2015/349781
author: Qiang Long
author: Changzhi Wu
author: Xiangyu Wang
author: Lin Jiang
author: Jueyou Li
published in: Mathematical Problems in Engineering
publication date: 2018-08-27T00:00:00Z
review text: Summary: Multiobjective genetic algorithm (MOGA) is a direct search method for multiobjective optimization problems. It is based on the process of the genetic algorithm; the population-based property of the genetic algorithm is well applied in MOGAs. Comparing with the traditional multiobjective algorithm whose aim is to find a single Pareto solution, the MOGA intends to identify numbers of Pareto solutions. During the process of solving multiobjective optimization problems using genetic algorithm, one needs to consider the elitism and diversity of solutions. But, normally, there are some trade-offs between the elitism and diversity. For some multiobjective problems, elitism and diversity are conflicting with each other. Therefore, solutions obtained by applying MOGAs have to be balanced with respect to elitism and diversity. In this paper, we propose metrics to numerically measure the elitism and diversity of solutions, and the optimum order method is applied to identify these solutions with better elitism and diversity metrics. We test the proposed method by some well-known benchmarks and compare its numerical performance with other MOGAs; the result shows that the proposed method is efficient and robust.
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6926113
Wikidata QID: Q59118104
describes a project that uses: PAES
describes a project that uses: SPEA2
describes a project that uses: GDE3
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2015/349781
OpenAlex ID: W1668183688
cites work: Impulsive synchronization schemes of stochastic complex networks with switching topology: average time approach
cites work: Minmax robustness for multi-objective optimization problems
cites work: Robustness analysis in multi-objective mathematical programming using Monte Carlo simulation
cites work: Q5615833
cites work: The weighted sum method for multi-objective optimization: new insights
cites work: A novel differential search algorithm and applications for structure design
cites work: A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization
cites work: Multi-objective meta-heuristics: An overview of the current state-of-the-art
cites work: Q3832072
cites work: Q5808745
cites work: Q4079017
cites work: Q5748903
cites work: Q3350808
cites work: Neurogenetic learning: An integrated method of designing and training neural networks using genetic algorithms
cites work: Q4692508
description: scientific article; zbMATH DE number 6926113