Numerical algorithms for generating an almost even approximation of the Pareto front in nonlinear multi-objective optimization problems

A multiobjective optimization problem (MOP) returns a set of non-dominated points, the so-called Pareto front. Since this set is usually infinite, it is impossible to generate it completely in practice. Therefore, a discrete approximation of the Pareto front is created. One of the most important fea...

Celý popis

Podrobná bibliografie

Vydáno v:	Applied soft computing Ročník 165; s. 112001
Hlavní autoři:	Dolatnezhadsomarin, Azam, Khorram, Esmaile, Yousefikhoshbakht, Majid
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.11.2024
Témata:	Hyperplane Multi-objective optimization problem Pareto front Pareto optimal solution Pascoletti-Serafini scalarization approach Pareto optimal solution Pareto front Pascoletti-Serafini scalarization approach Multi-objective optimization problem Hyperplane
ISSN:	1568-4946
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!