A smooth proximity measure for optimality in multi-objective optimization using Benson’s method

Multi-objective optimization problems give rise to a set of trade-off Pareto-optimal solutions. To evaluate a set-based multi-objective optimization algorithm, such as an evolutionary multi-objective optimization (EMO) algorithm, for its convergence and diversity attainment, more than one performanc...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computers & operations research Ročník 117; s. 104900 - 16
Hlavní autori:	Abouhawwash, Mohamed, Jameel, Mohammed, Deb, Kalyanmoy
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Elsevier Ltd 01.05.2020 Pergamon Press Inc
Predmet:	Approximation Benson’s method Computational efficiency Computing costs Computing time Convergence Decision making Design engineering Direct KKTPM method Evolutionary algorithms Evolutionary computations Multi-objective optimization Multiple objective analysis Operations research Optimality conditions Optimization algorithms Parameters Pareto optimization Pareto optimum Performance measurement Tradeoffs Evolutionary computations Optimality conditions Multi-objective optimization Direct KKTPM method Benson’s method
ISSN:	0305-0548, 1873-765X, 0305-0548
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!