A REDUNDANCY ALLOCATION PROBLEM WITH THE CHOICE OF REDUNDANCY STRATEGIES BY A MEMETIC ALGORITHM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SAFARI J.; TAVAKOLI MOGHADAM R.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2010 | Volume:6 | Issue:11 Page(s): 6-16

Download Full-Text

View:

347

Download:

149

Cites:

Information Journal Paper

Title

A REDUNDANCY ALLOCATION PROBLEM WITH THE CHOICE OF REDUNDANCY STRATEGIES BY A MEMETIC ALGORITHM

Author(s)

SAFARI J. | TAVAKOLI MOGHADAM R. | Issue Writer Certificate

Keywords

MEMETIC ALGORITHM

REDUNDANCY STRATEGIES

REDUNDANCY ALLOCATION PROBLEM

SERIES-PARALLEL SYSTEMS

Abstract

This paper proposes an efficient algorithm based on MEMETIC ALGORITHM (MA) for a REDUNDANCY ALLOCATION PROBLEM without component mixing (RAPCM) in a series-parallel system when the redundancy strategy can be chosen for individual subsystems. Majority of the solution methods for the general RAPCM assume that the type of a redundancy strategy for each subsystem is pre-determined and known a priori. In general, active redundancy has traditionally received greater attention; however, in practice both active and cold-standby redundancies may be used within a particular system design. The choice of the redundancy strategy then becomes an additional decision variable. Thus, the problem is to select the best redundancy strategy, component and redundancy level for each subsystem in order to maximize the system reliability under system-level constraints. Due to its complexity and NP-hardness, it is so difficult to optimally solve such a problem by using traditional optimization tools. To validate the performance of the proposed MA in terms of solution quality, a number of test problems are examined and the robustness of this algorithm is then discussed. Finally, the related results are reported and it is shown that the proposed MA performs well.

Cites

USING NSGA II ALGORITHM FOR A THREE-OBJECTIVE REDUNDANCY ALLOCATION PROBLEM WITH K-OUT-OF-N SUB-SYSTEMS

References

No record.

Cite

APA: Copy

SAFARI, J., & TAVAKOLI MOGHADAM, R.. (2010). A REDUNDANCY ALLOCATION PROBLEM WITH THE CHOICE OF REDUNDANCY STRATEGIES BY A MEMETIC ALGORITHM. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 6(11), 6-16. SID. https://sid.ir/paper/309856/en

Vancouver: Copy

SAFARI J., TAVAKOLI MOGHADAM R.. A REDUNDANCY ALLOCATION PROBLEM WITH THE CHOICE OF REDUNDANCY STRATEGIES BY A MEMETIC ALGORITHM. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2010;6(11):6-16. Available from: https://sid.ir/paper/309856/en

IEEE: Copy

J. SAFARI, and R. TAVAKOLI MOGHADAM, “A REDUNDANCY ALLOCATION PROBLEM WITH THE CHOICE OF REDUNDANCY STRATEGIES BY A MEMETIC ALGORITHM,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 6, no. 11, pp. 6–16, 2010, [Online]. Available: https://sid.ir/paper/309856/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops