Pruning Algorithm for Multi-Objective Optimization with Decision Maker's Preferences of System Redundancy Allocation Problem

A preference-based ranking method is proposed to identify appropriate solutions among all trade-off solutions. This method expresses the decision maker's preference as a ranking priority of the objective functions. After obtaining the approximation of optimal solutions from a searching algorith...

Full description

Saved in:
Bibliographic Details
Published in2014 International Conference on IT Convergence and Security (ICITCS) pp. 1 - 4
Main Authors Sooktip, Tipwimol, Wattanapongsakorn, Naruemon
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2014
Subjects
Approximation algorithms
Approximation methods
Linear programming
Optimization
Redundancy
Resource management
Online AccessGet full text
DOI10.1109/ICITCS.2014.7021801

Cover

More Information
Summary:A preference-based ranking method is proposed to identify appropriate solutions among all trade-off solutions. This method expresses the decision maker's preference as a ranking priority of the objective functions. After obtaining the approximation of optimal solutions from a searching algorithm, the proposed pruning approach can specify the promising solutions while satisfying the decision maker's preferences which are specified as raking/relative priority of the objective functions. The proposed pruning method is demonstrated with a redundancy allocation problem of series-parallel system. The results show that the new method is generally effective to identify the preferred solutions. In addition, the proposed pruning method is easy to use even when the decision maker is not an expert in the problem solving.
DOI:10.1109/ICITCS.2014.7021801