Robust Metaheuristic Algorithm for Redundancy Optimization in Large-Scale Complex Systems

Hong Ryoo ()

Annals of Operations Research, 2005, vol. 133, issue 1, 209-228

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. Copyright Springer Science + Business Media, Inc. 2005

Keywords: reliability; redundancy; complex system; tabu search; metaheuristic (search for similar items in EconPapers)
Date: 2005
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-004-5034-x (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:133:y:2005:i:1:p:209-228:10.1007/s10479-004-5034-x

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-004-5034-x

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().