{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:30Z","timestamp":1750188630700,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031700545"},{"type":"electronic","value":"9783031700552"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-70055-2_1","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:02:54Z","timestamp":1725649374000},"page":"3-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Design of\u00a0Diploid Memetic Algorithms for\u00a0Solving the\u00a0Multidimensional Multi-way Number Partitioning Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6877-027X","authenticated-orcid":false,"given":"Adrian","family":"Petrovan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0626-9284","authenticated-orcid":false,"given":"Petric\u0103 C.","family":"Pop","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7805-571X","authenticated-orcid":false,"given":"Cosmin","family":"Sabo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"issue":"1","key":"1_CR1","first-page":"152","volume":"17","author":"A Benavoli","year":"2016","unstructured":"Benavoli, A., Corani, G., Mangili, F.: Should we really use post-hoc tests based on mean-ranks? J. Mach. Learn. Res. 17(1), 152\u2013161 (2016)","journal-title":"J. Mach. Learn. Res."},{"issue":"9","key":"1_CR2","doi-asserted-by":"publisher","first-page":"3403","DOI":"10.1007\/s00500-015-1803-5","volume":"20","author":"H Bhasin","year":"2015","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 (2015). https:\/\/doi.org\/10.1007\/s00500-015-1803-5","journal-title":"Soft Comput."},{"key":"1_CR3","unstructured":"Deb, K., Goldberg, D.E.: An investigation of niche and species formation in genetic function optimization. In: Proceedings of the 3rd International Conference on Genetic Algorithms, pp. 42\u201350 (1989)"},{"key":"1_CR4","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1\u201330 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"120762","DOI":"10.1016\/j.eswa.2023.120762","volume":"232","author":"M Djukanovi\u0107","year":"2023","unstructured":"Djukanovi\u0107, M., Kartelj, A., Blum, C.: Self-adaptive CMSA for solving the multidimensional multi-way number partitioning problem. Expert Syst. Appl. 232, 120762 (2023)","journal-title":"Expert Syst. Appl."},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.3390\/su10051333","volume":"10","author":"MA Dulebenets","year":"2018","unstructured":"Dulebenets, M.A.: A diploid evolutionary algorithm for sustainable truck scheduling at a cross-docking facility. Sustainability 10, 1333 (2018)","journal-title":"Sustainability"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.endm.2018.03.014","volume":"66","author":"AF Faria","year":"2018","unstructured":"Faria, A.F., de Souza, S.R., Silva, C.A.: Variable neighborhood descent applied to multi-way number partitioning problem. Electron. Notes Discrete Math. 66, 103\u2013110 (2018)","journal-title":"Electron. Notes Discrete Math."},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.entcs.2019.08.039","volume":"346","author":"AF Faria","year":"2019","unstructured":"Faria, A.F., de Souza, S.R., de S\u00e1, E.M., Silva, C.A.: Variable neighborhood descent branching applied to the multi-way number partitioning problem. Electron. Notes Theor. Comput. Sci. 346, 437\u2013447 (2019)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.cor.2020.105133","volume":"127","author":"AF Faria","year":"2021","unstructured":"Faria, A.F., de Souza, S.R., de S\u00e1, E.M.: A mixed-integer linear programming model to solve the multidimensional multi-way number partitioning problem. Comput. Oper. Res. 127, 105\u2013133 (2021)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"1_CR10","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1162\/EVCO_a_00067","volume":"21","author":"SF Galan","year":"2013","unstructured":"Galan, S.F., Mengshoel, O.J., Pinter, R.: A novel mating approach for genetic algorithms. Evol. Comput. 21(2), 197\u2013229 (2013)","journal-title":"Evol. Comput."},{"issue":"8","key":"1_CR11","doi-asserted-by":"publisher","first-page":"2302","DOI":"10.1016\/j.camwa.2010.08.024","volume":"60","author":"J Koji\u0107","year":"2010","unstructured":"Koji\u0107, J.: Integer linear programming model for multidimensional two-way number partitioning problem. Comput. Math. Appl. 60(8), 2302\u20132308 (2010)","journal-title":"Comput. Math. Appl."},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.cor.2014.01.003","volume":"46","author":"J Kratica","year":"2014","unstructured":"Kratica, J., Koji\u0107, J., Savi\u0107, A.: Two metaheuristic approaches for solving multidimensional two-way number partitioning problem. Comput. Oper. Res. 46, 59\u201368 (2014)","journal-title":"Comput. Oper. Res."},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.neucom.2014.02.074","volume":"150A","author":"O Matei","year":"2015","unstructured":"Matei, O., Pop, P.C., Sas, I., Chira, C.: An improved immigration memetic algorithm for solving the heterogeneous fixed fleet vehicle routing problem. Neurocomputing 150A, 58\u201366 (2015)","journal-title":"Neurocomputing"},{"issue":"3","key":"1_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40314-022-01825-2","volume":"41","author":"B Nikolic","year":"2022","unstructured":"Nikolic, B., Djukanovi\u0107, M., Matic, D.: New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem. Comput. Appl. Math. 41(3), 1\u201372 (2022)","journal-title":"Comput. Appl. Math."},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Petrovan, A., Pop, P.C., Sabo, C., Zelina, I.: Novel two-level hybrid genetic algorithms based on different cayley-type encodings for solving the clustered shortest-path tree problem, Expert Syst. Appl. 215, 119372 (2023)","DOI":"10.1016\/j.eswa.2022.119372"},{"issue":"2","key":"1_CR16","doi-asserted-by":"publisher","first-page":"433","DOI":"10.37193\/CJM.2023.02.08","volume":"39","author":"A Petrovan","year":"2023","unstructured":"Petrovan, A., Matei, O., Pop, P.C.: A comparative study between haploid genetic algorithms and diploid genetic algorithms. Carpathian J. Math. 39(2), 433\u2013458 (2023)","journal-title":"Carpathian J. Math."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Petrovan, A., Pop, P.C., Sabo, C., Matei, O.: A diploid genetic algorithm for solving the multi-dimensional multi-way number partitioning problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 231\u2013234 (2023)","DOI":"10.1145\/3583133.3590672"},{"key":"1_CR18","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":"1_CR19","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.ejor.2017.08.015","volume":"265","author":"PC Pop","year":"2018","unstructured":"Pop, P.C., 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":"1_CR20","doi-asserted-by":"crossref","unstructured":"Pop, P.C., 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, pp. 340\u2013346 (2018)","DOI":"10.1145\/3205455.3205545"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-030-29859-3_17","volume-title":"Hybrid Artificial Intelligent Systems","author":"A Petrovan","year":"2019","unstructured":"Petrovan, A., Pop-Sitar, P., Matei, O.: Haploid versus diploid genetic algorithms. a comparative study. In: P\u00e9rez Garc\u00eda, H., S\u00e1nchez Gonz\u00e1lez, L., Castej\u00f3n Limas, M., Quinti\u00e1n Pardo, H., Corchado Rodr\u00edguez, E. (eds.) HAIS 2019. LNCS (LNAI), vol. 11734, pp. 193\u2013205. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29859-3_17"},{"issue":"22","key":"1_CR22","doi-asserted-by":"publisher","first-page":"9191","DOI":"10.1016\/j.apm.2013.03.075","volume":"37","author":"PC Pop","year":"2013","unstructured":"Pop, P.C., Matei, O.: A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem. Appl. Math. Model. 37(22), 9191\u20139202 (2013)","journal-title":"Appl. Math. Model."},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-44973-4_10","volume-title":"Learning and Intelligent Optimization","author":"PC Pop","year":"2013","unstructured":"Pop, P.C., Matei, O.: A genetic algorithm approach for the multidimensional two-way number partitioning problem. In: Nicosia, G., Pardalos, P. (eds.) LION 2013. LNCS, vol. 7997, pp. 81\u201386. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-44973-4_10"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"114938","DOI":"10.1016\/j.eswa.2021.114938","volume":"178","author":"V Santucci","year":"2021","unstructured":"Santucci, V., Baioletti, M., Di Bari, G.: An improved memetic algebraic differential evolution for solving the multidimensional two-way number partitioning problem. Expert Syst. Appl. 178, 114938 (2021)","journal-title":"Expert Syst. Appl."},{"key":"1_CR25","unstructured":"Simon, D.: An analysis of diploidy and dominance in genetic algorithms. In: International Conference on Computer, Communication, Control and Information Technology, West Bengal, India, (2009)"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Schlierkamp-Voosen, D., M\u00fchlenbein, H.: Strategy adaptation by competing subpopulations. In: Proceedings of International Conference on Parallel Problem Solving from Nature, pp. 199\u2013208 (1994)","DOI":"10.1007\/3-540-58484-6_264"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Schreiber, E.L., Korf, R.E., Moffitt, M.D.: Optimal multi-way number partitioning. J. ACM. 65(4), 24 (2018)","DOI":"10.1145\/3184400"},{"issue":"4","key":"1_CR28","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1108\/IJICC-07-2015-0026","volume":"8","author":"B Shabash","year":"2015","unstructured":"Shabash, B., Wiese, K.C.: Diploidy in evolutionary algorithms for dynamic optimization problems: a best-chromosome-wins dominance mechanism. Int. J. Intell. Comput. Cybern. 8(4), 312\u2013329 (2015)","journal-title":"Int. J. Intell. Comput. Cybern."},{"key":"1_CR29","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/s00500-004-0421-4","volume":"9","author":"A\u015e Uyar","year":"2005","unstructured":"Uyar, A.\u015e, Harmanci, A.E.: A new population based adaptive domination change mechanism for diploid genetic algorithms in dynamic environments. Soft. Comput. 9, 803\u2013814 (2005)","journal-title":"Soft. Comput."},{"key":"1_CR30","unstructured":"Yang, S.: On the design of diploid genetic algorithms for problem optimization in dynamic environments. In: Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 1362\u20131369 (2006)"},{"key":"1_CR31","unstructured":"Yang, S.: Learning the dominance in diploid genetic algorithms for changing optimization problems. In: Proceedings of the 2nd International Symposium on Intelligence Computation and Applications, pp. 157\u2013162 (2007)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70055-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:03:11Z","timestamp":1725649391000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70055-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031700545","9783031700552"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70055-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hagenberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2024.fh-ooe.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}