Loading...

An improved fruit fly optimization algorithm to solve the homogeneous fuzzy series–parallel redundancy allocation problem under discount strategies

Mousavi, S. M ; Sharif University of Technology

849 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/s00500-015-1641-5
  3. Publisher: Springer Verlag
  4. Abstract:
  5. In this paper, a mathematical formulation is first derived for a homogenous fuzzy series–parallel redundancy allocation problem, where both the system and its subsystems can only take two states of complete perfect and complete failure. Identical redundant components are included in order to achieve desirable system reliability. The components of each subsystem characterized by their cost, weight, and reliability, are purchased from the market under all-unit discount and incremental quantity discount strategies. The goal is to find the optimum combination of the number of components for each subsystem that maximizes the system reliability under total fuzzy cost and weight constraints. An improved fruit fly optimization algorithm (IFOA) is proposed to solve the problem, where a particle swarm optimization, a genetic algorithm, and a Tabu search algorithm are utilized to validate the results obtained. These algorithms are the most common ones in the literature to solve series–parallel redundancy allocation problems. Moreover, design of experiments using the Taguchi approach is employed to calibrate the parameters of the algorithms. At the end, some numerical examples are solved to demonstrate the applicability of the proposed methodology. The results are generally in favor IFOA
  6. Keywords:
  7. Fuzzy redundancy allocation problem ; Series–parallel systems ; Algorithms ; Design of experiments ; Fruits ; Genetic algorithms ; Heuristic methods ; Optimization ; Particle swarm optimization (PSO) ; Redundancy ; Reliability ; Tabu search ; Taguchi methods ; Discount strategies ; Incremental quantity discounts ; Mathematical formulation ; Meta-heuristic approach ; Number of components ; Parallel system ; Redundancy allocation problem ; Tabu search algorithms ; Problem solving
  8. Source: Soft Computing ; Volume 20, Issue 6 , 2016 , Pages 2281-2307 ; 14327643 (ISSN)
  9. URL: https://link.springer.com/article/10.1007/s00500-015-1641-5