• ISA provides technical resources and standards to help industrial automation professionals advance their careers and the field. We enable automation professionals worldwide to solve problems and enhance their skills by bringing people together to create new technologies and share best practices with future automation professionals.
    • Industry Insights

  • We attract over 140,000 unique automation professionals monthly, making us the premier online content provider and the only dedicated electronic magazine in the automation industry.

    Monthly Magazine

    • More things to read

    Back
    Back
  • M logo for Automation.com Monthly. Link to current issue.

Bi-Objective Redundancy Allocation Problem

By: ISA Transactions
02 January, 2015
1 min read
Bi-Objective Redundancy Allocation Problem
Bi-Objective Redundancy Allocation Problem
A new Mixed Integer Nonlinear Programming model is presented to analyze the availability optimization of a system with a given structure.

This post is an excerpt from the journal ISA Transactions.  All ISA Transactions articles are free to ISA members, or can be purchased from Elsevier Press.

Abstract:

Traditionally, in the redundancy allocation problem (RAP), two general classes of optimization problems are considered; reliability optimization and availability optimization. Contrary to reliability optimization, fewer Packaging machine in brewery researchers have studied availability optimization to find out the optimal combination of components type and redundancy levels for each subsystem in a system for maximizing (or minimizing) the objectives. In each problem it is assumed that either the entire components are repairable or they are non-repairable. However, in real world situations, systems usually consist of both repairable and non-repairable components.

In this paper a new Mixed Integer Nonlinear Programming (MINLP) model is presented to analyze the availability optimization of a system with a given structure, using both repairable and non-repairable components, simultaneously. To find the solution of the introduced MINLP, an efficient Genetic Algorithm (GA) is also developed. Furthermore, to show the efficiency of the proposed GA, a numerical example is presented. Experimental results demonstrate that the proposed GA has a better performance compared to one of the most recommended algorithm in the literature.

Free Bonus! To read the full version of this ISA Transactions article, click here.

ISA membership entitles you to free access to all ISA Transactions articles plus a wealth of technical content, industry information, free webinars, training opportunities, program discounts, certification and licensure and professional networking.

Click here to join ISA ... learn, advance, succeed! [/dropshadowbox]

2006 Elsevier Science Ltd. All rights reserved.

Advertisement

Trending Articles

Advertisement

Related Articles

View all Articles and News
Advertisement
Advertisement