An extension of the non-inferior set estimation algorithm for many objectives

DOI10.1016/j.ejor.2019.11.017zbMath1441.90150OpenAlexW2987972482WikidataQ126747404 ScholiaQ126747404MaRDI QIDQ2301933

Marcos M. Raimundo, Paulo Augusto Valente Ferreira, Fernando José Von Zuben

Publication date: 25 February 2020

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.11.017

zbMATH Keywords

multi-objective optimizationweighted sum methodautomatic estimation of a non-inferior set

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (2)

Enforcing fairness using ensemble of diverse Pareto-optimal models ⋮ Pruning Pareto optimal solutions for multi-objective portfolio asset management

Uses Software

• NBI
• SPEA2
• SMS-EMOA
• ASMO

Cites Work

• Unnamed Item
• ASMO
• The weighted sum method for multi-objective optimization: new insights
• A numerical method for constructing the Pareto front of multi-objective optimization problems
• The normalized normal constraint method for generating the Pareto frontier
• Survey of multi-objective optimization methods for engineering
• Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation
• A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
• An approximation algorithm for convex multi-objective programming problems
• Scalarizations for adaptively solving multi-objective optimization problems
• SMS-EMOA: multiobjective selection based on dominated hypervolume
• Solving efficiently the 0-1 multi-objective knapsack problem
• Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
• Multi-objective integer programming: a general approach for generating all non-dominated solutions
• An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
• Nonlinear multiobjective optimization
• Approximating the noninferior set in multiobjective linear programming problems
• Unbiased approximation in multicriteria optimization
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• The controlled estimation method in the multiobjective linear fractional problem
• Finding a representative nondominated set for multi-objective mixed integer programs
• Multi-objective integer programming: an improved recursive algorithm
• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
• A Benson type algorithm for nonconvex multiobjective programming problems
• Proper efficiency and the theory of vector maximization
• Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets
• An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
• Diversity Maximization Approach for Multiobjective Optimization
• An Adaptive Scalarization Method in Multiobjective Optimization
• Defectiveness of weighting method in multicriterion optimization of structures
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
• Multiobjective grid packing model: An application in forest management

This page was built for publication: An extension of the non-inferior set estimation algorithm for many objectives