فهرست مقالات Series-parallel systems

• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  1 - Using a Hybrid NSGA-II to ‎S‎olve the ‎R‎edundancy ‎A‎llocation ‎M‎model of Series-Parallel Systems
  Mohammadreza Shahriari
  10.30495/ijim.2023.68610.1613
  This paper develops an efficient non-dominated sorting genetic algorithm (NSGA-II) to solve the redundancy allocation problem (RAP) of series-parallel systems. The system consists of subsystem in series, where components are used in parallel for each subsystem. Both the چکیده کامل

  This paper develops an efficient non-dominated sorting genetic algorithm (NSGA-II) to solve the redundancy allocation problem (RAP) of series-parallel systems. The system consists of subsystem in series, where components are used in parallel for each subsystem. Both the system and its subsystems can only take two states of complete perfect and complete failure. Identical redundant components are included to achieve a desirable reliability. The components of each subsystem, which are chosen from a list that is available in the market, are characterized by their cost, weight, and reliability. To find the optimum combination of the number of components for each subsystem, the mathematical formulation for the maximal reliability and minimal cost of the system configuration under cost constraint is first obtained. Then, a modified NSGA-II is proposed to solve the model. In this algorithm, a heuristic method of generating a primary solution is integrated to achieve better solutions. Moreover, design of experiment approach is employed to calibrate the parameters of the algorithm. At the end, some numerical examples are used to validate the solution, to assess the performance of the proposed methodology under different configurations, and to compare the performance with the ones of two other meta-heuristic algorithms. The results of experiments are generally in favor of the proposed solution algorithm. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  2 - Genetic Algorithm and Simulated Annealing for Redundancy Allocation Problem with Cold-standby Strategy
  Aida Karimi Mani Sharifi Amirhossain Chambari
  This paper presents a new mathematical model for a redundancyallocation problem (RAP) withcold-standby redundancy strategy and multiple component choices.The applications of the proposed model arecommon in electrical power, transformation,telecommunication systems,etc.M چکیده کامل

  This paper presents a new mathematical model for a redundancyallocation problem (RAP) withcold-standby redundancy strategy and multiple component choices.The applications of the proposed model arecommon in electrical power, transformation,telecommunication systems,etc.Manystudies have concentrated onone type of time-to-failure, butin thispaper, two components of time-to-failures which follow hypo-exponential and exponential distributionare investigated. The goal of the RAP is to select available components and redundancy level for each subsystem for maximizing system reliability under cost and weight constraints.Sincethe proposed model belongs to NP-hard class, we proposed two metaheuristic algorithms; namely, simulated annealing and genetic algorithm to solve it. In addition, a numerical example is presented to demonstrate the application of the proposed solution methodology. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  3 - A redundancy allocation problem with the choice of redundancy strategies by a memetic algorithm
  J Safari R Tavakkoli-Moghaddam
  This paper proposes an efficient algorithm based on memetic algorithm (MA) for a redundancy allocation problem without component mixing (RAPCM) in a series-parallel system when the redundancy strategy can be chosen for individual subsystems. Majority of the solution met چکیده کامل

  This paper proposes an efficient algorithm based on memetic algorithm (MA) for a redundancy allocation problem without component mixing (RAPCM) in a series-parallel system when the redundancy strategy can be chosen for individual subsystems. Majority of the solution methods for the general RAPCM assume that the type of a redundancy strategy for each subsystem is pre-determined and known a priori. In general, active redundancy has traditionally received greater attention; however, in practice both active and cold-standby redundancies may be used within a particular system design. The choice of the redundancy strategy then becomes an additional decision variable. Thus, the problem is to select the best redundancy strategy, component and redundancy level for each subsystem in order to maximize the system reliability under system-level constraints. Due to its complexity and NP-hardness, it is so difficult to optimally solve such a problem by using traditional optimization tools. To validate the performance of the proposed MA in terms of solution quality, a number of test problems are examined and the robustness of this algorithm is then discussed. Finally, the related results are reported and it is shown that the proposed MA performs well. پرونده مقاله