Determination of pruned pareto sets for the multi-objective system redundancy allocation problem

Sadan Kulturel-Konak, David W. Coit

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

In this paper, a new methodology is presented to solve multi-objective system redundancy allocation problems. A tabu search meta-heuristic approach is used to initially find the entire Pareto set, and then a Monte-Carlo simulation provides a decision maker with a pruned set of Pareto solutions based on decision maker's predefined objective function preferences. We are aiming to create a bridge between Pareto optimality and single solution approaches.

Original languageEnglish (US)
Title of host publicationProceedings of the 2007 IEEE Symposium on Computational Intelligence in Multicriteria Decision Making, MCDM 2007
Pages390-394
Number of pages5
DOIs
Publication statusPublished - Sep 25 2007
Event1st IEEE Symposium of Computational Intelligence in Multicriteria Decision Making, MCDM 2007 - Honolulu, HI, United States
Duration: Apr 1 2007Apr 5 2007

Publication series

NameProceedings of the 2007 IEEE Symposium on Computational Intelligence in Multicriteria Decision Making, MCDM 2007

Other

Other1st IEEE Symposium of Computational Intelligence in Multicriteria Decision Making, MCDM 2007
CountryUnited States
CityHonolulu, HI
Period4/1/074/5/07

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Control and Systems Engineering

Cite this

Kulturel-Konak, S., & Coit, D. W. (2007). Determination of pruned pareto sets for the multi-objective system redundancy allocation problem. In Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Multicriteria Decision Making, MCDM 2007 (pp. 390-394). [4223033] (Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Multicriteria Decision Making, MCDM 2007). https://doi.org/10.1109/MCDM.2007.369118