Quantitative Comparison of Approximate Solution Sets for Multicriteria Optimization Problems with Weighted Tchebycheff Preference Function
Authors:
- 1 June 2010
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 58 (3) , 650-659
Abstract
We consider the problem of evaluating the quality of solution sets generated by heuristics for multiple-objective combinatorial optimization problems. We extend previous research on the integrated preference functional (IPF), which assigns a scalar value to a given discrete set of nondominated points so that the weighted Tchebycheff function can be used as the underlying implicit value function. This extension is useful because modeling the decision maker's value function with the weighted Tchebycheff function reflects the impact of unsupported points when evaluating sets of nondominated points. We present an exact calculation method for the IPF measure in this case for an arbitrary number of criteria. We show that every nondominated point has its optimal weight interval for the weighted Tchebycheff function. Accordingly, all nondominated points, and not only the supported points in a set, contribute to the value of the IPF measure when using the weighted Tchebycheff function. Two- and three-criteria numerical examples illustrate the desirable properties of the weighted Tchebycheff function, providing a richer measure than the original IPF based on a convex combination of objectives.Keywords
This publication has 11 references indexed in Scilit:
- A Set of Test Cases for Performance Measures in Multiobjective OptimizationLecture Notes in Computer Science, 2008
- Evaluation of nondominated solution sets for k-objective optimization problems: An exact method and approximationsEuropean Journal of Operational Research, 2006
- Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problemsJournal of Scheduling, 2005
- Quantitative Comparison of Approximate Solution Sets for Bi‐criteria Optimization Problems*Decision Sciences, 2003
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programmingMathematical Programming, 2000
- A Combined Tchebycheff/Aspiration Criterion Vector Interactive Multiobjective Programming ProcedureManagement Science, 1993
- An interactive MCDM weight space reduction method utilizing a tchebycheff utility functionNaval Research Logistics (NRL), 1990
- A pareto raceNaval Research Logistics (NRL), 1988
- An interactive weighted Tchebycheff procedure for multiple objective programmingMathematical Programming, 1983
- The Use of Reference Objectives in Multiobjective Optimization1980