IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i11p1173-d560271.html
   My bibliography  Save this article

Design Improvement for Complex Systems with Uncertainty

Author

Listed:
  • Yue Chen

    (School of Statistics, Capital University of Economics and Business, Beijing 100070, China)

  • Jian Shi

    (Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100864, China
    School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 100049, China)

  • Xiao-Jian Yi

    (School of Mechatronical Engineering, Beijing Institute of Technology, Beijing 100811, China)

Abstract

The uncertainty of the engineering system increases with its complexity, therefore, the tolerance to the uncertainty becomes important. Even under large variations of design parameters, the system performance should achieve the design goal in the design phase. Therefore, engineers are interested in how to turn a bad design into a good one with the least effort in the presence of uncertainty. To improve a bad design, we classify design parameters into key parameters and non-key parameters based on engineering knowledge, and then seek the maximum solution hyper-box which already includes non-key parameters of this bad design. The solution hyper-box on which all design points are good, that is, they achieve the design goal, provides target intervals for each parameter. The bad design can be turned into a good one by only moving its key parameters into their target intervals. In this paper, the PSO-Divide-Best method is proposed to seek the maximum solution hyper-box which is in compliance with the constraints. This proposed approach has a considerably high possibility to find the globally maximum solution hyper-box that satisfies the constraints and can be used in complex systems with black-box performance functions. Finally, case studies show that the proposed approach outperforms the EPCP and IA-CES methods in the literature.

Suggested Citation

  • Yue Chen & Jian Shi & Xiao-Jian Yi, 2021. "Design Improvement for Complex Systems with Uncertainty," Mathematics, MDPI, vol. 9(11), pages 1-20, May.
  • Handle: RePEc:gam:jmathe:v:9:y:2021:i:11:p:1173-:d:560271
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/11/1173/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/9/11/1173/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yue Chen & Jian Shi & Xiao-jian Yi, 2020. "A New Reliable Operating Region Design Method," Mathematical Problems in Engineering, Hindawi, vol. 2020, pages 1-12, February.
    2. Yue Chen & Jian Shi & Xiao-jian Yi, 2020. "A Globally Optimal Robust Design Method for Complex Systems," Complexity, Hindawi, vol. 2020, pages 1-25, May.
    3. Remigijus Paulavičius & Lakhdar Chiter & Julius Žilinskas, 2018. "Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants," Journal of Global Optimization, Springer, vol. 71(1), pages 5-20, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Khalid Abdulaziz Alnowibet & Salem Mahdi & Ahmad M. Alshamrani & Karam M. Sallam & Ali Wagdy Mohamed, 2022. "A Family of Hybrid Stochastic Conjugate Gradient Algorithms for Local and Global Minimization Problems," Mathematics, MDPI, vol. 10(19), pages 1-37, October.
    2. Kaiwen Ma & Luis Miguel Rios & Atharv Bhosekar & Nikolaos V. Sahinidis & Sreekanth Rajagopalan, 2023. "Branch-and-Model: a derivative-free global optimization algorithm," Computational Optimization and Applications, Springer, vol. 85(2), pages 337-367, June.
    3. Stripinis, Linas & Žilinskas, Julius & Casado, Leocadio G. & Paulavičius, Remigijus, 2021. "On MATLAB experience in accelerating DIRECT-GLce algorithm for constrained global optimization through dynamic data structures and parallelization," Applied Mathematics and Computation, Elsevier, vol. 390(C).
    4. Linas Stripinis & Remigijus Paulavičius, 2023. "Novel Algorithm for Linearly Constrained Derivative Free Global Optimization of Lipschitz Functions," Mathematics, MDPI, vol. 11(13), pages 1-19, June.
    5. Nazih-Eddine Belkacem & Lakhdar Chiter & Mohammed Louaked, 2024. "A Novel Approach to Enhance DIRECT -Type Algorithms for Hyper-Rectangle Identification," Mathematics, MDPI, vol. 12(2), pages 1-24, January.
    6. Donald R. Jones & Joaquim R. R. A. Martins, 2021. "The DIRECT algorithm: 25 years Later," Journal of Global Optimization, Springer, vol. 79(3), pages 521-566, March.
    7. Jane Parker & Ozan Nadir Alakavuklar & Sam Huggard, 2021. "Social movement unionism through radical democracy: The case of the New Zealand Council of Trade Unions and climate change," Industrial Relations Journal, Wiley Blackwell, vol. 52(3), pages 270-285, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:11:p:1173-:d:560271. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.