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...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & operations research Vol. 117; pp. 104900 - 16
Main Authors:	Abouhawwash, Mohamed, Jameel, Mohammed, Deb, Kalyanmoy
Format:	Journal Article
Language:	English
Published:	New York Elsevier Ltd 01.05.2020 Pergamon Press Inc
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!