1993
DOI: 10.1016/0010-4485(93)90075-y
|View full text |Cite
|
Sign up to set email alerts
|

Optimal tolerance allotment using a genetic algorithm and truncated Monte Carlo simulation

Abstract: As is typical of stochastic-optimization problems, the multivariate integration of the probability-density function is the most difficult task in the optimal allotment of tolerances. In this paper, a truncated Monte Carlo simulation and a genetic algorithm are used as analysis (i.e. multivariate-integration) and synthesis (i.e. optimization) tools, respectively. The new method has performed robustly in limited experiments, and was able to provide a significant reduction in optimal cost when compared with resul… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
29
0
2

Year Published

1999
1999
2014
2014

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 83 publications
(31 citation statements)
references
References 11 publications
0
29
0
2
Order By: Relevance
“…There have been several e orts in this direction 15,19,56 . Also, heuristic techniques for optimization such as simulated annealing, genetic algorithms, Lagrangian relaxation, and Tabu search have been used by researchers 57 59 .…”
Section: Optimization Methodsmentioning
confidence: 99%
“…There have been several e orts in this direction 15,19,56 . Also, heuristic techniques for optimization such as simulated annealing, genetic algorithms, Lagrangian relaxation, and Tabu search have been used by researchers 57 59 .…”
Section: Optimization Methodsmentioning
confidence: 99%
“…This solution is mainly based on mathematical functions (such as power, exponential or polynomial functions [4,5,14,18]) which only express the manufacturing cost considering the tolerance interval to produce (4). They occur mainly in the following form:…”
Section: Tolerance Allocationmentioning
confidence: 99%
“…The SA algorithm has the ability of escaping from local minima and has been applied widely (see Dougherty and Marryott 1991;Marryott 1996;Goldman and Mays 1999;Cunha and Sousa 2001). If the energy of generated new state is lower than that of the previous one, the change is accepted unconditionally and the system is updated; otherwise, the new state is accepted by Metropolis criterion with a probability function so as to ensure that the algorithm has the ability of escaping from local minimum energy state and reaching global minimum (Lee and Johnson 1993). The SA has been so far little applied to the optimal operation of reservoir systems.…”
Section: Introductionmentioning
confidence: 99%