2017
DOI: 10.1007/s00170-017-0256-7
|View full text |Cite
|
Sign up to set email alerts
|

An effective strategy for improving the precision and computational efficiency of statistical tolerance optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(6 citation statements)
references
References 30 publications
0
6
0
Order By: Relevance
“…This is consistent with the simple tolerance analysis procedures described in handbooks [26,27] and commonly used in practice. The same approach is used in allocation methods taking into account the uncertainty on cost-tolerance functions [28,29] as well as in methods based on the optimization of objective functions including cost [30] and quality loss [31] by genetic algorithms.…”
Section: Literature Reviewmentioning
confidence: 99%
“…This is consistent with the simple tolerance analysis procedures described in handbooks [26,27] and commonly used in practice. The same approach is used in allocation methods taking into account the uncertainty on cost-tolerance functions [28,29] as well as in methods based on the optimization of objective functions including cost [30] and quality loss [31] by genetic algorithms.…”
Section: Literature Reviewmentioning
confidence: 99%
“…However, an optimal statistical allocation by Lagrange multipliers can be found only with an iterative numerical procedure [75,76]. Consequently, most applications of the functions use advanced allocation methods, such as genetic algorithms [62,[77][78][79][80][81][82][83][84][85], the bat algorithm [86], cuckoo search and particle swarm optimization [85], constraint networks [34,35], scatter search [87,88], pattern search [89], simulated annealing [90], a method based on Lambert W function [91,92], and fuzzy methods [93]. The function has also been used to solve problems with special formulations, such as interrelated tolerance chains [94,95], pre-selection of manufacturing processes [96], minimization of nonconforming fraction [97,98], allocation of geometric tolerances [99][100][101], minimization of cost and quality loss [102][103][104], robust design [105], simultaneous allocation of process averages and tolerances [106][107][108], multistation systems [109], and allocation combined with scheduling [110].…”
Section: Exponentialmentioning
confidence: 99%
“…1.5-2.5 (10-12 geometric tol.) [88] 25-400 small, 4-9 large 3-17 small, 300-800 large [4] 4.5-12 0.008-0.012 [78] 8-75 1.5-85 [31] 30-100 2.5-20 [89] 25-400 3-17 [85] -3-40 [94] 5-70 15-45 [104] 80-300 15-85 [92] 30-300 15-200 [106] 2-2500 30-300 [96] 200-300 40-100 [115] 0.2-15 50-4000 [86] 30-70 80-220 [84] 30-150 700-1400 [34] 2.5-4.2 1100-1400…”
Section: Tab 2: Values Of the Parameters Of The Exponential Function ...mentioning
confidence: 99%
“…Later, due to the advantages that the stochastic algorithms are not restricted by the gradient information of the objective function, compared with the deterministic algorithms, they can handle more complex tolerance allocation models, so they have been more widely used. Among the stochastic algorithms, there are some more common algorithms, such as simulated annealing (SA) [9], genetic algorithm (GA) [10], particle swarm optimization (PSO) [11], and ant colony algorithm; besides, some less common algorithms are also used for tolerance-cost optimization, such as the imperial competition algorithm [12], self-organizing migration algorithm [13], bat algorithm [14], artificial bee colony algorithm [15], and cuckoo search [16]. In addition, the application of hybrid algorithm in the field of tolerance allocation is also studied.…”
Section: Introductionmentioning
confidence: 99%