Solving multi-objective inverse problems of chained manufacturing processes

被引:3
|
作者
Hoffer, J. G. [1 ]
Geiger, B. C. [2 ]
Kern, R. [3 ]
机构
[1] Bohler Aerosp GmbH & Co KG, Mariazellerstr 25, Kapfenberg, Austria
[2] Know Ctr GmbH, Inffeldgasse 13, Graz, Austria
[3] Graz Univ Technol, Inst Interact Syst & Data Sci, Inffeldgasse 16c, A-8010 Graz, Austria
关键词
Bayesian optimization; Gaussian process regression; Manufacturing; Multi-objective optimization; Process optimization; GAUSSIAN-PROCESSES; OPTIMIZATION; MODEL; PREDICTION;
D O I
10.1016/j.cirpj.2022.11.007
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This research presents an approach that combines stacked Gaussian processes (stacked GP) with target vector Bayesian optimization (BO) to solve multi-objective inverse problems of chained manufacturing processes. In this context, GP surrogate models represent individual manufacturing processes and are stacked to build a unified surrogate model that represents the entire manufacturing process chain. Using stacked GPs, epistemic uncertainty can be propagated through all chained manufacturing processes. To perform target vector BO, acquisition functions make use of a noncentral chi-squared distribution of the squared Euclidean distance between a given target vector and surrogate model output. In BO of chained processes, there are the options to use a single unified surrogate model that represents the entire joint chain, or that there is a surrogate model for each individual process and the optimization is cascaded from the last to the first process. Literature suggests that a joint optimization approach using stacked GPs overestimates uncertainty, whereas a cascaded approach underestimates it. For improved target vector BO results of chained processes, we present an approach that combines methods which under-or overestimate uncertainties in an ensemble for rank aggregation. We present a thorough analysis of the proposed methods and evaluate on two artificial use cases and on a typical manufacturing process chain: preforming and final pressing of an Inconel 625 superalloy billet. (c) 2022 CIRP.
引用
收藏
页码:213 / 231
页数:19
相关论文
共 50 条
  • [42] Solving Multi-Objective Problems Using Bird Swarm Algorithm
    Houssein, Essam H.
    Ahmed, Mohammed M.
    Abd Elaziz, Mohamed
    Ewees, Ahmed A.
    Ghoniem, Rania M.
    IEEE ACCESS, 2021, 9 : 36382 - 36398
  • [43] Multi-objective optimization of biomass diffusers for solving operational problems
    Barbosa, L. S. N. S.
    Santiago, P. A.
    Junior, P. S.
    BIOMASS CONVERSION AND BIOREFINERY, 2022, 12 (07) : 2861 - 2879
  • [44] A collaborative evolutionary algorithm for solving constrained multi-objective problems
    Wang R.
    Gu Q.-H.
    Gu, Qing-Hua (qinghuagu@126.com); Gu, Qing-Hua (qinghuagu@126.com), 1600, Northeast University (36): : 2656 - 2664
  • [45] A hybrid method for solving multi-objective global optimization problems
    C. Gil
    A. Márquez
    R. Baños
    M. G. Montoya
    J. Gómez
    Journal of Global Optimization, 2007, 38 : 265 - 281
  • [46] Solving Multi-objective Dynamic Travelling Salesman Problems by Relaxation
    Ricciardi, Lorenzo A.
    Vasile, Massimiliano
    PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION (GECCCO'19 COMPANION), 2019, : 1999 - 2007
  • [47] Solving multi-objective production scheduling problems using metaheuristics
    Loukil, T
    Teghem, J
    Tuyttens, D
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 161 (01) : 42 - 61
  • [48] Water cycle algorithm for solving multi-objective optimization problems
    Sadollah, Ali
    Eskandar, Hadi
    Bahreininejad, Ardeshir
    Kim, Joong Hoon
    SOFT COMPUTING, 2015, 19 (09) : 2587 - 2603
  • [49] Multi-objective optimization of biomass diffusers for solving operational problems
    L. S. N. S. Barbosa
    P. A. Santiago
    P. S. Junior
    Biomass Conversion and Biorefinery, 2022, 12 : 2861 - 2879
  • [50] Solving multi-objective production scheduling problems with Tabu Search
    Loukil, T
    Teghem, J
    Fortemps, P
    CONTROL AND CYBERNETICS, 2000, 29 (03): : 819 - 828