Pruned Pareto-optimal sets for the system redundancy allocation problem based on multiple prioritized objectives

Sadan Kulturel-Konak, David W. Coit, Fatema Baheranwala

Research output: Contribution to journalArticle

38 Citations (Scopus)

Abstract

In this paper, a new methodology is presented to solve different versions of multi-objective system redundancy allocation problems with prioritized objectives. Multi-objective problems are often solved by modifying them into equivalent single objective problems using pre-defined weights or utility functions. Then, a multi-objective problem is solved similar to a single objective problem returning a single solution. These methods can be problematic because assigning appropriate numerical values (i.e., weights) to an objective function can be challenging for many practitioners. On the other hand, methods such as genetic algorithms and tabu search often yield numerous non-dominated Pareto optimal solutions, which makes the selection of one single best solution very difficult. In this research, a tabu search meta-heuristic approach is used to initially find the entire Pareto-optimal front, and then, Monte-Carlo simulation provides a decision maker with a pruned and prioritized set of Pareto-optimal solutions based on user-defined objective function preferences. The purpose of this study is to create a bridge between Pareto optimality and single solution approaches.

Original languageEnglish (US)
Pages (from-to)335-357
Number of pages23
JournalJournal of Heuristics
Volume14
Issue number4
DOIs
StatePublished - Aug 1 2008

Fingerprint

Multiple Objectives
Redundancy
Tabu search
Pareto Optimal Solution
Tabu Search
Objective function
Genetic algorithms
Pareto Optimality
Utility Function
Metaheuristics
Weight Function
Monte Carlo Simulation
Multiple objectives
Allocation problem
Genetic Algorithm
Entire
Methodology
Optimal solution

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Computer Networks and Communications
  • Control and Optimization
  • Management Science and Operations Research
  • Artificial Intelligence

Cite this

@article{14b9c0dfdcba4fbfa46d88cc5047a81f,
title = "Pruned Pareto-optimal sets for the system redundancy allocation problem based on multiple prioritized objectives",
abstract = "In this paper, a new methodology is presented to solve different versions of multi-objective system redundancy allocation problems with prioritized objectives. Multi-objective problems are often solved by modifying them into equivalent single objective problems using pre-defined weights or utility functions. Then, a multi-objective problem is solved similar to a single objective problem returning a single solution. These methods can be problematic because assigning appropriate numerical values (i.e., weights) to an objective function can be challenging for many practitioners. On the other hand, methods such as genetic algorithms and tabu search often yield numerous non-dominated Pareto optimal solutions, which makes the selection of one single best solution very difficult. In this research, a tabu search meta-heuristic approach is used to initially find the entire Pareto-optimal front, and then, Monte-Carlo simulation provides a decision maker with a pruned and prioritized set of Pareto-optimal solutions based on user-defined objective function preferences. The purpose of this study is to create a bridge between Pareto optimality and single solution approaches.",
author = "Sadan Kulturel-Konak and Coit, {David W.} and Fatema Baheranwala",
year = "2008",
month = "8",
day = "1",
doi = "10.1007/s10732-007-9041-3",
language = "English (US)",
volume = "14",
pages = "335--357",
journal = "Journal of Heuristics",
issn = "1381-1231",
publisher = "Springer Netherlands",
number = "4",

}

Pruned Pareto-optimal sets for the system redundancy allocation problem based on multiple prioritized objectives. / Kulturel-Konak, Sadan; Coit, David W.; Baheranwala, Fatema.

In: Journal of Heuristics, Vol. 14, No. 4, 01.08.2008, p. 335-357.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Pruned Pareto-optimal sets for the system redundancy allocation problem based on multiple prioritized objectives

AU - Kulturel-Konak, Sadan

AU - Coit, David W.

AU - Baheranwala, Fatema

PY - 2008/8/1

Y1 - 2008/8/1

N2 - In this paper, a new methodology is presented to solve different versions of multi-objective system redundancy allocation problems with prioritized objectives. Multi-objective problems are often solved by modifying them into equivalent single objective problems using pre-defined weights or utility functions. Then, a multi-objective problem is solved similar to a single objective problem returning a single solution. These methods can be problematic because assigning appropriate numerical values (i.e., weights) to an objective function can be challenging for many practitioners. On the other hand, methods such as genetic algorithms and tabu search often yield numerous non-dominated Pareto optimal solutions, which makes the selection of one single best solution very difficult. In this research, a tabu search meta-heuristic approach is used to initially find the entire Pareto-optimal front, and then, Monte-Carlo simulation provides a decision maker with a pruned and prioritized set of Pareto-optimal solutions based on user-defined objective function preferences. The purpose of this study is to create a bridge between Pareto optimality and single solution approaches.

AB - In this paper, a new methodology is presented to solve different versions of multi-objective system redundancy allocation problems with prioritized objectives. Multi-objective problems are often solved by modifying them into equivalent single objective problems using pre-defined weights or utility functions. Then, a multi-objective problem is solved similar to a single objective problem returning a single solution. These methods can be problematic because assigning appropriate numerical values (i.e., weights) to an objective function can be challenging for many practitioners. On the other hand, methods such as genetic algorithms and tabu search often yield numerous non-dominated Pareto optimal solutions, which makes the selection of one single best solution very difficult. In this research, a tabu search meta-heuristic approach is used to initially find the entire Pareto-optimal front, and then, Monte-Carlo simulation provides a decision maker with a pruned and prioritized set of Pareto-optimal solutions based on user-defined objective function preferences. The purpose of this study is to create a bridge between Pareto optimality and single solution approaches.

UR - http://www.scopus.com/inward/record.url?scp=40749151759&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=40749151759&partnerID=8YFLogxK

U2 - 10.1007/s10732-007-9041-3

DO - 10.1007/s10732-007-9041-3

M3 - Article

AN - SCOPUS:40749151759

VL - 14

SP - 335

EP - 357

JO - Journal of Heuristics

JF - Journal of Heuristics

SN - 1381-1231

IS - 4

ER -