Journal of Advanced Marine Engineering and Technology

The Korean Society of Marine Engineering (한국마린엔지니어링학회)
권호 표지
DOI QR코드

DOI QR Code

A modified tabu search for redundancy allocation problem of complex systems of ships

  • Kim, Jae-Hwan (Department of Data Information, Korea Maritime and Ocean University) ;
  • Jang, Kil-Woong (Department of Data Information, Korea Maritime and Ocean University)
  • Received : 2014.01.15
  • Accepted : 2014.02.17
  • Published : 2014.02.28
Download PDF
⟨ Previous Next ⟩

Abstract

The traditional RAP (Redundancy Allocation Problem) of complex systems has considered only the redundancy of subsystem with homogeneous components. In this paper we extend it as a RAP of complex systems with heterogeneous components which is more flexible than the case of homogeneous components. We model this problem as a nonlinear integer programming problem, find its optimal solution by tabu search, and suggest an example of the efficient reliability design with heterogeneous components. In order to improve the quality of the solution of the tabu search, we suggest a modified tabu search to employ an adaptive procedure (1-opt or 2-opt exchange) to generate the efficient neighborhood solutions. Computational results show that our modified procedure obtains better solutions as the size of problem increases from 30 to 50, even though it requires rather more computing time. With some adjustment of the parameters of the proposed method, it can be applied to the optimal reliability designs of complex systems of ships.

Keywords

References

  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.
  2. Y. Nakagawa and S. Miyazaki, "Surrogate constraints algorithm for reliability optimiza- tion problems with two constraints", IEEE Transactions on Reliability, vol. 30, pp. 175-180, 1981.
  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. W. 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, B. A. Norman, D. W. Coit, and A. E. Smith, "Exploiting tabu search memory in constrained problems", INFOR- MS Journal on Computing, vol. 16, pp. 241-254, 2004 . https://doi.org/10.1287/ijoc.1030.0040
  6. Y. C. Liang and A. E. Smith, "An ant colony optimization algorithm for the reliability allocation problem (RAP)", IEEE Transactions on Reliability, vol. 53, pp. 417-423, 2004. https://doi.org/10.1109/TR.2004.832816
  7. Y. C. Liang and Y. C. Chen, "Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm", Reliability Engineering and System Safety, vol. 92, pp. 323-331, 2007. https://doi.org/10.1016/j.ress.2006.04.013
  8. N. Nahas, M. Nourelfath, and D. Ait-Kadi, "Coupling ant colony and the degraded ceiling algorithm for the redundancy alloca- tion problem of series-parallel systems", Reliability Engineering and System Safety, vol. 92, pp. 211-222, 2007. https://doi.org/10.1016/j.ress.2005.12.002
  9. M. Ouzineb, M. Nourelfath and M. Gendreau, "An efficient heuristic for reliability design optimization problems", Computers & Operations Research, vol. 37, pp. 223-235, 2010. https://doi.org/10.1016/j.cor.2009.04.011
  10. C. Ha and W. Kuo, "Initial allocation compensation algorithm for redundancy allocation: The scanning heuristic", IIE Transactions, vol. 40, pp. 678-689, 2008. https://doi.org/10.1080/07408170701730800
  11. 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
  12. F. Glover, "Future Paths for Integer Programming and Links to Artificial Intelligence", Computers and Operations Research, vol. 13, pp. 533-549, 1986. https://doi.org/10.1016/0305-0548(86)90048-1
  13. J. Renaud, F. F. Boctor, and J. Ouenniche, "A heuristic for the pick up and delivery traveling salesman problem", Computers and Operations Research, vol. 27, pp. 905-916, 2000. https://doi.org/10.1016/S0305-0548(99)00066-0

Cited by

  1. An efficient metaheuristic for multi-level reliability optimization problem in electronic systems of the ship vol.38, pp.8, 2014, https://doi.org/10.5916/jkosme.2014.38.8.1004