A performance comparison of multi-objective optimization evolutionary algorithms for all-optical networks design

2011 ◽  
Author(s):  
Danilo R. B. Araujo ◽  
Carmelo J. A. Bastos-Filho ◽  
Erick A. Barboza ◽  
Daniel A. R. Chaves ◽  
Joaquim F. Martins-Filho
Keyword(s):  
Evolutionary Algorithms ◽  
Optical Networks ◽  
Performance Comparison ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
All Optical ◽  
A Performance

A performance comparison of multi-objective optimization-based approaches for calibrating white-box building energy models

2020 ◽  
Vol 216 ◽  
pp. 109942 ◽  
Author(s):  
Sandra Martínez ◽  
Pablo Eguía ◽  
Enrique Granada ◽  
Amin Moazami ◽  
Mohamed Hamdy
Keyword(s):  
Building Energy ◽  
Performance Comparison ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Energy Models ◽  
A Performance

scholarly journals Performance comparison of generational and steady-state asynchronous multi-objective evolutionary algorithms for computationally-intensive problems

2015 ◽  
Vol 87 ◽  
pp. 47-60 ◽  
Author(s):  
Alexandru-Ciprian Zăvoianu ◽  
Edwin Lughofer ◽  
Werner Koppelstätter ◽  
Günther Weidenholzer ◽  
Wolfgang Amrhein ◽  
...  
Keyword(s):  
Steady State ◽  
Evolutionary Algorithms ◽  
Performance Comparison ◽  
Multi Objective ◽  
Computationally Intensive

scholarly journals The dilemma between eliminating dominance-resistant solutions and preserving boundary solutions of extremely convex Pareto fronts

2021 ◽  
Author(s):  
Zhenkun Wang ◽  
Qingyan Li ◽  
Qite Yang ◽  
Hisao Ishibuchi
Keyword(s):  
Evolutionary Algorithms ◽  
Coping Strategies ◽  
Test Problem ◽  
Pareto Front ◽  
Optimization Problems ◽  
Feasible Region ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Pareto Fronts ◽  
Boundary Solutions

AbstractIt has been acknowledged that dominance-resistant solutions (DRSs) extensively exist in the feasible region of multi-objective optimization problems. Recent studies show that DRSs can cause serious performance degradation of many multi-objective evolutionary algorithms (MOEAs). Thereafter, various strategies (e.g., the $$\epsilon $$ ϵ -dominance and the modified objective calculation) to eliminate DRSs have been proposed. However, these strategies may in turn cause algorithm inefficiency in other aspects. We argue that these coping strategies prevent the algorithm from obtaining some boundary solutions of an extremely convex Pareto front (ECPF). That is, there is a dilemma between eliminating DRSs and preserving boundary solutions of the ECPF. To illustrate such a dilemma, we propose a new multi-objective optimization test problem with the ECPF as well as DRSs. Using this test problem, we investigate the performance of six representative MOEAs in terms of boundary solutions preservation and DRS elimination. The results reveal that it is quite challenging to distinguish between DRSs and boundary solutions of the ECPF.

How Genetic Algorithms Handle Pareto-Optimality in Design and Manufacturing

2007 ◽  
pp. 465-482
Author(s):  
N. Chakraborti
Keyword(s):  
Genetic Algorithms ◽  
Evolutionary Algorithms ◽  
Pareto Optimality ◽  
Multi Objective Optimization ◽  
Recent Past ◽  
Multi Objective ◽  
Manufacturing Sectors ◽  
Design And Manufacturing ◽  
Basic Concepts

An informal analysis is provided for the basic concepts associated with multi-objective optimization and the notion of Pareto-optimality, particularly in the context of genetic algorithms. A number of evolutionary algorithms developed for this purpose are also briefly introduced, and finally, a number of paradigm examples are presented from the materials and manufacturing sectors, where multi-objective genetic algorithms have been successfully utilized in the recent past.

Sign in / Sign up

Export Citation Format

Share Document