Compromise utilitarian solutions in multi-criteria optimization problems as a guide for evolutionary algorithms

Authors:
M. A. Hinojosa;A. D. LóPez-SáNchez;Alfredo G. HernáNdez-DíAz;Luis V. Santana-Quintero
Affiliations:
Departamento de Economía, Métodos Cuantitativos e Historia Económica, Universidad Pablo de Olavide, Ctra, Utrera, Km 1, 41013 Sevilla, Spain;Departamento de Economía, Métodos Cuantitativos e Historia Económica, Universidad Pablo de Olavide, Ctra, Utrera, Km 1, 41013 Sevilla, Spain;Departamento de Economía, Métodos Cuantitativos e Historia Económica, Universidad Pablo de Olavide, Ctra, Utrera, Km 1, 41013 Sevilla, Spain;Krasnow Institute at George Mason University, Fairfax, VA 22030-4444, USA
Venue:
Computers and Operations Research
Year:
2013

Citing 7
Cited 0

Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
Tolerance Sensitivity and Optimality Bounds in Linear Programming

Management Science
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results

Evolutionary Computation
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)

Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
Evolutionary multiobjective optimization using an outranking-based dominance generalization

Computers and Operations Research
Simple procedures of choice in multicriteria problems without precise information about the alternatives' values

Computers and Operations Research
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

Multi-criteria optimization problems are considered where the decision maker is unable to determine the exact weights of importance of the criteria but can provide some imprecise information about these weights. Two solution concepts are studied in this framework: the optimistic min-max solution and the compromise utilitarian solution, both of which can be exactly computed for linear problems. For general problems, it is shown that these solutions can be approximated by means of a slight modification of the evolutionary algorithm NSGA-II.