DOI QR코드

DOI QR Code

A Hybrid Metaheuristic for the Series-parallel Redundancy Allocation Problem in Electronic Systems of the Ship

  • 투고 : 2011.04.25
  • 심사 : 2011.02.18
  • 발행 : 2011.05.31

초록

The redundancy allocation problem (RAP) is a famous NP.complete problem that has beenstudied in the system reliability area of ships and airplanes. Recently meta-heuristic techniques have been applied in this topic, for example, genetic algorithms, simulated annealing and tabu search. In particular, tabu search (TS) has emerged as an efficient algorithmic approach for the series-parallel RAP. However, the quality of solutions found by TS depends on the initial solution. As a robust and efficient methodology for the series-parallel RAP, the hybrid metaheuristic (TSA) that is a interactive procedure between the TS and SA (simulated annealing) is developed in this paper. In the proposed algorithm, SA is used to find the diversified promising solutions so that TS can re-intensify search for the solutions obtained by the SA. We test the proposed TSA by the existing problems and compare it with the SA and TS algorithm. Computational results show that the TSA algorithm finds the global optimal solutions for all cases and outperforms the existing TS and SA in cases of 42 and 56 subsystems.

키워드

참고문헌

  1. D. E. Fyffe, W. W. Hines and N. K. Lee, "System reliability allocation and a computational algorithm", IEEE Transactions on Reliability, vol. 17, pp. 64-69, 1968. https://doi.org/10.1109/TR.1968.5217517
  2. Y. Nakagawa and S. Miyazaki, "Surrogate constraints algorithm for reliability optimization problems with two constraints", IEEE Transactions on Reliability, vol. 30, pp. 175- 180, 1981. https://doi.org/10.1109/TR.1981.5221024
  3. D. E. Coit and J. Liu, "System reliability optimization with k‐out‐of‐n subsystems", International Journal of Reliability, Quality and Safety Engineering, vol. 7, pp. 129-142, 2000. https://doi.org/10.1142/S0218539300000110
  4. D. E. Coit and A. E. Smith, "Reliability optimization of series‐parallel systems using a genetic algorithm", IEEE Transactions on Reliability, vol. 45, pp. 254-260, 1996. https://doi.org/10.1109/24.510811
  5. S. Kulturel‐Konak, A. E. Smith and D. W. Coit, "Efficiently solving the redundancy allocation problem using tabu search", IIE Transactions, vol. 35, pp. 515-526, 2003. https://doi.org/10.1080/07408170304422
  6. S. Kulturel‐Konak, B. A. Norman, D. W. Coit and A. E. Smith, "Exploiting tabu search memory in constrained problems", INFORMS Journal on Computing, vol. 16, pp. 241-254, 2004. https://doi.org/10.1287/ijoc.1030.0040
  7. Y. C. Liang and A. E. Smith, "An ant colony optimization algorithm for the reliability allocation problem", IEEE Transactions on Reliability, vol. 53, pp. 417-423, 2004. https://doi.org/10.1109/TR.2004.832816
  8. M.S. Chern, "On the computational complexity of reliability redundancy allocation in a series system", Operations Research Letters, vol. 11, pp. 309-315, 1992. https://doi.org/10.1016/0167-6377(92)90008-Q
  9. W. Kuo, V. R. Prasad, F. A. Tillman and C. L. Hwang, "Optimal Reliability Design: Fundamentals and Applications", Cambridge University Press, 2001.
  10. V. Cerny, "Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm", Journal of Optimization Theory and Applications vol. 45, pp. 41-51, 1985. https://doi.org/10.1007/BF00940812
  11. J. H. Kim and J. S. Kim,"Globally solving the redundancy allocation problem for the case of series.parallel systems", Proceeding of the 2nd Asian International Workshop on Advanced Reliability Modeling, pp. 150-157, 2006.