Redundancy allocation for series-parallel systems using a column generation approach

IEEE Transactions on Reliability

Volumn 59, Issue 4, 2010, Pages 706-717

  Zia, Leila ^a   Coit, David W ^b  

^a Stanford University   (United States)

^b DEPARTMENT OF INDUSTRIAL AND SYSTEMS ENGINEERING   (United States)

Author keywords

Column generation; redundancy allocation problem; system reliability optimization

Indexed keywords

COLUMN GENERATION; COLUMN GENERATION APPROACH; COMPUTATION TIME; DECISION VARIABLES; ENGINEERING DESIGN; NONLINEAR INTEGER PROGRAMMING PROBLEM; NUMERICAL RESULTS; OBJECTIVE FUNCTIONS; OPTIMIZATION METHOD; OVERALL QUALITY; REDUNDANCY ALLOCATION; REDUNDANCY ALLOCATION PROBLEM; SERIES-PARALLEL SYSTEM; SOLUTION METHODS; SUB-PROBLEMS; SYSTEM RELIABILITY; SYSTEM RELIABILITY OPTIMIZATION;

HEURISTIC METHODS; INTEGER PROGRAMMING; OPTIMIZATION; REDUNDANCY;

QUALITY ASSURANCE;

EID: 78649794116     PISSN: 00189529     EISSN: None     Source Type: Journal    
DOI: 10.1109/TR.2010.2085530     Document Type: Article

References (32)

