Two efficient algorithms for constructing almost even approximations of the Pareto front in multi-objective optimization problems

DOI10.1080/0305215X.2018.1479405OpenAlexW2884049707WikidataQ129488089 ScholiaQ129488089MaRDI QIDQ5058972

Azam Dolatnezhadsomarin, Esmaile Khorram

Publication date: 23 December 2022

Published in: Engineering Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0305215x.2018.1479405

zbMATH Keywords

multi-objective optimization problemPareto-optimal solution\(\varepsilon\)-constraint methodPascoletti-Serafini scalarization approach

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Uses Software

• NBI
• MOEA/D
• SMS-EMOA
• ASMO

Cites Work

• Unnamed Item
• Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results
• A numerical method for constructing the Pareto front of multi-objective optimization problems
• The normalized normal constraint method for generating the Pareto frontier
• A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
• On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods
• SMS-EMOA: multiobjective selection based on dominated hypervolume
• A new approach to approximate the bounded Pareto front
• Scalarizing vector optimization problems
• A Successive Approach to Compute the Bounded Pareto Front of Practical Multiobjective Optimization Problems
• An Adaptive Scalarization Method in Multiobjective Optimization
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
• Multicriteria Optimization
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization

This page was built for publication: Two efficient algorithms for constructing almost even approximations of the Pareto front in multi-objective optimization problems