OPTIMIZATION OF CHANCE CONSTRAINED REDUNDANCY ALLOCATION PROBLEM WITH NON-CRISP COMPONENT RELIABILITIES

Sanat Kumar Mahato

OPTIMIZATION OF CHANCE CONSTRAINED REDUNDANCY ALLOCATION PROBLEM WITH NON-CRISP COMPONENT RELIABILITIES

December 2015

Vol-1, Issue-5

Paper ID: 1497

ISSN: 2395-4396

Downloads: 0

Abstract & Details

Research Area

Operations Research

Keywords

Optimization Reliability-redundancy Allocation Problem Non-crisp Number Interval Number Random Numbers Genetic Algorithm Chance Constraint Stochastic Simulation

Abstract

In this paper, we have considered the optimal solution of the reliability-redundancy allocation problems (RAP) involving chance constraints in non-crisp environment. The reliabilities of the components are not fixed numbers rather they are non-crisp/imprecise numbers. Also the constraints in the RAP considered are chance constraints which are stochastic in nature. We have proposed a stochastic simulation based Genetic Algorithm approach for solving the reliability optimization problems of the type mentioned in this paper. The impreciseness has been considered in terms of the stochastic approach and the interval approach. In case of the stochastic approach, the reliabilities of the components are taken to be random variables which are distributed normally. After that Monte-Carlo simulation method is used to convert the chance constraints into the deterministic ones. The changed problem is then solved by the real coded genetic algorithm based on stochastic simulation and the constraint handling procedure. Few numerical examples are reported to explain the efficiency of the projected method.

License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Author Information

#	Name	Institute / Affiliation
1	Sanat Kumar Mahato	Mejia Govt. College, Mejia, Bankura, West Bengal, India

How to Cite

Use the following formats to cite this article in your research.

APA Style

Mahato, Sanat Kumar (2015). OPTIMIZATION OF CHANCE CONSTRAINED REDUNDANCY ALLOCATION PROBLEM WITH NON-CRISP COMPONENT RELIABILITIES. International Journal of Advance Research and Innovative Ideas In Education, 1(5), 698-711.

MLA Style

Mahato, Sanat Kumar. "OPTIMIZATION OF CHANCE CONSTRAINED REDUNDANCY ALLOCATION PROBLEM WITH NON-CRISP COMPONENT RELIABILITIES." International Journal of Advance Research and Innovative Ideas In Education, vol. 1, no. 5, 2015, pp. 698-711.

IEEE Style

Sanat Kumar Mahato, "OPTIMIZATION OF CHANCE CONSTRAINED REDUNDANCY ALLOCATION PROBLEM WITH NON-CRISP COMPONENT RELIABILITIES," International Journal of Advance Research and Innovative Ideas In Education, vol. 1, no. 5, pp. 698-711, 2015.

Vancouver Style

Mahato Sanat Kumar. OPTIMIZATION OF CHANCE CONSTRAINED REDUNDANCY ALLOCATION PROBLEM WITH NON-CRISP COMPONENT RELIABILITIES. International Journal of Advance Research and Innovative Ideas In Education. 2015;1(5):698-711.

Harvard Style

Mahato, Sanat Kumar (2015) 'OPTIMIZATION OF CHANCE CONSTRAINED REDUNDANCY ALLOCATION PROBLEM WITH NON-CRISP COMPONENT RELIABILITIES', International Journal of Advance Research and Innovative Ideas In Education, 1(5), pp. 698-711.

Chicago Style

Mahato, Sanat Kumar. "OPTIMIZATION OF CHANCE CONSTRAINED REDUNDANCY ALLOCATION PROBLEM WITH NON-CRISP COMPONENT RELIABILITIES." International Journal of Advance Research and Innovative Ideas In Education 1, no. 5 (2015): 698-711.

Turabian Style

Mahato, Sanat Kumar. "OPTIMIZATION OF CHANCE CONSTRAINED REDUNDANCY ALLOCATION PROBLEM WITH NON-CRISP COMPONENT RELIABILITIES." International Journal of Advance Research and Innovative Ideas In Education 1, no. 5 (2015): 698-711.