1. V. R. Prasad and W. Kuo, "Reliability optimization of coherent systems," IEEE Trans. Reliability, Vol. 49, no. 3, pp. 323-330, Sep. 2000.
2. Y. Nakagawa and K. Nakashima, "A heuristic method for determining optimal reliability allocation," IEEE Trans. Reliability, Vol. 26, pp. 156-161, 1977.
3. W. Kuo, C. L. Hwang, and F. A. Tillman, "A note on heuristic methods in optimal system reliability," IEEE Trans. Reliability, Vol. 27, pp. 320-324, 1978.
4. S. Dinghua, "A new heuristic algorithm for constrained redundancy-optimization in complex systems," IEEE Trans. Reliability, Vol. R-36, no. 5, pp. 621-623, 1987.
5. L. Jianping, "A bound heuristic algorithm for solving reliability redundancy optimization," Microelectronics and Reliability, Vol. 3, no. 5, pp. 335-339, 1996.
6. D. W. Coit and A. E. Smith, "Reliability optimization of series-parallel systems using a genetic algorithm,"IEEE Trans. Reliability, vol. 45, no. 2, pp. 254-260, 1996.
7. G. Levitin, A. Lisnianski, and D. Elmakis, "Structure optimization of power system with different redundant elements," Electric Power Systems Research, Vol. 43, no. 1, pp. 19-27, 1997.
8. S. Kulturel-Konak, A. E. Smith, and D. W. Coit, "Efficiently solving the redundancy allocation problem using tabu search," IIE Trans. Reliability, Vol. 35, no. 6, pp. 515-526, 2003.
9. Y. C. Liang and A. E. Smith, "An ant colony optimization algorithm for the redundancy allocation problem (rap)," IEEE Trans. Reliability, Vol. 53, no. 3, pp. 417-423, 2004.
10. Y. C. Hsieh, "A linear approximation for redundant reliability problems with multiple component choices," Computers & Industrial Engineering, Vol. 44, no. 1, pp. 91-103, 2003.
11. J. E. Ramirez-Marquez, D. W. Coit, and A. Konak, "Redundancy allocation for series-parallel systems using a max-min approach," IIE Trans. Reliability, Vol. 36, no. 9, pp. 891-898, 2004.
12. D. W. Coit and A. Konak, "Multiple weighted objectives heuristic for the redundancy allocation problem," IEEE Trans. Reliability, Vol. 55, no. 3, pp. 551-558, Sep. 2006.
13. A. Billionnet, "Redundancy allocation for series-parallel systems using integer linear programming," IEEE Trans. Reliability, Vol. 57, no. 3, pp. 507-516, Sep. 2008.
14. 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 Trans. Reliability, Vol. 56, no. 1, pp. 94-101, Mar. 2007.
15. Y. Nakagawa, "An improved surrogate constraints method for separable nonlinear integer programming," Journal of the Operations Research Society of Japan, Vol. 46, pp. 145-163, 2003.
16. D. E. Fyffe, W. W. Hines, and N. K. Lee, "System reliability allocation and a computational algorithm," IEEE Trans. Reliability, Vol. R-17, no. 2, pp. 64-69, 1968.
17. P. M. Ghare and R. E. Taylor, "Optimal redundancy for reliability in series system," Operations Research, Vol. 17, no. 5, pp. 838-847, 1969.
18. Y. Nakagawa, K. Nakashima, and Y. Hattori, "Optimal reliability allocation by branch-and-bound techniques," IEEE Trans. Reliability, Vol. R-27, no. 1, pp. 31-38, 1978.
19. K. B. Misra and U. Sharma, "An efficient approach for multiple criteria redundancy optimization problems," Microelectronics and Reliability, Vol. 31, no. 2/3, pp. 303-321, 1991.
20. Y. Nakagawa and S. Miyazaki, "Surrogate constraints algorithm for reliability optimization problems with two constraints," IEEE Trans. Reliability, Vol. 30, no. 2, pp. 175-180, 1981.
21. R. L. Bulfin and C. Y. Liu, "Optimal allocation of redundant components for large systems," IEEE Trans. Reliability, Vol. R-34, no. 3, pp. 241-247, 1985.
22. C. S. Sung and Y. K. Cho, "Branch and bound redundancy optimization for a series system with multiple-choice constraints," IEEE Trans. Reliability, Vol. 48, no. 2, pp. 108-117, 1999.
23. P. C. Gilmore and R. E. Gomory, "A linear programming approach to the cutting stock problem," Operations Research, Vol. 9, pp. 849-859, 1961.
24. M. Minoux, "A class of combinatorial optimization problems with polynomially solvable large scale set-covering/partitioning relaxations," RAIRO - Operations Research, Vol. 21, pp. 105-136, 1987.
25. P. H. Vance, C. Barnhart, E. L. Johnson, and G. L. Nemhauser, "Solving binary cutting stock problems by column generation and branch-and-bound," Computational Optimization and Applications, Vol. 3, no. 2, pp. 111-130, 1994.
26. J. Desrosiers, Y. Dumas, M.M. Solomon, and F. Soumis, Handbooks in Operations Research and Management Science: Networks, M. E. Ball, T. L. Magnanti, C. Monna, and G. L. Nemhauser, Eds. North-Holland, Amsterdam:, 1990, In: ch. Time constrained routing and scheduling.
27. D. M. Ryan, "The solution of massive generalized set partitioning problems in aircrew rostering," Journal of the Operational Research Society, Vol. 43, no. 5, pp. 459-467, 1992.
28. F. Vanderbeck and L. A. Wolsey, "An exact algorithm for ip column generation," Operations Research Letters, Vol. 19, no. 4, pp. 151-159, 1996.
29. M. S. Chern, "On the computational complexity of reliability redundancy allocation in a series system," Operation Research Letters, Vol. 11, no. 5, pp. 309-315, 1992.
30. C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, and P. H. Vance, "Branch and price: Column generation for solving huge integer programs," Operations Research, Vol. 46, no. 3, pp. 316-329, 1998.
31. K. H. Borgwardt, "The average number ofsteps required by the simplex method is polynomial," Mathematical Methods for OR (ZOR), Vol. 26, no. 1, pp. 157-177, 1982.
32. H. W. Kuhn and A. W. Tucker, "Nonlinear programming," in Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, 1951, pp. 481-492.