{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:34:55Z","timestamp":1743136495461,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031366215"},{"type":"electronic","value":"9783031366222"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-36622-2_5","type":"book-chapter","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T12:02:36Z","timestamp":1688731356000},"page":"55-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Dual-Strategy Contest Harmony Search Algorithm Based on Population State for the System Reliability-Redundancy Allocation Problems"],"prefix":"10.1007","author":[{"given":"Siqi","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chang","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haibin","family":"Ouyang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,8]]},"reference":[{"issue":"11","key":"5_CR1","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1016\/j.cor.2010.10.028","volume":"38","author":"WC Yeh","year":"2011","unstructured":"Yeh, W.C., Hsieh, T.J.: Solving reliability redundancy allocation problems using an artificial bee colony algorithm. Comput. Oper. Res. 38(11), 1465\u20131473 (2011)","journal-title":"Comput. Oper. Res."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Kundu, T., Deepmala, Jain P.K.: A hybrid salp swarm algorithm based on TLBO for reliability redundancy allocation problems. Appl. Intell. 52(11), 12630\u201312667 (2022)","DOI":"10.1007\/s10489-021-02862-w"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.ress.2019.02.010","volume":"185","author":"X Huang","year":"2019","unstructured":"Huang, X., Coolen, F., et al.: A heuristic survival signature based approach for reliability-redundancy allocation. Reliab. Eng. Syst. Saf. 185, 511\u2013517 (2019)","journal-title":"Reliab. Eng. Syst. Saf."},{"key":"5_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2022.108604","volume":"225","author":"S Li","year":"2022","unstructured":"Li, S., Chi, X., Yu, B.: An improved particle swarm optimization algorithm for the reliability\u2013redundancy allocation problem with global reliability. Reliab. Eng. Syst. Saf. 225, 108604 (2022)","journal-title":"Reliab. Eng. Syst. Saf."},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.ejor.2015.01.008","volume":"244","author":"M Caserta","year":"2015","unstructured":"Caserta, M., Vo\u00df, S.: An exact algorithm for the reliability redundancy allocation problem. Eur J Oper Res 244(1), 110\u2013116 (2015)","journal-title":"Eur J Oper Res"},{"key":"5_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2019.106531","volume":"191","author":"PK Muhuri","year":"2019","unstructured":"Muhuri, P.K., Nath, R.: A novel evolutionary algorithmic solution approach for bilevel reliability-redundancy allocation problem. Reliab. Eng. Syst. Saf. 191, 106531 (2019)","journal-title":"Reliab. Eng. Syst. Saf."},{"key":"5_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107321","volume":"106","author":"W Yeh","year":"2020","unstructured":"Yeh, W.: Simplified swarm optimization for bi-objection active reliability redundancy allocation problems. Appl. Soft Comput. 106, 107321 (2020)","journal-title":"Appl. Soft Comput."},{"key":"5_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101126","volume":"74","author":"F Qin","year":"2022","unstructured":"Qin, F., Zain, A.M., Zhou, K.Q.: Harmony search algorithm and related variants: a systematic review. Swarm Evol. Comput. 74, 101126 (2022)","journal-title":"Swarm Evol. Comput."},{"key":"5_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cscm.2021.e00647","volume":"15","author":"A Loor","year":"2021","unstructured":"Loor, A., Bidgoli, M., Hamid, M.: Optimization and buckling of rupture building beams reinforced by steel fibers on the basis of adaptive improved harmony search-harmonic differential quadrature methods. Case Stud. Construct. Mater. 15, e00647 (2021)","journal-title":"Case Stud. Construct. Mater."},{"key":"5_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.imu.2020.100408","volume":"21","author":"TA Shaikh","year":"2020","unstructured":"Shaikh, T.A., AliAn, R.: An intelligent healthcare system for optimized breast cancer diagnosis using harmony search and simulated annealing (HS-SA) algorithm. Inform. Med. Unlock. 21, 100408 (2020)","journal-title":"Inform. Med. Unlock."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"9262","DOI":"10.1109\/ACCESS.2021.3049922","volume":"9","author":"Q Zhu","year":"2021","unstructured":"Zhu, Q., Tang, X.: An ameliorated harmony search algorithm with hybrid convergence mechanism. IEEE Access 9, 9262\u20139276 (2021)","journal-title":"IEEE Access"},{"issue":"20","key":"5_CR12","doi-asserted-by":"publisher","first-page":"10225","DOI":"10.1007\/s00500-018-3579-x","volume":"23","author":"H Ouyang","year":"2018","unstructured":"Ouyang, H., Wu, W., Zhang, C., Li, S., Zou, D., Liu, G.: Improved harmony search with general iteration models for engineering design optimization problems. Soft. Comput. 23(20), 10225\u201310260 (2018). https:\/\/doi.org\/10.1007\/s00500-018-3579-x","journal-title":"Soft. Comput."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Zou, D.X., Gao, L.Q., Li, S., et al.: An effective global harmony search algorithm for reliability problems. Expert Syst. Appl. 38(4), 642\u20134648 (2011)","DOI":"10.1016\/j.eswa.2010.09.120"},{"issue":"11","key":"5_CR14","doi-asserted-by":"publisher","first-page":"3863","DOI":"10.1007\/s10489-018-1175-5","volume":"48","author":"H-B Ouyang","year":"2018","unstructured":"Ouyang, H.-B., Gao, L.-Q., Li, S.: Amended harmony search algorithm with perturbation strategy for large-scale system reliability problems. Appl. Intell. 48(11), 3863\u20133888 (2018). https:\/\/doi.org\/10.1007\/s10489-018-1175-5","journal-title":"Appl. Intell."},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60\u201368 (2001)","journal-title":"Simulation"},{"key":"5_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ast.2022.107374","volume":"122","author":"Z Han","year":"2022","unstructured":"Han, Z., Chen, M., Shao, S., et al.: Improved artificial bee colony algorithm-based path planning of unmanned autonomous helicopter using multi-strategy evolutionary learning. Aerosp. Sci. Technol. 122, 107374 (2022)","journal-title":"Aerosp. Sci. Technol."},{"issue":"16\u201318","key":"5_CR17","doi-asserted-by":"publisher","first-page":"3308","DOI":"10.1016\/j.neucom.2010.07.010","volume":"73","author":"D Zou","year":"2010","unstructured":"Zou, D., Gao, L., Wu, J., Li, S.: Novel global harmony search algorithm for unconstrained problems. Neurocomputing 73(16\u201318), 3308\u20133318 (2010)","journal-title":"Neurocomputing"},{"key":"5_CR18","first-page":"94","volume":"222","author":"M El-Abd","year":"2013","unstructured":"El-Abd, M.: An improved global-best harmony search algorithm. Appl. Math. Comput. 222, 94\u2013106 (2013)","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"5_CR19","doi-asserted-by":"publisher","first-page":"2837","DOI":"10.1007\/s00500-020-05341-5","volume":"25","author":"J Gholami","year":"2020","unstructured":"Gholami, J., Ghany, K.K.A., Zawbaa, H.M.: A novel global harmony search algorithm for solving numerical optimizations. Soft. Comput. 25(4), 2837\u20132849 (2020). https:\/\/doi.org\/10.1007\/s00500-020-05341-5","journal-title":"Soft. Comput."},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ins.2015.01.020","volume":"305","author":"H Ouyang","year":"2015","unstructured":"Ouyang, H., Gao, L., Li, S., et al.: Improved novel global harmony search with a new relaxation method for reliability optimization problems. Inf. Sci. 305, 14\u201355 (2015)","journal-title":"Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36622-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:15:25Z","timestamp":1710260125000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36622-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031366215","9783031366222"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36622-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"170","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}