Abstract
Based upon the general tabu search methodology, this paper develops a robust metaheuristic algorithm for the redundancy optimization in large-scale complex system reliability that performs a rigorous search of the “attractive” feasible space and is capable of escaping from a local solution.
An illustrative example is provided and extensive computational results are reported on two test problems from the literature (Aggarwal, 1976; Shi, 1987) and also on randomly generated large-scale instances of complex systems with up to 200 components. The computational results indicate that the proposed metaheuristic algorithm possesses a superior robustness and efficiency for solving the class of hard optimization problems studied in this paper.
Similar content being viewed by others
References
Aggarwal, K.K. (1976). “Redundancy Optimization in General Systems.” IEEE Transactions on Reliability 25, 330–332.
Balas, E. and J.B. Mazzola. (1984a). “Nonlinear 0–1 Programming: I. Linearization Techniques.” Mathematical Programming 30, 1–21.
Balas, E. and J.B. Mazzola. (1984b). “Nonlinear 0–1 Programming: II. Dominance Relations and Algorithms.” Mathematical Programming 30, 22–45.
Chern, M.S. (1992). “On the Computational Complexity of Reliability Redundancy Allocation in a Series System.” Operations Research Letters 11, 309–315.
Glover, F. (1989). “Tabu Search – Part I.” ORSA Journal on Computing 1(3), 190–206.
Glover, F. (1990). “Tabu Search – Part II.” ORSA Journal on Computing 2(1), 4–32.
Glover, F. and M. Laguna. (1997). Tabu Search. Kluwer Academic.
Hammer, P.L. and S. Rudeanu. (1968). Boolean Methods in Operations Research and Related Areas. Berlin: Springer.
Hansen, P., B. Jaumard, and M. Vincent. (1993). “Constrained Nonlinear 0–1 Programming.” ORSA Journal on Computing 5(2), 97–119.
Kim, J.H. and H.S. Ryoo. (2000). “Global Optimization of Systems Reliability with Redundancy.” In Proc. of INFORMS, Seoul, Korea, June.
Kim, J.H. and B.J. Yum. (1993). “A Heuristic Method for Solving Redundancy Optimization Problem in Complex Systems.” IEEE Transactions on Reliability 42(4), 572–578.
Kochenberger, G.A. and F. Glover (eds.). (2003). Handbook of Metaheuristics. Kluwer Academic.
Kohda, T. and K. Inoue. (1982). “A Reliability Optimization Method for Complex Systems with the Criterion of Local Optimally.” IEEE Transactions on Reliability 31(1), 109–111.
Konno, H., T. Kuno, and Y. Yajima. (1992). “Parametric Simplex Algorithms for a Class of \(\mathcal{NP}\)-Complete Problems Whose Average Number of Steps is Polynomial.” Computational Optimization and Applications 1, 227–239.
Matsui, T. (1996). “\(\mathcal{NP}\)-Hardness of Linear Multiplicative Programming and Related Problems.” Journal of Global Optimization 9(2), 113–119.
Ravi, V., B.S.N. Murty, and P.J. Reddy. (1997). “Nonequilibrium Simulated Annealing Algorithm Applied to Reliability Optimization of Complex Systems.” IEEE Transactions on Reliability 46(2), 233–239.
Ribeiro, C.C. and P. Hansen (eds.). (2001). Essays and Surveys in Metaheuristics. Kluwer Academic.
Ryoo, H.S. and N.V. Sahinidis. (2003). “Global Optimization of Multiplicative Programs.” Journal of Global Optimization 26(4), 387–418.
Shi, D.H. (1987). “A New Heuristic Algorithm for Constrained Redundancy-Optimization in Complex Systems.” IEEE Transactions on Reliability 36(5), 621–623.
Sun, X.L., K.I.M. McKinnon, and D. Li. (2001). “A Convexification Method for a Class of Global Optimization Problems with Applications to Reliability Optimization.” Journal of Global Optimization 21(2), 185–199.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ryoo, H.S. Robust Metaheuristic Algorithm for Redundancy Optimization in Large-Scale Complex Systems. Ann Oper Res 133, 209–228 (2005). https://doi.org/10.1007/s10479-004-5034-x
Issue Date:
DOI: https://doi.org/10.1007/s10479-004-5034-x