Computing the set of approximate solutions of a multi-objective optimization problem by means of cell mapping techniques

DOI10.1007/978-3-319-01128-8_12MaRDI QIDQ2950784zbMATH OpenOpenAlexFDO

Authors

Publication date 9 October 2015

Published in EVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation IV (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-01128-8_12

zbMATH Keywords

global optimizationapproximate solutionsmulti-objective optimizationcell mapping techniques

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonconvex programming, global optimization (90C26)

Recommendations

• Parallel Cell Mapping for Unconstrained Multi-Objective Optimization Problems
• Set oriented methods for the numerical treatment of multiobjective optimization problems
• Approximation methods in multiobjective programming
• Covers and approximations in multiobjective optimization
• Approximate Pareto sets of minimal size for multi-objective optimization problems

Cites work

• A Theory of Cell-to-Cell Mapping Dynamical Systems
• A discrete method of optimal control based upon the cell state space concept
• A multi-objective approach to the design of low thrust space trajectories using optimal control
• A subdivision algorithm for the computation of unstable manifolds and global attractors
• Adaptive Scalarization Methods in Multiobjective Optimization
• Application of a cell-mapping method to optimal control problems
• Cell-to-cell mapping. A method of global analysis for nonlinear systems
• Covering Pareto sets by multilevel subdivision techniques
• Evolutionary Algorithms for Solving Multi-Objective Problems
• Gap-free computation of Pareto-points by quadratic scalarizations
• Lectures on analysis on metric spaces
• Multi-objective optimization using evolutionary algorithms
• Multiobjective search algorithm with subdivision technique
• Nonlinear multiobjective optimization. A generalized homotopy approach
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
• Steepest descent methods for multicriteria optimization.
• Stochastic method for the solution of unconstrained vector optimization problems
• Stochastic optimal control via Bellman's principle.
• The directed search method for multi-objective memetic algorithms
• Unbiased approximation in multicriteria optimization
• \(\epsilon\)-solutions in vector minimization problems

Cited in

(6)

• Parallel Cell Mapping for Unconstrained Multi-Objective Optimization Problems
• scientific article; zbMATH DE number 7385088 (Why is no real title available?)
• A New Predictor Corrector Variant for Unconstrained Bi-objective Optimization Problems
• A Hybrid Algorithm for the Simple Cell Mapping Method in Multi-objective Optimization
• A memetic variant of R-NSGA-II for reference point problems
• Multi-objective optimization of active vehicle suspension system control

Describes a project that uses

Uses Software

• NBI
• MOEA/D

This page was built for publication: Computing the set of approximate solutions of a multi-objective optimization problem by means of cell mapping techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2950784)