On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods
From MaRDI portal
Publication:877666
DOI10.1016/J.EJOR.2006.08.002zbMATH Open1123.90048OpenAlexW2036103851MaRDI QIDQ877666FDOQ877666
Recommendations
- A method for selecting Pareto optimal solutions in multiobjective optimization
- Niching evolution strategy finding global and Pareto optimal solutions
- Evolving Opposition-Based Pareto Solutions: Multiobjective Optimization Using Competitive Coevolution
- The evolutionary algorithm to find robust Pareto-optimal solutions over time
- Approximating Pareto-optimal sets using diversity strategies in evolutionary multi-objective optimization
- Hierarchical generation of Pareto optimal solutions in large-scale multiobjective systems
- Generation of Pareto optimal solutions using generalized DEA and PSO
Cites work
- scientific article; zbMATH DE number 3835768 (Why is no real title available?)
- scientific article; zbMATH DE number 3700594 (Why is no real title available?)
- scientific article; zbMATH DE number 1975082 (Why is no real title available?)
- scientific article; zbMATH DE number 2046100 (Why is no real title available?)
- scientific article; zbMATH DE number 2222824 (Why is no real title available?)
- A CHIM-based interactive Tchebycheff procedure for multiple objective decision making
- A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Evolutionary Multi-Criterion Optimization
- Generalized homotopy approach to multiobjective optimization.
- Generating a representative subset of the nondominated frontier in multiple criteria decision making
- Generating well-distributed sets of Pareto points for engineering design using physical programming
- Multi-objective optimization using evolutionary algorithms
- Multicriteria optimization
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- Nonlinear multiobjective optimization
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- Physical programming - Effective optimization for computational design
- Stochastic method for the solution of unconstrained vector optimization problems
- Towards finding global representations of the efficient set in multiple objective mathematical programming
- Unbiased approximation in multicriteria optimization
Cited in
(16)- A modified version of a Benson-type algorithm proposed for obtaining solutions with better dispersion on the non-dominated set of a non-convex multi-objective programming problem
- Multi-objective retrospective optimization using stochastic zigzag search
- Two efficient algorithms for constructing almost even approximations of the Pareto front in multi-objective optimization problems
- Niching evolution strategy finding global and Pareto optimal solutions
- Multiobjective optimization methods for congestion management in deregulated power systems
- The cross-entropy method in multi-objective optimisation: an assessment
- The minimum cost network upgrade problem with maximum robustness to multiple node failures
- Generalized multiobjective evolutionary algorithm guided by descent directions
- A new hybrid evolutionary multiobjective algorithm guided by descent directions
- A smooth proximity measure for optimality in multi-objective optimization using Benson's method
- Evolutionary Multi-Criterion Optimization
- Generation of Pareto optimal solutions using generalized DEA and PSO
- New algorithms for discrete vector optimization based on the Graef-Younes method and cone-monotone sorting functions
- A direction based classical method to obtain complete Pareto set of multi-criteria optimization problems
- A new Pareto set generating method for multi-criteria optimization problems
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
This page was built for publication: On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877666)
