Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 276234, 6 pages
http://dx.doi.org/10.1155/2015/276234
Research Article

A Discrete-Binary Transformation of the Reliability Redundancy Allocation Problem

1IE Business School, IE University, Maria de Molina 31B, 28006 Madrid, Spain
2Institute of Information Systems, University of Hamburg, Von-Melle-Park 5, 20146 Hamburg, Germany
3Escuela de Ingeniera Industrial, Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, 2362807 Valparaíso, Chile

Received 10 December 2014; Accepted 4 April 2015

Academic Editor: Wei-Chiang Hong

Copyright © 2015 Marco Caserta and Stefan Voß. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. Azaron, H. Katagiri, K. Kato, and M. Sakawa, “A multi-objective discrete reliability optimization problem for dissimilar-unit standby systems,” OR Spectrum, vol. 29, no. 2, pp. 235–257, 2007. View at Publisher · View at Google Scholar · View at Scopus
  2. A. Billionnet, “Redundancy allocation for series-parallel systems using integer linear programming,” IEEE Transactions on Reliability, vol. 57, no. 3, pp. 507–516, 2008. View at Publisher · View at Google Scholar · View at Scopus
  3. D. W. Coit and A. Konak, “Multiple weighted objectives heuristic for the redundancy allocation problem,” IEEE Transactions on Reliability, vol. 55, no. 3, pp. 551–558, 2006. View at Publisher · View at Google Scholar · View at Scopus
  4. S. Kulturel-Konak, A. E. Smith, and D. W. Coit, “Efficiently solving the redundancy allocation problem using tabu search,” IIE Transactions, vol. 35, no. 6, pp. 515–526, 2003. View at Publisher · View at Google Scholar · View at Scopus
  5. J. E. Ramirez-Marquez, D. W. Coit, and A. Konak, “Redundancy allocation for series-parallel systems using a max-min approach,” IIE Transactions, vol. 36, no. 9, pp. 891–898, 2004. View at Publisher · View at Google Scholar · View at Scopus
  6. B. Soylu and S. K. Ulusoy, “A preference ordered classification for a multi-objective maxmin redundancy allocation problem,” Computers & Operations Research, vol. 38, no. 12, pp. 1855–1866, 2011. View at Publisher · View at Google Scholar · View at Scopus
  7. P.-S. You and T.-C. Chen, “An efficient heuristic for series-parallel redundant reliability problems,” Computers & Operations Research, vol. 32, no. 8, pp. 2117–2127, 2005. View at Publisher · View at Google Scholar · View at Scopus
  8. N. Beji, B. Jarboui, P. Siarry, and H. Chabchoub, “A differential evolution algorithm to solve redundancy allocation problems,” International Transactions in Operational Research, vol. 19, no. 6, pp. 809–824, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. G. Kanagaraj, S. G. Ponnambalam, and N. Jawahar, “A hybrid cuckoo search and genetic algorithm for reliability-redundancy allocation problems,” Computers & Industrial Engineering, vol. 66, no. 4, pp. 1115–1124, 2013. View at Publisher · View at Google Scholar · View at Scopus
  10. E. Valian and E. Valian, “A cuckoo search algorithm by Lévy flights for solving reliability redundancy allocation problems,” Engineering Optimization, vol. 45, no. 11, pp. 1273–1286, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, John Wiley & Sons, 1990. View at MathSciNet
  12. Y. Nakagawa and S. Miyazaki, “Surrogate constraints algorithm for reliability optimization problems with two constraints,” IEEE Transactions on Reliability, vol. 30, no. 2, pp. 175–180, 1981. View at Publisher · View at Google Scholar · View at Scopus
  13. K. Y. K. Ng and N. G. F. Sancho, “A hybrid ‘dynamic programming/depth-first search’ algorithm, with an application to redundancy allocation,” IIE Transactions, vol. 33, no. 12, pp. 1047–1058, 2001. View at Publisher · View at Google Scholar · View at Scopus
  14. A. Yalaoui, E. Châtelet, and C. Chu, “A new dynamic programming method for reliability & redundancy allocation in a parallel-series system,” IEEE Transactions on Reliability, vol. 54, no. 2, pp. 254–261, 2005. View at Publisher · View at Google Scholar · View at Scopus
  15. M. Caserta and S. Voß, “A corridor method based hybrid algorithm for redundancy allocation,” Journal of Heuristics, 2014. View at Publisher · View at Google Scholar
  16. R. L. Bulfin and C. Y. Liu, “Optimal allocation of redundant components for large systems,” IEEE Transactions on Reliability, vol. 34, no. 3, pp. 241–247, 1985. View at Publisher · View at Google Scholar · View at Scopus
  17. J. Onishi, S. Kimura, R. J. W. James, and Y. Nakagawa, “Solving the redundancy allocation problem with a mix of components using the improved surrogate constraint method,” IEEE Transactions on Reliability, vol. 56, no. 1, pp. 94–101, 2007. View at Publisher · View at Google Scholar · View at Scopus
  18. M. Caserta and S. Voß, “An exact algorithm for the reliability redundancy allocation problem,” European Journal of Operational Research, vol. 244, no. 1, pp. 110–116, 2015. View at Publisher · View at Google Scholar · View at MathSciNet