arrow
返回

An efficient heuristic for reliability design optimization problems

delete2010-02-01
delete31
delete
OA
AI
M
Mohamed Ouzineb
M
Mustapha Nourelfath *
M
Michel Gendreau
DOI:10.1016/j.cor.2009.04.011delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
This paper develops an efficient heuristic to solve two typical combinatorial optimization problems frequently met when designing highly reliable systems. The first one is the redundancy allocation problem (RAP) of series-parallel binary-state systems. The design goal of the RAP is to select the optimal combination of elements and redundancy levels to maximize system reliability subject to the system budget and to the system weight. The second problem is the expansion-scheduling problem (ESP) of multi-state series-parallel systems. In this problem, the study period is divided into several stages. At each stage, the demand is represented as a piecewise cumulative load curve. During the system life time, the demand can increase and the total productivity may become insufficient to assume the demand. To increase the total system productivity, elements are added to the existing system. The objective in the ESP is to minimize the sum of costs of the investments over the study period while satisfying availability constraints at each stage. The heuristic approach developed to solve the RAP and the ESP is based on a combination of space partitioning, genetic algorithms(GA) and tabu search(TS). After dividing the search space into a set of disjoint subsets, this approach uses GA to select the sub spaces, and applies TS to each selected subspace. Numerical results for the test problems from previous research are reported and compared. The results show the advantages of the proposed approach for solving both problems. (c) 2009 Elsevier Ltd. All rights reserved.
Keyword:
Tabu search
Genetic algorithms
Space partitioning
Redundancy optimization
Expansion planning
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Operations Research
IF:
4.3
论文数:
6.5K
被引数:
1.8W

机构

U
universite de montreal
学者数:
4.6W
论文数: 3.8W
被引数: 46
L
laval university
学者数:
2.5W
论文数: 2.2W
被引数: 96
引用论文

引用论文

err分享
err收藏
学者 查看更多内容