Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,370,735 papers from all fields of science
Search
Sign In
Create Free Account
Multi-objective optimization
Known as:
Multiobjective optimisation
, Non-dominated Sorting Genetic Algorithm-II
, Multiobjective programming
Expand
Multi-objective optimization (also known as multi-objective programming, vector optimization, multicriteria optimization, multiattribute optimization…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
47 relations
Agent-based model
Benson's algorithm
Benson's algorithm (Go)
Cluster analysis
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
A novel fruit fly framework for multi-objective shape design of tubular linear synchronous motor
R. M. Rizk-Allah
,
R. El-Sehiemy
,
S. Deb
,
Gaige Wang
Journal of Supercomputing
2017
Corpus ID: 25797888
This paper addresses a novel multi-objective fruit fly optimization algorithm (MOFOA) for solving multi-objective optimization…
Expand
Highly Cited
2011
Highly Cited
2011
Artificial immune multi-objective SAR image segmentation with fused complementary features
Dongdong Yang
,
L. Jiao
,
Maoguo Gong
,
Fang Liu
Information Sciences
2011
Corpus ID: 31356916
Highly Cited
2011
Highly Cited
2011
Multiobjective optimization by decomposition with Pareto-adaptive weight vectors
Jiang Siwei
,
Cai Zhihua
,
Zhang Jie
,
Ong Yew-Soon
Seventh International Conference on Natural…
2011
Corpus ID: 31335510
MOEA/D is a recently proposed methodology of Multiobjective Evolution Algorithms that decomposes multiobjective problems into a…
Expand
Highly Cited
2008
Highly Cited
2008
CIlib: A collaborative framework for Computational Intelligence algorithms - Part I
T. Cloete
,
A. Engelbrecht
,
G. Pamparà
IEEE World Congress on Computational Intelligence
2008
Corpus ID: 17857411
Research in computational intelligence (CI) has produced a huge collection of algorithms, grouped into the main CI paradigms…
Expand
Highly Cited
2004
Highly Cited
2004
Covering Pareto-optimal fronts by subswarms in multi-objective particle swarm optimization
Sanaz Mostaghim
,
J. Teich
Proceedings of the Congress on Evolutionary…
2004
Corpus ID: 231974
Covering the whole set of Pareto-optimal solutions is a desired task of multiobjective optimization methods. Because in general…
Expand
Highly Cited
2004
Highly Cited
2004
Constructing Dynamic Optimization Test Problems Using the Multi-objective Optimization Concept
Yaochu Jin
,
B. Sendhoff
EvoWorkshops
2004
Corpus ID: 2774529
Dynamic optimization using evolutionary algorithms is receiving increasing interests. However, typical test functions for…
Expand
Highly Cited
2003
Highly Cited
2003
MULTIOBJECTIVE OPTIMIZATION USING PARALLEL VECTOR EVALUATED PARTICLE SWARM OPTIMIZATION
K. Parsopoulos
2003
Corpus ID: 14428019
This paper studies a parallel version of the Vector Evaluated Particle Swarm Optimization (VEPSO) method for multiobjective…
Expand
Highly Cited
2000
Highly Cited
2000
The new model of parallel genetic algorithm in multi-objective optimization problems - divided range multi-objective genetic algorithm
T. Hiroyasu
,
M. Miki
,
S. Watanabe
Proceedings of the Congress on Evolutionary…
2000
Corpus ID: 18222090
Proposes a divided-range multi-objective genetic algorithm (DRMOGA), which is a model for the parallel processing of genetic…
Expand
Highly Cited
1997
Highly Cited
1997
Fuzzy goal programming approach for water quality management in a river basin
Chih-Sheng Lee
,
C. Wen
Fuzzy Sets Syst.
1997
Corpus ID: 30243356
1992
1992
Approximation in multiobjective optimization
B. Lemaire
Journal of Global Optimization
1992
Corpus ID: 34168636
Some results of approximation type for multiobjective optimization problems with a finite number of objective functions are…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE