Optimization multi -state series weighted k-out-of-n systems by ant colony algorithm

被引：1

作者：

Ebrahimipur, V. ^{[1
]}

Shabani, A. ^{[1
]}

机构：

[1] Univ Tehran, Dept Ind Engn, Tehran, Iran

来源：

2009 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1-4 | 2009年

关键词：

reliability; multi state; weighted k-out-of-n; universal moment generating function (UMGF); recursive algorithm; ant colony algorithm; UNIVERSAL GENERATING FUNCTION; REDUNDANCY ALLOCATION PROBLEM; CONSTRAINTS; POLICIES;

D O I：

10.1109/IEEM.2009.5373360

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

In this paper a multi state series-weighted k-out-of-n system is presented. This system has S multi state weighted k-out-of-n subsystems that are seriely connected. A new approach is used for calculating reliability of the system. In this approach first we find reliability of each subsystem by recursive algorithm, and then the universal moment generating function (UMGF) is used to calculate reliability of the whole system. In the following reliability of the system is optimized. Multi-state system (MSS) reliability is defined as the ability to maintain a specified performance level. Objective function in the optimization model is maximizing the reliability of the system, constraint is cost and weight of the system and decision variables are the number and the versions of components for each subsystem. Since this problem is a combinatorial and Np-hard problem, ant colony algorithm is used for optimization

引用

页码：281 / 285

页数：5

共 22 条

[1]

[Anonymous], 1993, Introduction to Probability Models

[2]

Billinton R., 1990, RELIABILITY EVALUATI

[3]

Coit D.W., 1995, P 4 IND ENG RES C IE

[4] Ant algorithms for discrete optimization [J].