{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:48:52Z","timestamp":1726408132054},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030298586"},{"type":"electronic","value":"9783030298593"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-29859-3_17","type":"book-chapter","created":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T16:03:53Z","timestamp":1566835433000},"page":"193-205","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Haploid Versus Diploid Genetic Algorithms. A Comparative Study"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Petrovan","sequence":"first","affiliation":[]},{"given":"Petrica","family":"Pop-Sitar","sequence":"additional","affiliation":[]},{"given":"Oliviu","family":"Matei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,26]]},"reference":[{"key":"17_CR1","volume-title":"Basic Algorithms and Operators","year":"1999","unstructured":"Back, T., Fogel, D.B., Michalewicz, Z. (eds.): Basic Algorithms and Operators, 1st edn. IOP Publishing Ltd., Bristol (1999)","edition":"1"},{"issue":"9","key":"17_CR2","doi-asserted-by":"publisher","first-page":"3403","DOI":"10.1007\/s00500-015-1803-5","volume":"20","author":"H Bhasin","year":"2016","unstructured":"Bhasin, H., Behal, G., Aggarwal, N., Saini, R.K., Choudhary, S.: On the applicability of diploid genetic algorithms in dynamic environments. Soft. Comput. 20(9), 3403\u20133410 (2016). https:\/\/doi.org\/10.1007\/s00500-015-1803-5","journal-title":"Soft. Comput."},{"key":"17_CR3","unstructured":"Bull, L.: Haploid-diploid evolutionary algorithms: the Baldwin effect and recombination nature\u2019s way. In: AISB (2017)"},{"issue":"4","key":"17_CR4","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1080\/00207160108805080","volume":"77","author":"J Digalakis","year":"2001","unstructured":"Digalakis, J., Margaritis, K.: On benchmarking functions for genetic algorithms. Int. J. Comput. Math. 77(4), 481\u2013506 (2001). https:\/\/doi.org\/10.1080\/00207160108805080","journal-title":"Int. J. Comput. Math."},{"key":"17_CR5","unstructured":"Goldberg, D., Smith, R.: Nonstationary function optimization using genetic algorithms with dominance and diploidy. In: Proceedings of Second International Conference on Genetic Algorithms and Their Application, pp. 59\u201368 (1987)"},{"key":"17_CR6","volume-title":"Adaptation in Natural and Artificial Systems","author":"JH Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975). Second edition 1992"},{"key":"17_CR7","unstructured":"Liekens, A., Eikelder, H., Hilbers, P.: Modeling and simulating diploid simple genetic algorithms. In: Proceedings Foundations of Genetic Algorithms VII, pp. 151\u2013168. FOGA VII (2003)"},{"key":"17_CR8","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An Introduction to Genetic Algorithms","author":"M Mitchell","year":"1998","unstructured":"Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1998)"},{"key":"17_CR9","unstructured":"Ng, K.P., Wong, K.C.: A new diploid scheme and dominance change mechanism for non-stationary function optimization. In: Proceedings of the 6th International Conference on Genetic Algorithms, pp. 159\u2013166. Morgan Kaufmann Publishers Inc., San Francisco (1995). http:\/\/dl.acm.org\/citation.cfm?id=645514.657904"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-319-59650-1_13","volume-title":"Hybrid Artificial Intelligent Systems","author":"P Pop","year":"2017","unstructured":"Pop, P., Oliviu, M., Sabo, C.: A hybrid diploid genetic based algorithm for solving the generalized traveling salesman problem. In: Mart\u00ednez de Pis\u00f3n, F.J., Urraca, R., Quinti\u00e1n, H., Corchado, E. (eds.) HAIS 2017. LNCS (LNAI), vol. 10334, pp. 149\u2013160. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59650-1_13"},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.ejor.2017.08.015","volume":"265","author":"P Pop","year":"2018","unstructured":"Pop, P., Matei, O., Sabo, C., Petrovan, A.: A two-level solution approach for solving the generalized minimum spanning tree problem. Eur. J. Oper. Res. 265(2), 478\u2013487 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Pop, P., Matei, O., Pintea, C.: A two-level diploid genetic based algorithm for solving the family traveling salesman problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, pp. 340\u2013346. ACM, New York (2018). https:\/\/doi.org\/10.1145\/3205455.3205545","DOI":"10.1145\/3205455.3205545"},{"issue":"11","key":"17_CR13","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s00500-004-0422-3","volume":"9","author":"S Yang","year":"2005","unstructured":"Yang, S., Yao, X.: Experimental study on population-based incremental learning algorithms for dynamic optimization problems. Soft Comput. 9(11), 815\u2013834 (2005). https:\/\/doi.org\/10.1007\/s00500-004-0422-3","journal-title":"Soft Comput."},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-58484-6_248","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN III","author":"Y Yukiko","year":"1994","unstructured":"Yukiko, Y., Nobue, A.: A diploid genetic algorithm for preserving population diversity \u2014 Pseudo-Meiosis GA. In: Davidor, Y., Schwefel, H.-P., M\u00e4nner, R. (eds.) PPSN 1994. LNCS, vol. 866, pp. 36\u201345. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58484-6_248"}],"container-title":["Lecture Notes in Computer Science","Hybrid Artificial Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29859-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:09:41Z","timestamp":1710266981000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29859-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030298586","9783030298593"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29859-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"26 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HAIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Hybrid Artificial Intelligence Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Le\u00f3n","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2019","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":"hais2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2019.haisconference.eu\/","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":"134","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":"64","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":"3","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":"4","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)"}}]}}