{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:04:05Z","timestamp":1743005045285,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031414558"},{"type":"electronic","value":"9783031414565"}],"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-41456-5_36","type":"book-chapter","created":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T23:02:43Z","timestamp":1694559763000},"page":"472-483","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Analysis of Different Reinsertion Strategies in Steady State Genetic Algorithm"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1429-6709","authenticated-orcid":false,"given":"M\u00e1rk","family":"Domonkos","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4662-2668","authenticated-orcid":false,"given":"Majd","family":"Koshakji","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8063-8498","authenticated-orcid":false,"given":"Ali","family":"Youssef","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5402-214X","authenticated-orcid":false,"given":"Issa","family":"Kalloumah","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0896-9890","authenticated-orcid":false,"given":"Modar","family":"Alshamali","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7838-6148","authenticated-orcid":false,"given":"J\u00e1nos","family":"Botzheim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,13]]},"reference":[{"issue":"5","key":"36_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10492-014-0069-z","volume":"59","author":"A Agapie","year":"2014","unstructured":"Agapie, A., Wright, A.H.: Theoretical analysis of steady state genetic algorithms. Appl. Math. 59(5), 509\u2013525 (2014)","journal-title":"Appl. Math."},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Branke, J., Orbay\u0131, M., Uyar, S.: The role of representations in dynamic knapsack problems. EvoWorkshops (2006)","DOI":"10.1007\/11732242_74"},{"key":"36_CR3","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-030-14118-9_15","volume-title":"The International Conference on Advanced Machine Learning Technologies and Applications (AMLTA2019)","author":"MA El-Shorbagy","year":"2020","unstructured":"El-Shorbagy, M.A., Farag, M.A., Mousa, A.A., El-Desoky, I.M.: A hybridization of sine cosine algorithm with steady state genetic algorithm for engineering design problems. In: Hassanien, A.E., Azar, A.T., Gaber, T., Bhatnagar, R., F. Tolba, M. (eds.) AMLTA 2019. AISC, vol. 921, pp. 143\u2013155. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-14118-9_15"},{"key":"36_CR4","doi-asserted-by":"publisher","unstructured":"Hinterding, R.: Gaussian mutation and self-adaption for numeric genetic algorithms. In: Proceedings of 1995 IEEE International Conference on Evolutionary Computation, vol. 1 (1995). https:\/\/doi.org\/10.1109\/ICEC.1995.489178","DOI":"10.1109\/ICEC.1995.489178"},{"key":"36_CR5","unstructured":"Holland, J.H.: Adaptation in natural and artificial systems. Ann Arbor (1975)"},{"key":"36_CR6","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1090.001.0001","volume-title":"Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence","author":"JH Holland","year":"1992","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. MIT press, Cambridge (1992)"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Jamil, M., Yang, X.S.: A literature survey of benchmark functions for global optimization problems. arXiv preprint arXiv:1308.4008 (2013)","DOI":"10.1504\/IJMMNO.2013.055204"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Kora, P., Yadlapalli, P.: Crossover operators in genetic algorithms: a review. Int. J. Comput. Appl. (2017)","DOI":"10.5120\/ijca2017913370"},{"key":"36_CR9","unstructured":"Rao, A.S., Rao, C.: Principles and Methods for Data Science. Elsevier (2020)"},{"key":"36_CR10","unstructured":"Rastrigin, L.A.: Systems of extremal control. Nauka (1974)"},{"key":"36_CR11","unstructured":"Razali, N.M., Geraghty, J.: Genetic algorithm performance with different selection strategies in solving TSP. In: Proceedings of the World Congress on Engineering 2011, vol. II (2011)"},{"key":"36_CR12","unstructured":"Rifki, O., Ono, H.: A survey of computational approaches to portfolio optimization by genetic algorithms. In: 18th International Conference Computing in Economics and Finance. Society for Computational Economics (2012)"},{"issue":"3","key":"36_CR13","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1109\/TAC.1968.1098903","volume":"13","author":"M Schumer","year":"1968","unstructured":"Schumer, M., Steiglitz, K.: Adaptive step size random search. IEEE Trans. Autom. Control 13(3), 270\u2013276 (1968)","journal-title":"IEEE Trans. Autom. Control"},{"key":"36_CR14","unstructured":"Schwefel, H.P.: Numerical Optimization of Computer Models. Wiley, Hoboken (1981)"},{"key":"36_CR15","doi-asserted-by":"publisher","unstructured":"Silva, A.F., Valente, J.M., Schaller, J.E.: Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective. Comput. Oper. Res. 140, 105691 (2022). https:\/\/doi.org\/10.1016\/j.cor.2021.105691, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054821003865","DOI":"10.1016\/j.cor.2021.105691"},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"Syswerda, G.: A study of reproduction in generational and steady-state genetic algorithms. In: Foundations of Genetic Algorithms, vol. 1, pp. 94\u2013101. Elsevier (1991)","DOI":"10.1016\/B978-0-08-050684-5.50009-4"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Vose, M.D.: The Simple Genetic Algorithm. Foundations and Theory, Massachusetts Institute of Technology (1999)","DOI":"10.7551\/mitpress\/6229.001.0001"}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-41456-5_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T23:07:36Z","timestamp":1694560056000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-41456-5_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031414558","9783031414565"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-41456-5_36","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":"13 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Collective Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Budapest","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hungary","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":"27 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccci2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccci.pwr.edu.pl\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"218","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":"59","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":"27% - 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":"3.01","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":"1.86","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)"}}]}}