Stochastic analysis
Evolutionary Algorithms for Solving Multi-Objective Problems
Evolutionary Algorithms for Solving Multi-Objective Problems
A Taxonomy of Global Optimization Methods Based on Response Surfaces
Journal of Global Optimization
Pareto-Front Exploration with Uncertain Objectives
EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
Evolutionary Multi-objective Ranking with Uncertainty and Noise
EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
Structure optimization of neural networks for evolutionary design optimization
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Inverse multi-objective robust evolutionary design
Genetic Programming and Evolvable Machines
Introducing robustness in multi-objective optimization
Evolutionary Computation
Muiltiobjective optimization using nondominated sorting in genetic algorithms
Evolutionary Computation
Reliability-based optimization using evolutionary algorithms
IEEE Transactions on Evolutionary Computation
Reliability-based multi-objective optimization using evolutionary algorithms
EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
Generalizing surrogate-assisted evolutionary computation
IEEE Transactions on Evolutionary Computation
Searching for robust pareto-optimal solutions in multi-objective optimization
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Fuzzy-Pareto-Dominance and its application in evolutionary multi-objective optimization
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Multi-objective optimization of problems with epistemic uncertainty
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
A framework for evolutionary optimization with approximate fitnessfunctions
IEEE Transactions on Evolutionary Computation
Performance assessment of multiobjective optimizers: an analysis and review
IEEE Transactions on Evolutionary Computation
Evolutionary optimization in uncertain environments-a survey
IEEE Transactions on Evolutionary Computation
Efficient search for robust solutions by means of evolutionary algorithms and fitness approximation
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
This paper addresses continuous optimization problems with multiple objectives and parameter uncertainty defined by probability distributions. First, a reliability-based formulation is proposed, defining the nondeterministic Pareto set as the minimal solutions such that user-defined probabilities of nondominance and constraint satisfaction are guaranteed. The formulation can be incorporated with minor modifications in a multiobjective evolutionary algorithm (here: the nondominated sorting genetic algorithm-II). Then, in the perspective of applying the method to large-scale structural engineering problems-for which the computational effort devoted to the optimization algorithm itself is negligible in comparison with the simulation-the second part of the study is concerned with the need to reduce the number of function evaluations while avoiding modification of the simulation code. Therefore, nonintrusive stochastic metamodels are developed in two steps. First, for a given sampling of the deterministic variables, a preliminary decomposition of the random responses (objectives and constraints) is performed through polynomial chaos expansion (PCE), allowing a representation of the responses by a limited set of coefficients. Then, a metamodel is carried out by kriging interpolation of the PCE coefficients with respect to the deterministic variables. The method has been tested successfully on seven analytical test cases and on the 10-bar truss benchmark, demonstrating the potential of the proposed approach to provide reliability-based Pareto solutions at a reasonable computational cost.