Robust metaheuristic algorithm for redundancy optimization in large-scale complex systems

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)209-228
Number of pages20
JournalAnnals of Operations Research
Issue number1-4
Publication statusPublished - 2005 Jan


  • Complex system
  • Metaheuristic
  • Redundancy
  • Reliability
  • Tabu search

ASJC Scopus subject areas

  • General Decision Sciences
  • Management Science and Operations Research


Dive into the research topics of 'Robust metaheuristic algorithm for redundancy optimization in large-scale complex systems'. Together they form a unique fingerprint.

Cite this