Back to Search
Start Over
A corridor method based hybrid algorithm for redundancy allocation.
- Source :
- Journal of Heuristics; Aug2016, Vol. 22 Issue 4, p405-429, 25p
- Publication Year :
- 2016
-
Abstract
- In this paper a hybrid algorithm for the redundancy allocation problem is presented. The problem is the allocation of redundant components within series-parallel systems. We present an algorithm that deals with the classical formulation, where at least one component per subsystem must be included in the final configuration, as well as the $$k$$ -out-of- $$n$$ formulation, in which at least $$k$$ components per subsystem must be included in the final network configuration. We propose a three-phase scheme in which the cross entropy method, the corridor method and a dynamic programming-based scheme are effectively intertwined. Computational results on well-known benchmark instances as well as on randomly generated large scale instances are presented, proving the effectiveness and robustness of the proposed algorithm. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 13811231
- Volume :
- 22
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- Journal of Heuristics
- Publication Type :
- Academic Journal
- Accession number :
- 116918359
- Full Text :
- https://doi.org/10.1007/s10732-014-9265-y