Searching Pareto Solutions for Bi-objective Series k-out-of-N System Component Allocation Problems using the Breadth First Search Method(Theory and Methodology)
スポンサーリンク
概要
- 論文の詳細を見る
A series-parallel system is one of the most popular redundant system models. It consists of subsystems that are connected in series and each subsystem consists of interchangeable components in parallel. There are two types of such systems: all components can work for all subsystems, or the components consisting of a certain subsystem can work only in that specific subsystem. For the first case, there are some heuristic methods to approximately solve the optimal component allocation. Yamachi et al. [9,10] proposed an algorithm that obtains the exact Pareto solutions for problems that are not so large, and a solution method that obtains approximate solutions for large problems. The method was based on an evolutional algorithm. For the second case, Yamachi et al. [13] proposed the depth first search (DFS) algorithm that obtains exact Pareto solutions using the branch and bound method. The method is made for a series k-out-of-n system, which is a system consisting of k-out-of-N subsystems that are connected in series. In this paper, we propose an alternate method for the second case; a new algorithm that employs the breadth first search (BFS) method to find Pareto solutions for a series k-out-of-n system more efficiently than the existing algorithm.
- 2011-02-15
著者
-
Tsujimura Yasuhiro
Department Of Computer And Information Engg. Nippon Institute Of Technology
-
Yamamoto Hisashi
Faculty Of System Design Tokyo Metropolitan University
-
Kambayashi Yasushi
Department Of Computer And Information Engineering Nippon Institute Of Technology
-
Yamachi Hidemi
Department of Computer and Information Engineering, Nippon Institute of Technology
-
Yamachi Hidemi
Department Of Computer And Information Engineering Nippon Institute Of Technology
-
Tsujimura Yasuhiro
Department Of Computer And Information Engineering Nippon Institute Of Technology
関連論文
- An Efficient Branch and Bound Algorithm for the Optimal Arrangement Problem in the Linear Consecutive-k-out-of-r-from-n:F System(-Information and Operations Management)
- Calculating Method for the System State Distributions of Generalized Multi-State k-out-of-n : F Systems
- Recursive Formulas for the Reliability of Multi-State Consecutive-k-out-of-n:F System(-Information and Operations Management)
- A Study on the Design of Readjusting Method in the Production Seat System(-Information and Operations Management)
- An Efficient Algorithm for Solving Optimal Component Arrangement Problem in Circular Consecutive-k-out-of-n: F System(Optimization and Its Applications)
- Efficient Genetic Algorithm for Optimal Arrangement in a Linear Consecutive-k-out-of-n : F System
- An Evolutionary Computation-Based Approach to Fuzzy Clustering with Relational Data
- Data Allocation in Distributed Database System with Fuzzy Coefficients Using GA
- Reliability Optimization Design Using Hybrid NN-GA with Fuzzy Logic Controller
- An Application of Fuzzy Set Theory to Inventory Control
- Searching Pareto Solutions for Bi-objective Series k-out-of-N System Component Allocation Problems using the Breadth First Search Method(Theory and Methodology)