| Article ID: | iaor19971342 |
| Country: | Netherlands |
| Volume: | 63 |
| Issue: | 1 |
| Start Page Number: | 321 |
| End Page Number: | 336 |
| Publication Date: | May 1996 |
| Journal: | Annals of Operations Research |
| Authors: | Hansen Pierre, Lih Keh-Wei |
| Keywords: | heuristics |
A new heuristic algorithm, based on the tabu search methodology, is proposed for constrained redundancy optimization in series and in complex systems. It has the advantage of not being blocked as soon as a local optimum is found. Results given by the new method are compared with those of previous heuristics on a series of examples.