Integrating a bi-objective paradigm to tolerance optimization

被引:14
作者
Shin, S.
Cho, B. R. [1 ]
机构
[1] Clemson Univ, Dept Ind Engn, Clemson, SC 29634 USA
[2] Inje Univ, Dept Syst Management Engn, Gimhae 621749, Kyung Nam, South Korea
关键词
tolerance design; optimal specification limits; weighted-sum method; weighted-tchebycheff method; optimization;
D O I
10.1080/00207540701325181
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The primary goal of tolerance design is to determine the optimal tolerance by minimizing quality loss and process costs (i.e. manufacturing and rejection costs). Most tolerance design models find the optimal tolerance by considering a sum of process quality and costs. In real-world industrial settings, however, quality practitioners often need a balance associated with the quality and costs. For this reason, a bi-objective tolerance optimization problem for obtaining the Pareto solutions of the quality and costs need to be considered. In practical situations, objective functions in many tolerance optimization models reported in the research community often become a high-order, and the associated Pareto frontiers can be non-convex. Thus, it is known that obtaining efficient solutions using the conventional weighted-sum method widely used in tolerance optimization is unlikely. To address this concern, we develop a weighted-Tchebycheff based bi-objective tolerance design model to obtain all efficient solutions and a non-convex Pareto frontier. The weighted-Tchebycheff method is far more effective than any other when a function has higher-order terms or is neither convex nor concave. A numerical example is provided, and a comparison between the two methods is made.
引用
收藏
页码:5509 / 5525
页数:17
相关论文
共 50 条
  • [31] Bi-objective green vehicle routing problem
    Erdogdu, Kazim
    Karabulut, Korhan
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2022, 29 (03) : 1602 - 1626
  • [32] Bi-objective Heterogeneous Consolidation in Cloud Computing
    Galaviz-Alejos, Luis-Angel
    Armenta-Cano, Fermin
    Tchernykh, Andrei
    Radchenko, Gleb
    Drozdov, Alexander Yu.
    Sergiyenko, Oleg
    Yahyapour, Ramin
    HIGH PERFORMANCE COMPUTING, 2018, 796 : 384 - 398
  • [33] Pareto front generation for bridge deck management system using bi-objective optimization
    Hyung Seop Shim
    Seung Hyun Lee
    Bo Soon Kang
    KSCE Journal of Civil Engineering, 2017, 21 : 1563 - 1572
  • [34] Bi-Objective Scheduling of Fire Engines for Fighting Forest Fires: New Optimization Approaches
    Wu, Peng
    Chu, Feng
    Che, Ada
    Zhou, MengChu
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2018, 19 (04) : 1140 - 1151
  • [35] Bi-Objective Indirect Optimization of Robotic Transportation Task Assignment Based on Auction Mechanism
    Souleymane, Moussa G.
    M'hammed, Sahnoun
    Fabrice, Duval
    Abdelaziz, Bensrhair
    2020 IEEE ELECTRON DEVICES TECHNOLOGY AND MANUFACTURING CONFERENCE (EDTM 2020), 2020,
  • [36] A study of the bi-objective next release problem
    Durillo, Juan J.
    Zhang, Yuanyuan
    Alba, Enrique
    Harman, Mark
    Nebro, Antonio J.
    EMPIRICAL SOFTWARE ENGINEERING, 2011, 16 (01) : 29 - 60
  • [37] Integrating the Lambert W function to a tolerance optimization problem
    Shin, S
    Govindaluri, MS
    Cho, BR
    QUALITY AND RELIABILITY ENGINEERING INTERNATIONAL, 2005, 21 (08) : 795 - 808
  • [38] From Single-Objective to Bi-Objective Maximum Satisfiability Solving
    Jabs, Christoph
    Berg, Jeremias
    Niskanen, Andreas
    Jarvisalo, Matti
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2024, 80 : 1223 - 1269
  • [39] Solving a new bi-objective model for relief logistics in a humanitarian supply chain using bi-objective meta-heuristic algorithms
    Saatchi, H. Madani
    Khamseh, A. Arshadi
    Tavakkoli-Moghaddam, R.
    SCIENTIA IRANICA, 2021, 28 (05) : 2948 - 2971
  • [40] Bi-Objective Optimization of Information Rate and Harvested Power in RIS-Aided SWIPT Systems
    Mohamed, Abdelhamed
    Zappone, A.
    Di Renzo, Marco
    IEEE WIRELESS COMMUNICATIONS LETTERS, 2022, 11 (10) : 2195 - 2199