{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:18:26Z","timestamp":1742955506074,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":36,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819635054"},{"type":"electronic","value":"9789819635061"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-3506-1_12","type":"book-chapter","created":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T12:49:59Z","timestamp":1740746999000},"page":"164-179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["VBEA: Voting-Based Evolutionary Algorithm for\u00a0Multi-objective Planning"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Merino","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0431-9134","authenticated-orcid":false,"given":"Raj","family":"Korpan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,28]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Back, T.: Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press, USA (1996)","DOI":"10.1093\/oso\/9780195099713.001.0001"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Bao, C., Xu, L., Goodman, E.D., Cao, L.: A novel non-dominated sorting algorithm for evolutionary multi-objective optimization. J. Comput. Sci.23, 31\u201343 (2017). https:\/\/doi.org\/10.1016\/j.jocs.2017.09.015, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1877750317310530","DOI":"10.1016\/j.jocs.2017.09.015"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. 35(3), 268\u2013308 (2003). https:\/\/doi.org\/10.1145\/937503.937505","DOI":"10.1145\/937503.937505"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Cong, R., Qi, J., Wu, C., Wang, M., Guo, J.: Multi-UAVs cooperative detection based on improved NSGA-II algorithm. In: 2020 39th Chinese Control Conference (CCC), pp. 1524\u20131529 (2020). https:\/\/doi.org\/10.23919\/CCC50068.2020.9188354","DOI":"10.23919\/CCC50068.2020.9188354"},{"issue":"2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Flach, P.: Machine learning: the art and science of algorithms that make sense of data. Cambridge University Press (2012)","DOI":"10.1017\/CBO9780511973000"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Gei\u00dfer, F., Haslum, P., Thi\u00e9baux, S., Trevizan, F.: Admissible heuristics for multi-objective planning. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol.\u00a032, pp. 100\u2013109 (2022)","DOI":"10.1609\/icaps.v32i1.19790"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Goldin, B., Salzman, O.: Approximate bi-criteria search by efficient representation of subsets of the pareto-optimal frontier. In: Proceedings of the International Conference on Automated Planning and Scheduling 31(1), 149\u2013158 (2021). https:\/\/doi.org\/10.1609\/icaps.v31i1.15957, https:\/\/ojs.aaai.org\/index.php\/ICAPS\/article\/view\/15957","DOI":"10.1609\/icaps.v31i1.15957"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Goldin, B., Salzman, O.: Approximate bi-criteria search by efficient representation of subsets of the pareto-optimal frontier. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol.\u00a031, pp. 149\u2013158 (2021)","DOI":"10.1609\/icaps.v31i1.15957"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","DOI":"10.1109\/TSSC.1968.300136"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Hern\u00e1ndez\u00a0Ulloa, C., Yeoh, W., Baier, J.A., Zhang, H., Suazo, L., Koenig, S.: A simple and fast bi-objective search algorithm. In: Proceedings of the International Conference on Automated Planning and Scheduling , vol. 30, no. 1, pp. 143\u2013151 (2020). https:\/\/doi.org\/10.1609\/icaps.v30i1.6655, https:\/\/ojs.aaai.org\/index.php\/ICAPS\/article\/view\/6655","DOI":"10.1609\/icaps.v30i1.6655"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Jaimes, A.L., Coello, C.A.C.: Many-objective problems: challenges and methods. In: Springer Handbook of Computational Intelligence, pp. 1033\u20131046. Springer (2015)","DOI":"10.1007\/978-3-662-43505-2_51"},{"key":"12_CR13","unstructured":"Korpan, R.: VBMO: Voting-based multi-objective path planning. In: IJCAI 2023 First International Workshop on Search and Planning with Complex Objectives (2023)"},{"key":"12_CR14","unstructured":"Korpan, R., Epstein, S.: Contrastive natural language explanations for multi-objective path planning. In: ICAPS 2021 Workshop on Explainable AI Planning (2021)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"LaValle, S.M.: Planning algorithms. Cambridge University Press (2006)","DOI":"10.1017\/CBO9780511546877"},{"issue":"5","key":"12_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1754399.1754400","volume":"57","author":"L Mandow","year":"2008","unstructured":"Mandow, L., De La Cruz, J.L.P.: Multiobjective A* search with consistent heuristics. J. ACM (JACM) 57(5), 1\u201325 (2008)","journal-title":"J. ACM (JACM)"},{"issue":"6","key":"12_CR17","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s00158-009-0460-7","volume":"41","author":"RT Marler","year":"2010","unstructured":"Marler, R.T., Arora, J.S.: The weighted sum method for multi-objective optimization: new insights. Struct. Multidiscip. Optim. 41(6), 853\u2013862 (2010)","journal-title":"Struct. Multidiscip. Optim."},{"key":"12_CR18","unstructured":"Pardalos, P.M., Migdalas, A., Pitsoulis, L.: Pareto optimality, game theory and equilibria, vol.\u00a017. Springer Science and Business Media (2008)"},{"key":"12_CR19","volume-title":"Heuristics: Intelligent Search Strategies for Computer Problem Solving","author":"J Pearl","year":"1984","unstructured":"Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Pub. Co., Inc, Reading, MA (1984)"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Pulido, F.J., Mandow, L., de-la Cruz, J.L.P.: Dimensionality reduction in multiobjective shortest path search. Comput. Oper. Res. 64, 60\u201370 (2015). https:\/\/api.semanticscholar.org\/CorpusID:22259230","DOI":"10.1016\/j.cor.2015.05.007"},{"key":"12_CR21","doi-asserted-by":"publisher","unstructured":"Qiao, S., Dai, X., Liu, Z., Huang, J., Zhu, G.: Improving the optimization performance of NSGA-II algorithm by experiment design methods. In: 2012 IEEE International Conference on Computational Intelligence for Measurement Systems and Applications (CIMSA) Proceedings, pp. 82\u201385 (2012). https:\/\/doi.org\/10.1109\/CIMSA.2012.6269589","DOI":"10.1109\/CIMSA.2012.6269589"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Riquelme, N., Von\u00a0L\u00fccken, C., Baran, B.: Performance metrics in multi-objective optimization. In: 2015 Latin American Computing Conference (CLEI), pp. 1\u201311. IEEE (2015)","DOI":"10.1109\/CLEI.2015.7360024"},{"issue":"4","key":"12_CR23","first-page":"1","volume":"5","author":"F Rossi","year":"2011","unstructured":"Rossi, F., Venable, K.B., Walsh, T.: A short introduction to preferences: between artificial intelligence and social choice. Synth. Lect. Artif. Intell. Mach. Learn. 5(4), 1\u2013102 (2011)","journal-title":"Synth. Lect. Artif. Intell. Mach. Learn."},{"key":"12_CR24","doi-asserted-by":"publisher","unstructured":"Salzman, O., Felner, A., Hern\u00e1ndez, C., Zhang, H., Chan, S.H., Koenig, S.: Heuristic-search approaches for the multi-objective shortest-path problem: progress and research opportunities. In: Elkind, E. (ed.) Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI-23, pp. 6759\u20136768. International Joint Conferences on Artificial Intelligence Organization (2023). https:\/\/doi.org\/10.24963\/ijcai.2023\/757, survey Track","DOI":"10.24963\/ijcai.2023\/757"},{"key":"12_CR25","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.cor.2014.11.010","volume":"57","author":"A Sedeno-Noda","year":"2015","unstructured":"Sedeno-Noda, A., Raith, A.: A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem. Comput. Oper. Res. 57, 83\u201394 (2015)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"12_CR26","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1145\/115234.115368","volume":"38","author":"BS Stewart","year":"1991","unstructured":"Stewart, B.S., White, C.C., III.: Multiobjective A*. J. ACM (JACM) 38(4), 775\u2013814 (1991)","journal-title":"J. ACM (JACM)"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Sturtevant, N.: Benchmarks for grid-based pathfinding. Trans. Comput. Intell. AI Games 4(2), 144 \u2013148 (2012). http:\/\/web.cs.du.edu\/~sturtevant\/papers\/benchmarks.pdf","DOI":"10.1109\/TCIAIG.2012.2197681"},{"issue":"1\u20132","key":"12_CR28","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1111\/j.1475-3995.2011.00808.x","volume":"19","author":"EG Talbi","year":"2012","unstructured":"Talbi, E.G., Basseur, M., Nebro, A.J., Alba, E.: Multi-objective optimization using metaheuristics: non-standard algorithms. Int. Trans. Oper. Res. 19(1\u20132), 283\u2013305 (2012)","journal-title":"Int. Trans. Oper. Res."},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Ulloa, C.H., Yeoh, W., Baier, J.A., Zhang, H., Suazo, L., Koenig, S.: A simple and fast bi-objective search algorithm. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol.\u00a030, pp. 143\u2013151 (2020)","DOI":"10.1609\/icaps.v30i1.6655"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Van\u00a0Erp, M., Vuurpijl, L., Schomaker, L.: An overview and comparison of voting methods for pattern recognition. In: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition, pp. 195\u2013200. IEEE (2002)","DOI":"10.1109\/IWFHR.2002.1030908"},{"key":"12_CR31","doi-asserted-by":"publisher","unstructured":"Weise, J., Mostaghim, S.: A scalable many-objective pathfinding benchmark suite. IEEE Trans. Evol. Comput. 26(1), 188\u2013194 (2022). https:\/\/doi.org\/10.1109\/tevc.2021.3089050","DOI":"10.1109\/tevc.2021.3089050"},{"issue":"1","key":"12_CR32","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1109\/TAC.1963.1105511","volume":"8","author":"L Zadeh","year":"1963","unstructured":"Zadeh, L.: Optimality and non-scalar-valued performance criteria. IEEE Trans. Autom. Control 8(1), 59\u201360 (1963)","journal-title":"IEEE Trans. Autom. Control"},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"Zhang, H., Salzman, O., Kumar, T.S., Felner, A., Ulloa, C.H., Koenig, S.: A* pex: efficient approximate multi-objective search on graphs. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol.\u00a032, pp. 394\u2013403 (2022)","DOI":"10.1609\/icaps.v32i1.19825"},{"issue":"6","key":"12_CR34","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":"12_CR35","doi-asserted-by":"publisher","unstructured":"Zhao, F., Huan, L., Zhang, Y., Ma, W., Zhang, C.: A novel multi-objective optimization algorithm based on differential evolution and NSGA-II. In: 2018 IEEE 22nd International Conference on Computer Supported Cooperative Work in Design (CSCWD), pp. 570\u2013575 (2018). https:\/\/doi.org\/10.1109\/CSCWD.2018.8465326","DOI":"10.1109\/CSCWD.2018.8465326"},{"key":"12_CR36","doi-asserted-by":"crossref","unstructured":"Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms\u2013a comparative case study. In: International Conference on Parallel Problem Solving from Nature, pp. 292\u2013301. Springer (1998)","DOI":"10.1007\/BFb0056872"}],"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-981-96-3506-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T12:50:11Z","timestamp":1740747011000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-3506-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819635054","9789819635061"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-3506-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"28 February 2025","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":"Canberra, ACT","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 March 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"emo2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.emo2025.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}