{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:28:56Z","timestamp":1759847336264,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031272493"},{"type":"electronic","value":"9783031272509"}],"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-27250-9_22","type":"book-chapter","created":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T00:03:18Z","timestamp":1678320198000},"page":"305-318","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["MACO: A Real-World Inspired Benchmark for\u00a0Multi-objective Evolutionary Algorithms"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Mai","sequence":"first","affiliation":[]},{"given":"Tobias","family":"Benecke","sequence":"additional","affiliation":[]},{"given":"Sanaz","family":"Mostaghim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,9]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","unstructured":"Benecke, T., Mostaghim, S.: Tracking the heritage of genes in evolutionary algorithms. In: 2021 IEEE Congress on Evolutionary Computation (CEC), pp. 1800\u20131807 (2021). https:\/\/doi.org\/10.1109\/CEC45853.2021.9504916","DOI":"10.1109\/CEC45853.2021.9504916"},{"key":"22_CR2","doi-asserted-by":"publisher","unstructured":"Blank, J., Deb, K.: Pymoo: multi-objective optimization in python. IEEE Access 8, 89497\u201389509 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.2990567. arXiv: 2002.04504","DOI":"10.1109\/ACCESS.2020.2990567"},{"issue":"2","key":"22_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1162\/evco_a_00298","volume":"30","author":"D Brockhoff","year":"2022","unstructured":"Brockhoff, D., Auger, A., Hansen, N., Tu\u0161ar, T.: Using well-understood single-objective functions in multiobjective black-box optimization test suites. Evol. Comput. 30(2), 165\u2013193 (2022)","journal-title":"Evol. Comput."},{"key":"22_CR4","unstructured":"Deb, K., Agrawal, R.: Simulated binary crossover for continuous search space. Complex Syst. (1995). https:\/\/www.semanticscholar.org\/paper\/Simulated-Binary-Crossover-for-Continuous-Search-Deb-Agrawal\/b8ee6b68520ae0291075cb1408046a7dff9dd9ad"},{"key":"22_CR5","doi-asserted-by":"publisher","unstructured":"Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable multi-objective optimization test problems. In: Proceedings of the 2002 Congress on Evolutionary Computation. CEC 2002 (Cat. No. 02TH8600), vol. 1, pp. 825\u2013830 (2002). https:\/\/doi.org\/10.1109\/CEC.2002.1007032","DOI":"10.1109\/CEC.2002.1007032"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-7091-6384-9_40","volume-title":"Artificial Neural Nets and Genetic Algorithms","author":"K Deb","year":"1999","unstructured":"Deb, K., Agrawal, S.: A niched-penalty approach for constraint handling in genetic algorithms. In: Dobnikar, A., Steele, N.C., Pearson, D.W., Albrecht, R.F. (eds.) Artificial Neural Nets and Genetic Algorithms, pp. 235\u2013243. Springer, Vienna (1999). https:\/\/doi.org\/10.1007\/978-3-7091-6384-9_40"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/3-540-45356-3_83","volume-title":"Parallel Problem Solving from Nature PPSN VI","author":"K Deb","year":"2000","unstructured":"Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: Schoenauer, M., et al. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 849\u2013858. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45356-3_83"},{"issue":"4","key":"22_CR8","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Trans. Evol. Comput. 18(4), 577\u2013601 (2014). https:\/\/doi.org\/10.1109\/TEVC.2013.2281535","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"1125","DOI":"10.1109\/LRA.2019.2894217","volume":"4","author":"W Honig","year":"2019","unstructured":"Honig, W., Kiesel, S., Tinka, A., Durham, J.W., Ayanian, N.: Persistent and robust execution of MAPF schedules in warehouses. IEEE Robot. Autom. Lett. 4(2), 1125\u20131131 (2019). https:\/\/doi.org\/10.1109\/LRA.2019.2894217","journal-title":"IEEE Robot. Autom. Lett."},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-31880-4_20","volume-title":"Evolutionary Multi-Criterion Optimization","author":"S Huband","year":"2005","unstructured":"Huband, S., Barone, L., While, L., Hingston, P.: A scalable multi-objective test problem toolkit. In: Coello Coello, C.A., Hern\u00e1ndez Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol. 3410, pp. 280\u2013295. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31880-4_20"},{"key":"22_CR11","doi-asserted-by":"publisher","unstructured":"Ishibuchi, H., He, L., Shang, K.: Regular pareto front shape is not realistic. In: 2019 IEEE Congress on Evolutionary Computation (CEC), pp. 2034\u20132041 (2019). https:\/\/doi.org\/10.1109\/CEC.2019.8790342","DOI":"10.1109\/CEC.2019.8790342"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-030-72062-9_27","volume-title":"Evolutionary Multi-Criterion Optimization","author":"M Javadi","year":"2021","unstructured":"Javadi, M., Mostaghim, S.: Using neighborhood-based density measures for multimodal multi-objective optimization. In: Ishibuchi, H., et al. (eds.) EMO 2021. LNCS, vol. 12654, pp. 335\u2013345. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72062-9_27"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-030-60376-2_15","volume-title":"Swarm Intelligence","author":"S Mai","year":"2020","unstructured":"Mai, S., Mostaghim, S.: Modeling pathfinding for swarm robotics. In: Dorigo, M., St\u00fctzle, T., Blesa, M.J., Blum, C., Hamann, H., Heinrich, M.K., Strobel, V. (eds.) ANTS 2020. LNCS, vol. 12421, pp. 190\u2013202. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60376-2_15"},{"key":"22_CR14","doi-asserted-by":"publisher","unstructured":"Ochalek, M., Jenett, B., Formoso, O., Gregg, C., Trinh, G., Cheung, K.: Geometry systems for lattice-based reconfigurable space structures. In: 2019 IEEE Aerospace Conference, pp. 1\u201310 (2019). https:\/\/doi.org\/10.1109\/AERO.2019.8742178. ISSN 1095-323X","DOI":"10.1109\/AERO.2019.8742178"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Ren, Z., Zhan, R., Rathinam, S., Likhachev, M., Choset, H.: Enhanced multi-objective A * using balanced binary search trees. Technical report (2022)","DOI":"10.1609\/socs.v15i1.21764"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Sharon, G., Stern, R., Felner, A., Sturtevant, N.: Meta-agent conflict-based search for optimal multi-agent path finding. In: Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012, pp. 97\u2013104 (2012). ISBN 9781577355847","DOI":"10.1609\/socs.v3i1.18244"},{"key":"22_CR17","doi-asserted-by":"publisher","unstructured":"Smedberg, H., Bandaru, S.: Finding influential variables in multi-objective optimization problems. In: 2020 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 173\u2013180 (2020). https:\/\/doi.org\/10.1109\/SSCI47803.2020.9308383","DOI":"10.1109\/SSCI47803.2020.9308383"},{"issue":"63","key":"22_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/drones4040063","volume":"4","author":"C Steup","year":"2020","unstructured":"Steup, C., Parlow, S., Mai, S.: Generic component-based mission-centric energy model for micro-scale unmanned aerial vehicles. Drones 4(63), 1\u201317 (2020). https:\/\/doi.org\/10.3390\/drones4040063","journal-title":"Drones"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Surynek, P., Felner, A., Stern, R., Boyarski, E.: An empirical comparison of the hardness of multi-agent path finding under the makespan and the sum of costs objectives. In: Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016, pp. 145\u2013146 (2016). ISBN 9781577357698","DOI":"10.1609\/socs.v7i1.18407"},{"key":"22_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106078","volume":"89","author":"R Tanabe","year":"2020","unstructured":"Tanabe, R., Ishibuchi, H.: An easy-to-use real-world multi-objective optimization problem suite. Appl. Soft Comput. 89, 106078 (2020)","journal-title":"Appl. Soft Comput."},{"key":"22_CR21","doi-asserted-by":"publisher","unstructured":"Weise, J., Mai, S., Zille, H., Mostaghim, S.: On the scalable multi-objective multi-agent pathfinding problem. In: 2020 IEEE Congress on Evolutionary Computation, CEC 2020 - Conference Proceedings (2020). https:\/\/doi.org\/10.1109\/CEC48606.2020.9185585","DOI":"10.1109\/CEC48606.2020.9185585"},{"key":"22_CR22","unstructured":"Weise, J., Mostaghim, S.: Scalable Many-Objective Pathfinding Benchmark Suite, pp. 1\u201310 (2020). https:\/\/arxiv.org\/abs\/2010.04501. arXiv: 2010.04501"},{"issue":"6","key":"22_CR23","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007). https:\/\/doi.org\/10.1109\/TEVC.2007.892759","journal-title":"IEEE Trans. Evol. Comput."},{"key":"22_CR24","doi-asserted-by":"publisher","unstructured":"Zille, H., Ishibuchi, H., Mostaghim, S., Nojima, Y.: Mutation operators based on variable grouping for multi-objective large-scale optimization. In: 2016 IEEE Symposium Series on Computational Intelligence, SSCI 2016 (2017). https:\/\/doi.org\/10.1109\/SSCI.2016.7850214. ISBN 9781509042401","DOI":"10.1109\/SSCI.2016.7850214"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Multi-Criterion Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-27250-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T00:07:40Z","timestamp":1678320460000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27250-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031272493","9783031272509"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27250-9_22","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":"9 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EMO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Evolutionary Multi-Criterion Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"20 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"emo2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/emo2023.liacs.leidenuniv.nl\/","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":"equinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"65","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":"44","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":"68% - 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.42","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":"2.49","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)"}}]}}