DEVELOPING A BI-OBJECTIVE OPTIMIZATION MODEL FOR SOLVING THE AVAILABILITY ALLOCATION PROBLEM IN REPAIRABLE SERIES–PARALLEL SYSTEMS BY NSGA II

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.

AMIRI MAGHSOUD; KHAJEH MOSTAFA

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2016 | Volume:12 | Issue:1 Page(s): 61-69

Download Full-Text

View:

487

Download:

146

Cites:

Information Journal Paper

Title

DEVELOPING A BI-OBJECTIVE OPTIMIZATION MODEL FOR SOLVING THE AVAILABILITY ALLOCATION PROBLEM IN REPAIRABLE SERIES–PARALLEL SYSTEMS BY NSGA II

Author(s)

AMIRI MAGHSOUD | KHAJEH MOSTAFA | Issue Writer Certificate

Keywords

AVAILABILITY ALLOCATION

SERIES–PARALLEL SYSTEM

REPAIRABLE COMPONENTS

NSGA II

Abstract

Bi-objective optimization of the AVAILABILITY ALLOCATION problem in a SERIES–PARALLEL SYSTEM with REPAIRABLE COMPONENTS is aimed in this paper. The two objectives of the problem are the availability of the system and the total cost of the system. Regarding the previous studies in SERIES–PARALLEL SYSTEMs, the main contribution of this study is to expand the redundancy allocation problems to systems that have REPAIRABLE COMPONENTS. Therefore, the considered systems in this paper are the systems that have REPAIRABLE COMPONENTS in their configurations and subsystems.Due to the complexity of the model, a meta-heuristic method called as non-dominated sorting genetic algorithm is applied to find Pareto front. After finding the Pareto front, a procedure is used to select the best solution from the Pareto front.

Cites

No record.

References