Robust metaheuristic algorithm for redundancy optimization in large-scale complex systems
- Authors
- Ryoo, HS
- Issue Date
- 1월-2005
- Publisher
- SPRINGER
- Keywords
- reliability; redundancy; complex system; tabu search; metaheuristic
- Citation
- ANNALS OF OPERATIONS RESEARCH, v.133, no.1-4, pp.209 - 228
- Indexed
- SCIE
SCOPUS
- Journal Title
- ANNALS OF OPERATIONS RESEARCH
- Volume
- 133
- Number
- 1-4
- Start Page
- 209
- End Page
- 228
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/123261
- DOI
- 10.1007/s10479-004-5034-x
- ISSN
- 0254-5330
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Industrial and Management Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.