Performance measurement in multi objective combinatorial optimization

Download

index.pdf

Date

2007

Author

Bozkurt, Bilge

Metadata

Show full item record

Item Usage Stats

260
views

69
downloads

In this study we address the problem of measuring the quality of different sets of nondominated solutions obtained by different approaches in multi objective combinatorial optimization (MOCO). We propose a new measure that quantitatively compares the sets of nondominated solutions, without needing an efficient frontier. We develop the measure for bi-criteria and more than two criteria cases separately. Rather than considering only the supported solutions in the evaluation, the measure captures both supported and unsupported solutions through utilizing weighted Tchebycheff function characteristics. We also adapt this method for determining the neighborhood relations on the weight space for both bi-criteria and more than two criteria cases. We check the consistency of the neighborhood assumption on the objective space with the neighborhood relations on the weight space by this measure and obtain highly good results.

Subject Keywords

Systems Engineering

URI

http://etd.lib.metu.edu.tr/upload/2/12608843/index.pdf
https://hdl.handle.net/11511/16982

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

New approaches for performance evaluation using data envelopment analysis Özpeynirci, Nail Özgür; Köksalan, Murat; Department of Industrial Engineering (2004) Data Envelopment Analysis (DEA) assigns efficiency values to decision making units (DMU) in a given period by comparing the outputs with the inputs. In many applications, inputs and outputs of DMUs are monitored over time. There might be a time lag between the consumption of inputs and production of outputs. We develop approaches that aim to capture the time lag between the outputs and the inputs in assigning the efficiency values to DMUs. We present computational results on randomly generated problems as w...
Multiple criteria project selection problems Çağlar, Musa; Karasakal, Esra; Department of Industrial Engineering (2009) In this study, we propose two biobjective mathematical models based on PROMETHEE V method for project selection problems. We develop an interactive approach (ib-PROMETHEE V) including data mining techniques to solve the first proposed mathematical model. For the second model, we propose NSGA-II with constraint handling method. We also develop a Preference Based Interactive Multiobjective Genetic Algorithm (IMGA) to solve the second proposed mathematical model. We test the performance of NSGA-II with constra...
Approaches for multi-objective combinatorial optimization problems Lokman, Banu; Köksalan, Murat; Department of Industrial Engineering (2007) In this thesis, we develop two exact algorithms and a heuristic procedure for Multiobjective Combinatorial Optimization Problems (MOCO). Our exact algorithms guarantee to generate all nondominated solutions of any MOCO problem. We test the performance of the algorithms on randomly generated problems including the Multiobjective Knapsack Problem, Multi-objective Shortest Path Problem and Multi-objective Spanning Tree Problem. Although we showed the algorithms work much better than the previous ones, we also ...
An Approach for determining process economy parameters of multivariate loss functions Özkan, Gökçe; Köksal, Gülser; Department of Industrial Engineering (2016) The aim of this study is to provide an effective method for determining parameters of multivariate loss functions, which are related with process economics. The loss functions are widely used in product and process design and other quality engineering applications. Although there are several studies about different types of loss functions, there is a lack of studies on determining cost matrix parameters of these functions. For this purpose, we propose a method based on multi-objective decision making tools....
Interval priority weight generation from interval comparison matrices in analytic hierarchy process Öztürk, Ufuk; Karasakal, Esra; Department of Industrial Engineering (2009) In this study, for the well-known Analytic Hierarchy Process (AHP) method a new approach to interval priority weight generation from interval comparison matrix is proposed. This method can be used for both inconsistent and consistent matrices. Also for the problems having more than two hierarchical levels a synthesizing heuristic is presented. The performances of the methods, interval generation and synthesizing, are compared with the methods that are already available in the literature on randomly generate...

Citation Formats

B. Bozkurt, “Performance measurement in multi objective combinatorial optimization,” M.S. - Master of Science, Middle East Technical University, 2007.