A modified tabu search for redundancy allocation problem of complex systems of ships
0
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
The traditional RAP (Redundancy Allocation Problem) of complex systems has considered only theredundancy of subsystem with homogeneous components. In this paper we extend it as a RAP of complexsystems 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 improvethe 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 showthat our modified procedure obtains better solutions as the size of problem increases from 30 to 50, eventhough it requires rather more computing time. With some adjustment of the parameters of the proposedmethod, it can be applied to the optimal reliability designs of complex systems of ships.
Abstract
The traditional RAP (Redundancy Allocation Problem) of complex systems has considered only theredundancy of subsystem with homogeneous components. In this paper we extend it as a RAP of complexsystems 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 improvethe 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 showthat our modified procedure obtains better solutions as the size of problem increases from 30 to 50, eventhough it requires rather more computing time. With some adjustment of the parameters of the proposedmethod, it can be applied to the optimal reliability designs of complex systems of ships.
참고문헌 (13)
- D. E. Fyffe, "System reliability allocation and a computa-tional algorithm", IEEE Transactions on Reliability, 17, pp.64~69 (1968)
- Y. Nakagawa, "Surrogate con-straints algorithm for reliability optimiza- tion problems with two constraints", IEEE Transactions on Reliability, 30, pp.175~180 (1981)
- D. E. Coit, "System reliability opti-mization with k-out-of-n subsystems", International Journal of Reliability, Quality and Safety Engineering, 7, pp.129~142 (2000)
- D. W. Coit, "Reliability opti-mization of series-parallel systems using a ge-netic algorithm", IEEE Transactions on Reliability, 45, pp.254~260 (1996)
- S. Kulturel-Konak, "Exploiting tabu search mem-ory in constrained problems", INFOR-MS Journal on Computing, 16, pp.241~254 (2004)
- Y. C. Liang, "An ant colony optimization algorithm for the reliability alloca-tion problem(RAP)", IEEE Transactions on Reliability, 53, pp.417~423 (2004)
- Y. C. Liang, "Redundancy al-location of series-parallel systems using a varia-ble neighborhood search algorithm", Reliability Engineering and System Safety, 92, pp.323~331 (2007)
- N. Nahas, "Coupling ant colony and the degraded ceiling algorithm for the redundancy alloca-tion prob-lem of series-parallel systems", Reliability Engineering and System Safety, 92, pp.211~222 (2007)
- M. Ouzineb, "An efficient heuristic for reliability design opti-mization problems", Computers & Operations Research, 37, pp.223~235 (2010)
- C. Ha, "Initial allocation compen-sation algorithm for redundancy allocation: The scanning heuristic", IIE Transactions, 40, pp.678~689 (2008)
- M. S. Chern, "On the computational complex-ity of reliability redundancy allocation in a series system", Operations Research Letters, 11, pp.309~315 (1992)
- F. Glover, "Future Paths for Integer Programming and Links to Artificial Intelligence", Computers and Operations Research, 13, pp.533~549 (1986)
- J. Renaud, "A heuristic for the pick up and delivery traveling salesman problem", Computers and Operations Research, 27, pp.905~916 (2000)