scholarly journals Reliability Optimization and Importance Analysis of Circular-Consecutive k-out-of-n System

2017 ◽  
Vol 2017 ◽  
pp. 1-17
Author(s):  
Shuai Zhang ◽  
Jiang-bin Zhao ◽  
Hong-guang Li ◽  
Ning Wang
Keyword(s):  
Genetic Algorithm ◽  
Numerical Experiments ◽  
Search Algorithms ◽  
Typical Case ◽  
Reliability Optimization ◽  
Component Reliability ◽  
Component Importance ◽  
Optimal Permutation ◽  
Importance Analysis ◽  
Effectiveness And Efficiency

The circular-consecutive k-out-of-n:F(G) system (Cir/Con/k/n:F(G) system) usually consists of n components arranged in a circle where the system fails (works) if consecutive k components fail (work). The optimization of the Cir/Con/k/n system is a typical case in the component assignment problem. In this paper, the Birnbaum importance-based genetic algorithm (BIGA), which takes the advantages of genetic algorithm and Birnbaum importance, is introduced to deal with the reliability optimization for Cir/Con/k/n system. The detailed process and property of BIGA are put forward at first. Then, some numerical experiments are implemented, whose results are compared with two classic Birnbaum importance-based search algorithms, to evaluate the effectiveness and efficiency of BIGA in Cir/Con/k/n system. Finally, three typical cases of Cir/Con/k/n systems are introduced to demonstrate the relationships among the component reliability, optimal permutation, and component importance.

Component Reliability Importance Measure in Presence of Transient Faults

2011 ◽  
Vol 58-60 ◽  
pp. 529-534 ◽  
Author(s):  
Xin Qi ◽  
De C. Zuo ◽  
Zhan Zhang ◽  
Xiao Zong Yang
Keyword(s):  
Field Data ◽  
Importance Measure ◽  
Transient Faults ◽  
Composite Measure ◽  
Component Reliability ◽  
Component Importance ◽  
Importance Analysis ◽  
System Improvement ◽  
State Changes ◽  
Consistent Performance

Importance measures are widely used to characterize the contribution of components to the system performance such as reliability, availability, risk, etc, and thus give great help in identifying system weaknesses and prioritizing system improvement activities. Although much work has been carried out on component importance analysis, most studies only concern the consistent states of components within which components exhibit consistent performance until state changes happen. Unfortunately, field data shows that many transient faults in components may result in severe consequences without causing any state changes, and, this can lead to a misunderstanding of component importance. This paper focuses on the reliability importance analysis in presence of transient faults, and proposes a composite measure for evaluation. A sample series parallel system is analyzed to illustrate the use of this measure.

COMPUTING AN ADAPTIVE MESH IN FLUID PROBLEMS USING NEURAL NETWORK AND GENETIC ALGORITHM WITH ADAPTIVE RELAXATION

2008 ◽  
Vol 17 (06) ◽  
pp. 1089-1108 ◽  
Author(s):  
NAMEER N. EL. EMAM ◽  
RASHEED ABDUL SHAHEED
Keyword(s):  
Neural Network ◽  
Genetic Algorithm ◽  
Numerical Experiments ◽  
Back Propagation ◽  
Adaptive Mesh ◽  
Learning System ◽  
Back Propagation Algorithm ◽  
Adaptive Smoothing ◽  
Different Types ◽  
Optimal Values

A method based on neural network with Back-Propagation Algorithm (BPA) and Adaptive Smoothing Errors (ASE), and a Genetic Algorithm (GA) employing a new concept named Adaptive Relaxation (GAAR) is presented in this paper to construct learning system that can find an Adaptive Mesh points (AM) in fluid problems. AM based on reallocation scheme is implemented on different types of two steps channels by using a three layer neural network with GA. Results of numerical experiments using Finite Element Method (FEM) are discussed. Such discussion is intended to validate the process and to demonstrate the performance of the proposed learning system on three types of two steps channels. It appears that training is fast enough and accurate due to the optimal values of weights by using a few numbers of patterns. Results confirm that the presented neural network with the proposed GA consistently finds better solutions than the conventional neural network.

scholarly journals Integrated Harvest and Farm-to-Door Distribution Scheduling with Postharvest Quality Deterioration for Vegetable Online Retailing

Agronomy ◽  
2019 ◽  
Vol 9 (11) ◽  
pp. 724
Author(s):  
Yiping Jiang ◽  
Bei Bian ◽  
Lingling Li
Keyword(s):  
Genetic Algorithm ◽  
Numerical Experiments ◽  
Programming Model ◽  
Time Windows ◽  
Sensitivity Analyses ◽  
Postharvest Quality ◽  
Online Retailing ◽  
Quality Deterioration ◽  
Distribution Scheduling ◽  
Proposed Model

With the rise of vegetable online retailing in recent years, the fulfillment of vegetable online orders has been receiving more and more attention. This paper addresses an integrated optimization model for harvest and farm-to-door distribution scheduling for vegetable online retailing. Firstly, we capture the perishable property of vegetables, and model it as a quadratic postharvest quality deterioration function. Then, we incorporate the postharvest quality deterioration function into the integrated harvest and farm-to-door distribution scheduling and formulate it as a quadratic vehicle routing programming model with time windows. Next, we propose a genetic algorithm with adaptive operators (GAAO) to solve the model. Finally, we carry out numerical experiments to verify the performance of the proposed model and algorithm, and report the results of numerical experiments and sensitivity analyses.

Solving Machine Loading Problem of FMS

2011 ◽  
pp. 19-43 ◽  
Author(s):  
Anoop Prakash ◽  
Nagesh Shukla ◽  
Ravi Shankar ◽  
Manoj Kumar Tiwari
Keyword(s):  
Genetic Algorithm ◽  
Ant Colony Optimization ◽  
Flexible Manufacturing ◽  
Manufacturing Systems ◽  
Random Search ◽  
Search Algorithms ◽  
Ant Colony ◽  
Complex Nature ◽  
Machine Loading ◽  
Loading Problem

Artificial intelligence (AI) refers to intelligence artificially realized through computation. AI has emerged as one of the promising computer science discipline originated in mid-1950. Over the past few decades, AI based random search algorithms, namely, genetic algorithm, ant colony optimization, and so forth have found their applicability in solving various real-world problems of complex nature. This chapter is mainly concerned with the application of some AI based random search algorithms, namely, genetic algorithm (GA), ant colony optimization (ACO), simulated annealing (SA), artificial immune system (AIS), and tabu search (TS), to solve the machine loading problem in flexible manufacturing system. Performance evaluation of the aforementioned search algorithms have been tested over standard benchmark dataset. In addition, the results obtained from them are compared with the results of some of the best heuristic procedures in the literature. The objectives of the present chapter is to make the readers fully aware about the intricate solutions existing in the machine loading problem of flexible manufacturing systems (FMS) to exemplify the generic procedure of various AI based random search algorithms. Also, the present chapter describes the step-wise implementation of search algorithms over machine loading problem.

Sign in / Sign up

Export Citation Format

Share Document