A Search Algorithm for Calculating Validated Reliability Bounds

نویسنده

  • Fulvio Tonon
چکیده

The search algorithm presented allows the CDF of a dependent variable to be bounded with 100% confidence, and allows for a guaranteed evaluation of the error involved. These reliability bounds are often enough to make decisions, and require a minimal number of function calls. The procedure is not intrusive, i.e. it can be equally applied when the function is a complex computer model (black box). The proposed procedure can handle input information consisting of probabilistic, interval-valued, set-valued, or random-set-valued information, as well as any combination thereof. The function as well as the joint pdf of the input variables can be of any type.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Structural Reliability: An Assessment Using a New and Efficient Two-Phase Method Based on Artificial Neural Network and a Harmony Search Algorithm

In this research, a two-phase algorithm based on the artificial neural network (ANN) and a harmony search (HS) algorithm has been developed with the aim of assessing the reliability of structures with implicit limit state functions. The proposed method involves the generation of datasets to be used specifically for training by Finite Element analysis, to establish an ANN model using a proven AN...

متن کامل

Local Search Genetic Algorithm for Optimization of Highly Reliable Communications Networks

This paper presents a genetic algorithm (GA) with specialized encoding, initialization and local search genetic operators to optimize communication network topologies. This NPhard problem is often highly constrained so that random initialization and standard genetic operators usually generate infeasible network architectures. Compounding this infeasibility issue is that the fitness function inv...

متن کامل

Local search genetic algorithm for optimal design of reliable networks

This paper presents a genetic algorithm (GA) with specialized encoding, initialization, and local search operators to optimize the design of communication network topologies. This NP-hard problem is often highly constrained so that random initialization and standard genetic operators usually generate infeasible networks. Another complication is that the fitness function involves calculating the...

متن کامل

A Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems

In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...

متن کامل

Solving Redundancy Allocation Problem with Repairable Components Using Genetic Algorithm and Simulation Method

Reliability optimization problem has a wide application in engineering area. One of the most important problems in reliability is redundancy allocation problem (RAP). In this research, we worked on a RAP with repairable components and k-out-of-n sub-systems structure. The objective function was to maximize system reliability under cost and weight constraints. The aim was determining optimal com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Reliable Computing

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2007