Combining Max-Min and Max-Max Approaches for Robust SoS Architecting

被引:2
|
作者
Farhangi, Hadi [1 ]
Konur, Dincer [1 ]
Dagli, Cihan H. [1 ]
机构
[1] Missouri Univ Sci & Technol, Engn Management & Syst Engn, 600 W 14th St, Rolla, MO 65409 USA
来源
COMPLEX ADAPTIVE SYSTEMS | 2016年 / 95卷
关键词
System of Systems; Evolutionary Method; System Performance; SYSTEMS;
D O I
10.1016/j.procs.2016.09.299
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A System of Systems (SoS) architecting problem requires creating a selection of systems in order to provide a set of capabilities. SoS architecting finds many applications in military/defense projects. In this paper, we study a multi-objective SoS architecting problem, where the cost of the architecture is minimized while its performance is maximized. The cost of the architecture is the summation of the costs of the systems to be included in the SoS. Similarly, the performance of the architecture is defined as the sum of the performance of the capabilities, where the performance of a capability is the sum of the selected systems' contributions towards its performance. Here, nevertheless, the performance of a system in providing a capability is not known with certainty. To model this uncertainty, we assume that the performance of a system for providing a capability has lower and upper bounds and subject to complete uncertainty, i.e., no information is available about the probability distribution of the performance values. To solve the resulting multi-objective SoS architecting problem with uncertainty, we propose and compare three robust approaches: max-min, max-max, and max-mid. We apply these methods on a military example and numerically compare the results of the different approaches. (C) 2016 The Authors. Published by Elsevier B.V.
引用
收藏
页码:103 / 110
页数:8
相关论文
共 50 条
  • [1] Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint
    Halman, Nir
    Kovalyov, Mikhail Y.
    Quilliot, Alain
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2023, 21 (02): : 235 - 246
  • [2] Min-max and max-min graph saturation parameters
    Sudha, S.
    Arumugam, S.
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020, 17 (03) : 943 - 947
  • [3] MAX-MIN PROBLEMS
    KAPUR, KC
    NAVAL RESEARCH LOGISTICS, 1973, 20 (04) : 639 - 644
  • [4] A MAX-MIN PROBLEM
    MARSH, DCB
    AMERICAN MATHEMATICAL MONTHLY, 1967, 74 (1P1): : 86 - &
  • [5] Max-min separability
    Bagirov, AM
    OPTIMIZATION METHODS & SOFTWARE, 2005, 20 (2-3): : 271 - 290
  • [6] Max-Min Robust Principal Component Analysis
    Wang, Sisi
    Nie, Feiping
    Wang, Zheng
    Wang, Rong
    Li, Xuelong
    NEUROCOMPUTING, 2023, 521 : 89 - 98
  • [7] Min-max and max-min approaches to the solution of wave equation in relativistic quantum chemistry
    Datta, S. N.
    INDIAN JOURNAL OF PHYSICS, 2019, 93 (03) : 285 - 299
  • [8] A max-min ant system algorithm with εMAX selection
    Ogawa, Masato
    Li, Lei
    INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL, 2008, 11 (04): : 467 - 471
  • [9] Local Approximability of Max-Min and Min-Max Linear Programs
    Floreen, Patrik
    Hassinen, Marja
    Kaasinen, Joel
    Kaski, Petteri
    Musto, Topi
    Suomela, Jukka
    THEORY OF COMPUTING SYSTEMS, 2011, 49 (04) : 672 - 697
  • [10] Local Approximability of Max-Min and Min-Max Linear Programs
    Patrik Floréen
    Marja Hassinen
    Joel Kaasinen
    Petteri Kaski
    Topi Musto
    Jukka Suomela
    Theory of Computing Systems, 2011, 49 : 672 - 697