IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v22y2016i4d10.1007_s10732-014-9265-y.html
   My bibliography  Save this article

A corridor method based hybrid algorithm for redundancy allocation

Author

Listed:
  • Marco Caserta

    (IE Business School)

  • Stefan Voß

    (University of Hamburg
    Pontificia Universidad Católica de Valparaíso)

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$$ k -out-of- $$n$$ n formulation, in which at least $$k$$ 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.

Suggested Citation

  • Marco Caserta & Stefan Voß, 2016. "A corridor method based hybrid algorithm for redundancy allocation," Journal of Heuristics, Springer, vol. 22(4), pages 405-429, August.
    • Handle: RePEc:spr:joheur:v:22:y:2016:i:4:d:10.1007_s10732-014-9265-y
    DOI: 10.1007/s10732-014-9265-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-014-9265-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10732-014-9265-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ha, Chunghun & Kuo, Way, 2006. "Reliability redundancy allocation: An improved realization for nonconvex nonlinear programming problems," European Journal of Operational Research, Elsevier, vol. 171(1), pages 24-38, May.
    2. Nahas, Nabil & Nourelfath, Mustapha & Ait-Kadi, Daoud, 2007. "Coupling ant colony and the degraded ceiling algorithm for the redundancy allocation problem of series–parallel systems," Reliability Engineering and System Safety, Elsevier, vol. 92(2), pages 211-222.
    3. Liang, Yun-Chia & Chen, Yi-Ching, 2007. "Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm," Reliability Engineering and System Safety, Elsevier, vol. 92(3), pages 323-331.
    4. Sadjadi, Seyed Jafar & Soltani, R., 2009. "An efficient heuristic versus a robust hybrid meta-heuristic for general framework of serial–parallel redundancy problem," Reliability Engineering and System Safety, Elsevier, vol. 94(11), pages 1703-1710.
    5. Tavakkoli-Moghaddam, R. & Safari, J. & Sassani, F., 2008. "Reliability optimization of series-parallel systems with a choice of redundancy strategies using a genetic algorithm," Reliability Engineering and System Safety, Elsevier, vol. 93(4), pages 550-556.
    6. Pieter-Tjerk de Boer & Dirk Kroese & Shie Mannor & Reuven Rubinstein, 2005. "A Tutorial on the Cross-Entropy Method," Annals of Operations Research, Springer, vol. 134(1), pages 19-67, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Behzad Karimi & Seyed Taghi Akhavan Niaki & Seyyed Masih Miriha & Mahsa Ghare Hasanluo & Shima Javanmard, 2019. "A weighted K-means clustering approach to solve the redundancy allocation problem of systems having components with different failures," Journal of Risk and Reliability, , vol. 233(6), pages 925-942, December.
    2. Blum, Christian & Ochoa, Gabriela, 2021. "A comparative analysis of two matheuristics by means of merged local optima networks," European Journal of Operational Research, Elsevier, vol. 290(1), pages 36-56.
    3. Juan Li & Bin Xin & Panos M. Pardalos & Jie Chen, 2021. "Solving bi-objective uncertain stochastic resource allocation problems by the CVaR-based risk measure and decomposition-based multi-objective evolutionary algorithms," Annals of Operations Research, Springer, vol. 296(1), pages 639-666, January.
    4. Pedro Pinacho-Davidson & Christian Blum, 2020. "Barrakuda : A Hybrid Evolutionary Algorithm for Minimum Capacitated Dominating Set Problem," Mathematics, MDPI, vol. 8(11), pages 1-26, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Caserta, Marco & Voß, Stefan, 2015. "An exact algorithm for the reliability redundancy allocation problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 110-116.
    2. Seyed Mohsen Mousavi & Najmeh Alikar & Madjid Tavana & Debora Di Caprio, 2019. "An improved particle swarm optimization model for solving homogeneous discounted series-parallel redundancy allocation problems," Journal of Intelligent Manufacturing, Springer, vol. 30(3), pages 1175-1194, March.
    3. Zaretalab, Arash & Hajipour, Vahid & Tavana, Madjid, 2020. "Redundancy allocation problem with multi-state component systems and reliable supplier selection," Reliability Engineering and System Safety, Elsevier, vol. 193(C).
    4. Gholinezhad, Hadi & Zeinal Hamadani, Ali, 2017. "A new model for the redundancy allocation problem with component mixing and mixed redundancy strategy," Reliability Engineering and System Safety, Elsevier, vol. 164(C), pages 66-73.
    5. Chambari, Amirhossain & Najafi, Amir Abbas & Rahmati, Seyed Habib A. & Karimi, Aida, 2013. "An efficient simulated annealing algorithm for the redundancy allocation problem with a choice of redundancy strategies," Reliability Engineering and System Safety, Elsevier, vol. 119(C), pages 158-164.
    6. Kong, Xiangyong & Gao, Liqun & Ouyang, Haibin & Li, Steven, 2015. "Solving the redundancy allocation problem with multiple strategy choices using a new simplified particle swarm optimization," Reliability Engineering and System Safety, Elsevier, vol. 144(C), pages 147-158.
    7. Feizabadi, Mohammad & Jahromi, Abdolhamid Eshraghniaye, 2017. "A new model for reliability optimization of series-parallel systems with non-homogeneous components," Reliability Engineering and System Safety, Elsevier, vol. 157(C), pages 101-112.
    8. Meisam Sadeghi & Emad Roghanian & Hamid Shahriari & Hassan Sadeghi, 2021. "Reliability optimization for non-repairable series-parallel systems with a choice of redundancy strategies and heterogeneous components: Erlang time-to-failure distribution," Journal of Risk and Reliability, , vol. 235(3), pages 509-528, June.
    9. Meisam Sadeghi & Emad Roghanian, 2017. "Reliability optimization for non-repairable series-parallel systems with a choice of redundancy strategies: Erlang time-to-failure distribution," Journal of Risk and Reliability, , vol. 231(5), pages 587-604, October.
    10. Peiravi, Abdossaber & Ardakan, Mostafa Abouei & Zio, Enrico, 2020. "A new Markov-based model for reliability optimization problems with mixed redundancy strategy," Reliability Engineering and System Safety, Elsevier, vol. 201(C).
    11. Zaretalab, Arash & Sharifi, Mani & Guilani, Pedram Pourkarim & Taghipour, Sharareh & Niaki, Seyed Taghi Akhavan, 2022. "A multi-objective model for optimizing the redundancy allocation, component supplier selection, and reliable activities for multi-state systems," Reliability Engineering and System Safety, Elsevier, vol. 222(C).
    12. Peiravi, Abdossaber & Nourelfath, Mustapha & Zanjani, Masoumeh Kazemi, 2022. "Universal redundancy strategy for system reliability optimization," Reliability Engineering and System Safety, Elsevier, vol. 225(C).
    13. Xian Zhao & Jing Zhang & Xiaoyue Wang, 2019. "Joint optimization of components redundancy, spares inventory and repairmen allocation for a standby series system," Journal of Risk and Reliability, , vol. 233(4), pages 623-638, August.
    14. Kayedpour, Farjam & Amiri, Maghsoud & Rafizadeh, Mahmoud & Shahryari Nia, Arash, 2017. "Multi-objective redundancy allocation problem for a system with repairable components considering instantaneous availability and strategy selection," Reliability Engineering and System Safety, Elsevier, vol. 160(C), pages 11-20.
    15. Ouyang, Zhiyuan & Liu, Yu & Ruan, Sheng-Jia & Jiang, Tao, 2019. "An improved particle swarm optimization algorithm for reliability-redundancy allocation problem with mixed redundancy strategy and heterogeneous components," Reliability Engineering and System Safety, Elsevier, vol. 181(C), pages 62-74.
    16. Zhang, Enze & Chen, Qingwei, 2016. "Multi-objective reliability redundancy allocation in an interval environment using particle swarm optimization," Reliability Engineering and System Safety, Elsevier, vol. 145(C), pages 83-92.
    17. Abouei Ardakan, Mostafa & Zeinal Hamadani, Ali, 2014. "Reliability optimization of series–parallel systems with mixed redundancy strategy in subsystems," Reliability Engineering and System Safety, Elsevier, vol. 130(C), pages 132-139.
    18. Yeh, Wei-Chang, 2022. "BAT-based algorithm for finding all Pareto solutions of the series-parallel redundancy allocation problem with mixed components," Reliability Engineering and System Safety, Elsevier, vol. 228(C).
    19. Peiravi, Abdossaber & Karbasian, Mahdi & Ardakan, Mostafa Abouei & Coit, David W., 2019. "Reliability optimization of series-parallel systems with K-mixed redundancy strategy," Reliability Engineering and System Safety, Elsevier, vol. 183(C), pages 17-28.
    20. Soltani, Roya & Safari, Jalal & Sadjadi, Seyed Jafar, 2015. "Robust counterpart optimization for the redundancy allocation problem in series-parallel systems with component mixing under uncertainty," Applied Mathematics and Computation, Elsevier, vol. 271(C), pages 80-88.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joheur:v:22:y:2016:i:4:d:10.1007_s10732-014-9265-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.