{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T16:12:43Z","timestamp":1778861563139,"version":"3.51.4"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,10,29]],"date-time":"2014-10-29T00:00:00Z","timestamp":1414540800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10732-014-9265-y","type":"journal-article","created":{"date-parts":[[2014,10,28]],"date-time":"2014-10-28T03:20:09Z","timestamp":1414466409000},"page":"405-429","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["A corridor method based hybrid algorithm for redundancy allocation"],"prefix":"10.1007","volume":"22","author":[{"given":"Marco","family":"Caserta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,29]]},"reference":[{"key":"9265_CR1","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1023\/B:HEUR.0000012447.32370.fd","volume":"9","author":"F Altiparmak","year":"2003","unstructured":"Altiparmak, F., Dengiz, B., Smith, A.E.: Optimal design of reliable computer networks: a comparison of metaheuristics. J. Heuristics 9, 471\u2013487 (2003)","journal-title":"J. Heuristics"},{"issue":"3","key":"9265_CR2","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1109\/32.75419","volume":"17","author":"F Belli","year":"1991","unstructured":"Belli, F., Jedrzejowicz, P.: An approach to the reliability optimization of software with redundancy. IEEE Trans. Softw. Eng. 17(3), 310\u2013312 (1991)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"2","key":"9265_CR3","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/24.295021","volume":"43","author":"O Berman","year":"1994","unstructured":"Berman, O., Ashrafi, N.: Optimal design of large software-systems using N-version programming. IEEE Trans. Reliab. 43(2), 344\u2013350 (1994)","journal-title":"IEEE Trans. Reliab."},{"issue":"3","key":"9265_CR4","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1109\/TR.2008.927807","volume":"57","author":"A Billionnet","year":"2008","unstructured":"Billionnet, A.: Redundancy allocation for series-parallel systems using integer linear programming. IEEE Trans. Reliab. 57(3), 507\u2013516 (2008)","journal-title":"IEEE Trans. Reliab."},{"issue":"3","key":"9265_CR5","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1109\/TR.1985.5222133","volume":"R\u201334","author":"RL Bulfin","year":"1985","unstructured":"Bulfin, R.L., Liu, C.Y.: Optimal allocation of redundancy components for large systems. IEEE Trans. Reliab. R\u201334(3), 241\u2013247 (1985)","journal-title":"IEEE Trans. Reliab."},{"issue":"3","key":"9265_CR6","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1016\/j.cor.2007.10.028","volume":"36","author":"M Caserta","year":"2009","unstructured":"Caserta, M., M\u00e1rquez, A.: Tabu search-based metaheuristic algorithm for software system reliability problems. Comput. Operat. Res. 36(3), 811\u2013822 (2009)","journal-title":"Comput. Operat. Res."},{"key":"9265_CR7","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1016\/j.cor.2007.10.014","volume":"36","author":"M Caserta","year":"2009","unstructured":"Caserta, M., Qui\u00f1onez, E.: A Cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times. Comput. Operat. Res. 36, 530\u2013548 (2009)","journal-title":"Comput. Operat. Res."},{"key":"9265_CR8","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/978-3-642-11169-3_12","volume":"5851","author":"M Caserta","year":"2009","unstructured":"Caserta, M., Vo\u00df, S.: Corridor selection and fine tuning for the corridor method. Lect. Notes Comput. Sci. 5851, 163\u2013175 (2009)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9265_CR9","unstructured":"Caserta, M., Vo\u00df, S.: A discrete-binary transformation of the reliability redundancy allocation problem. Technical report, University of Hamburg, Institute of Information Systems, (2011)"},{"key":"9265_CR10","doi-asserted-by":"crossref","unstructured":"Caserta, M., Vo\u00df, S.: A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing. Ann. Math. Artif. Intell. 69, 207\u2013224 (2013a)","DOI":"10.1007\/s10472-013-9339-9"},{"key":"9265_CR11","unstructured":"Caserta, M., Vo\u00df, S.: An exact algorithm for the reliability redundancy allocation problem. Technical report, University of Hamburg, Institute of Information Systems, (2013b)"},{"key":"9265_CR12","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1007\/s00291-009-0176-5","volume":"33","author":"M Caserta","year":"2011","unstructured":"Caserta, M., Vo\u00df, S., Sniedovich, M.: Applying the corridor method to a blocks relocation problem. OR Spectr 33, 915\u2013929 (2011)","journal-title":"OR Spectr"},{"key":"9265_CR13","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0167-6377(92)90008-Q","volume":"11","author":"M-S Chern","year":"1992","unstructured":"Chern, M.-S.: On the computational complexity of reliability redundancy allocation in a series system. Oper. Res. Lett. 11, 309\u2013315 (1992)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"9265_CR14","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1109\/TR.2006.879654","volume":"55","author":"DW Coit","year":"2006","unstructured":"Coit, D.W., Konak, A.: Multiple weighted objectives heuristic for the redundancy allocation problem. IEEE Trans. Reliab. 55(3), 551\u2013558 (2006)","journal-title":"IEEE Trans. Reliab."},{"issue":"2","key":"9265_CR15","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/24.510811","volume":"45","author":"DW Coit","year":"1996","unstructured":"Coit, D.W., Smith, A.E.: Reliability optimization of series-parallel systems using a genetic algorithm. IEEE Trans. Reliab. 45(2), 254\u2013266 (1996)","journal-title":"IEEE Trans. Reliab."},{"issue":"02","key":"9265_CR16","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1142\/S0218539300000110","volume":"7","author":"DW Coit","year":"2000","unstructured":"Coit, D.W., Liu, J.: System reliability optimization with k-out-of-n subsystems. Int. J. Reliab. Qual. Saf. Eng. 7(02), 129\u2013142 (2000)","journal-title":"Int. J. Reliab. Qual. Saf. Eng."},{"key":"9265_CR17","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s10479-005-5724-z","volume":"134","author":"P Boer De","year":"2005","unstructured":"De Boer, P., Kroese, D.P., Mannor, S., Rubinstein, R.Y.: A tutorial on the cross-entropy method. Ann. Oper. Res. 134, 19\u201367 (2005)","journal-title":"Ann. Oper. Res."},{"key":"9265_CR18","doi-asserted-by":"crossref","unstructured":"Deeter, D.E., Smith, A.E.: Economic design of reliable networks. IIE Trans. 30, 1161\u20131174 (1998)","DOI":"10.1080\/07408179808966573"},{"issue":"1","key":"9265_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(03)00274-1","volume":"155","author":"A Fr\u00e9ville","year":"2004","unstructured":"Fr\u00e9ville, A.: The multidimensional 0\u20131 knapsack problem: an overview. Eur. J. Oper. Res. 155(1), 1\u201321 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"9265_CR20","doi-asserted-by":"crossref","unstructured":"Ha, C., Kuo, W.: Reliability redundancy allocation: an improved realization for nonconvex nonlinear programming problems. Eur. J. Oper. Res. 127, 24\u201338 (2006)","DOI":"10.1016\/j.ejor.2004.06.006"},{"key":"9265_CR21","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0360-8352(02)00186-9","volume":"44","author":"YC Hsieh","year":"2002","unstructured":"Hsieh, Y.C.: A linear approximation for redundant reliability problems with multiple component choices. Comput. Ind. Eng. 44, 91\u2013103 (2002)","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"9265_CR22","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1108\/13552510610705928","volume":"12","author":"HG Kim","year":"2006","unstructured":"Kim, H.G., Bae, C.O., Park, D.J.: Reliability redundancy optimization using simulated annealing algorithms. J. Qual. Maint. Eng. 12(4), 354\u2013363 (2006)","journal-title":"J. Qual. Maint. Eng."},{"key":"9265_CR23","doi-asserted-by":"crossref","unstructured":"Kulturel-Konak, S., Smith, A.E., Coit, D.W.: Efficiently solving the redundancy allocation problem using tabu search. IIE Trans. 35(6), 515\u2013526 (2003)","DOI":"10.1080\/07408170304422"},{"issue":"2","key":"9265_CR24","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1109\/24.877336","volume":"49","author":"W Kuo","year":"2000","unstructured":"Kuo, W., Prasad, V.R.: An annotated overview of system-reliability optimization. IEEE Trans.Reliab. 49(2), 176\u2013187 (2000)","journal-title":"IEEE Trans .Reliab."},{"key":"9265_CR25","volume-title":"Optimal Reliability Design","author":"W Kuo","year":"2001","unstructured":"Kuo, W., Prasad, V.R., Tillman, F.A., Hwang, C.: Optimal Reliability Design. Cambridge University Press, New York (2001)"},{"issue":"2","key":"9265_CR26","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1109\/TSMCA.2006.889476","volume":"37","author":"W Kuo","year":"2007","unstructured":"Kuo, W., Wan, R.: Recent advances in optimal reliability allocation. IEEE Trans. Syst. Man Cybern. A 37(2), 143\u2013156 (2007)","journal-title":"IEEE Trans. Syst. Man Cybern. A"},{"issue":"3","key":"9265_CR27","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.ress.2006.04.013","volume":"92","author":"Y-C Liang","year":"2007","unstructured":"Liang, Y.-C., Chen, Y.-C.: Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm. Reliab. Eng. Syst. Saf 92(3), 323\u2013331 (2007)","journal-title":"Reliab. Eng. Syst. Saf"},{"issue":"3","key":"9265_CR28","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TR.2004.832816","volume":"53","author":"YC Liang","year":"2004","unstructured":"Liang, Y.C., Smith, A.E.: An ant colony optimization algorithm for the redundancy allocation problem (RAP). IEEE Trans. Reliab. 53(3), 417\u2013423 (2004)","journal-title":"IEEE Trans. Reliab."},{"key":"9265_CR29","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)"},{"issue":"2","key":"9265_CR30","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.ress.2005.12.002","volume":"92","author":"N Nahas","year":"2007","unstructured":"Nahas, N., Nourelfath, M., Ait-Kadi, D.: Coupling ant colony and the degraded ceiling algorithm for the redundancy allocation problem of series-parallel systems. Reliab. Eng. Syst. Saf. 92(2), 211\u2013222 (2007)","journal-title":"Reliab. Eng. Syst. Saf."},{"issue":"2","key":"9265_CR31","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/TR.1981.5221024","volume":"30","author":"Y Nakawara","year":"1981","unstructured":"Nakawara, Y., Miyazaki, S.: Surrogate constraints algorithm for reliability optimization problems with two constraints. IEEE Trans. Reliab. 30(2), 175\u2013180 (1981)","journal-title":"IEEE Trans. Reliab."},{"key":"9265_CR32","first-page":"1047","volume":"33","author":"KY Ng","year":"2001","unstructured":"Ng, K.Y., Sancho, N.G.: A hybrid dynamic programming\/depth first search algorithm, with an application to redundancy allocation. IIE Trans. 33, 1047\u20131058 (2001)","journal-title":"IIE Trans."},{"issue":"1","key":"9265_CR33","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1109\/TR.2006.884602","volume":"56","author":"J Onishi","year":"2007","unstructured":"Onishi, J., Kimura, S., James, R.J., Nakagawa, Y.: Solving the redundancy allocation problem with a mix of components using the improved surrogate constraint method. IEEE Trans. Reliab. 56(1), 94\u2013101 (2007)","journal-title":"IEEE Trans. Reliab."},{"key":"9265_CR34","doi-asserted-by":"crossref","unstructured":"Ouzineb, M., Nourelfath, M., Gendreau, M.: An efficient heuristic for reliability design optimization problems. Comput. Oper. Res. 37, 223\u2013235 (2010)","DOI":"10.1016\/j.cor.2009.04.011"},{"key":"9265_CR35","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1109\/24.387368","volume":"44","author":"L Painton","year":"1995","unstructured":"Painton, L., Campbell, J.: Genetic algorithms in optimization of system reliability. IEEE Trans. Reliab. 44, 172\u2013178 (1995)","journal-title":"IEEE Trans. Reliab."},{"key":"9265_CR36","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1080\/07408170490473097","volume":"36","author":"JE Ramirez-Marquez","year":"2004","unstructured":"Ramirez-Marquez, J.E., Coit, D.W., Konak, A.: Redundancy allocation for series-parallel systems using a max-min approach. IIE Trans. 36, 891\u2013898 (2004)","journal-title":"IIE Trans."},{"key":"9265_CR37","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4321-0","volume-title":"The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte Carlo Simulation, and Machine Learning","author":"RY Rubinstein","year":"2004","unstructured":"Rubinstein, R.Y., Kroese, D.P.: The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte Carlo Simulation, and Machine Learning. Springer, New York (2004)"},{"issue":"11","key":"9265_CR38","doi-asserted-by":"crossref","first-page":"1703","DOI":"10.1016\/j.ress.2009.05.003","volume":"94","author":"SJ Sadjani","year":"2009","unstructured":"Sadjani, S.J., Soltani, R.: An efficient heuristic versus a robust hybrid metaheuristic for general framework of serial-parallel redundancy problem. Reliab. Eng. Syst. Saf. 94(11), 1703\u20131710 (2009)","journal-title":"Reliab. Eng. Syst. Saf."},{"issue":"3","key":"9265_CR39","first-page":"551","volume":"35","author":"M Sniedovich","year":"2006","unstructured":"Sniedovich, M., Vo\u00df, S.: The corridor method: a dynamic programming inspired metaheuristic. Control Cybern. 35(3), 551\u2013578 (2006)","journal-title":"Control Cybern."},{"key":"9265_CR40","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/978-1-4615-1507-4_27","volume-title":"Essays and Surveys in Metaheuristics","author":"E Taillard","year":"2002","unstructured":"Taillard, E., Vo\u00df, S.: POPMUSIC\u2014Partial Optimization Metaheuristic Under Special Intensification Conditions. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 613\u2013629. Kluwer, Boston (2002)"},{"issue":"4","key":"9265_CR41","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1016\/j.ress.2007.02.009","volume":"93","author":"R Tavakkoli-Moghaddam","year":"2008","unstructured":"Tavakkoli-Moghaddam, R., Safari, J., Sassani, F.: Reliability optimization of series-parallel systems with a choice of redundancy strategies using a genetic algorithm. Reliab. Eng. Syst. Saf. 93(4), 550\u2013556 (2008)","journal-title":"Reliab. Eng. Syst. Saf."},{"issue":"1","key":"9265_CR42","first-page":"95","volume":"4","author":"SB Twum","year":"2013","unstructured":"Twum, S.B., Aspinwall, E.: Models in design for reliability optimisation. Am. J. Sci. Ind. Res. 4(1), 95\u2013110 (2013)","journal-title":"Am. J. Sci. Ind. Res."},{"issue":"2","key":"9265_CR43","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/TR.2005.847270","volume":"54","author":"A Yalaoui","year":"2005","unstructured":"Yalaoui, A., Ch\u00e2telet, E., Chu, C.: A new dynamic programming method for reliability & redundancy allocation in a parallel-series system. IEEE Trans. Reliab. 54(2), 254\u2013261 (2005)","journal-title":"IEEE Trans. Reliab."},{"key":"9265_CR44","doi-asserted-by":"crossref","unstructured":"You, P.S., Chen, T.C.: An efficient heuristic for series-parallel redundant reliability problems. Comput. Oper. Res. 32, 2117\u20132127 (2005)","DOI":"10.1016\/j.cor.2004.02.003"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9265-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-014-9265-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9265-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:54:34Z","timestamp":1559256874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-014-9265-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,29]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["9265"],"URL":"https:\/\/doi.org\/10.1007\/s10732-014-9265-y","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,29]]}}}