{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:42:38Z","timestamp":1742938958671,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031568510"},{"type":"electronic","value":"9783031568527"}],"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-56852-7_14","type":"book-chapter","created":{"date-parts":[[2024,3,20]],"date-time":"2024-03-20T20:02:22Z","timestamp":1710964942000},"page":"209-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Sets of\u00a0Solutions for\u00a0Temporal Uncertain Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8828-8752","authenticated-orcid":false,"given":"Jens","family":"Weise","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9917-5227","authenticated-orcid":false,"given":"Sanaz","family":"Mostaghim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,21]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Bastian, M., Heymann, S., Jacomy, M.: Gephi: an open source software for exploring and manipulating networks. In: Proceedings of the International AAAI Conference on Web and Social Media, vol. 3, issue 1, pp. 361\u2013362 (2009)","DOI":"10.1609\/icwsm.v3i1.13937"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Bejarano, L.A., Espitia, H.E., Montenegro, C.E.: Clustering analysis for the pareto optimal front in multi-objective optimization. Computation 10(3), 37 (2022). Publisher: Multidisciplinary Digital Publishing Institute","DOI":"10.3390\/computation10030037"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Bollob\u00e1s, B.: Graph Theory, vol. 63. Springer, New York, New York, NY (1979), series Title: Graduate Texts in Mathematics. https:\/\/doi.org\/10.1007\/978-1-4612-9967-7","DOI":"10.1007\/978-1-4612-9967-7"},{"issue":"2","key":"14_CR4","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."},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0377-2217(96)00116-6","volume":"97","author":"M Ehrgott","year":"1997","unstructured":"Ehrgott, M., Klamroth, K.: Connectedness of efficient solutions in multiple criteria combinatorial optimization. Eur. J. Oper. Res. 97(1), 159\u2013166 (1997)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1080\/0022250X.1999.9990219","volume":"23","author":"MG Everett","year":"1999","unstructured":"Everett, M.G., Borgatti, S.P.: The centrality of groups and classes. J. Math. Sociol. 23(3), 181\u2013201 (1999)","journal-title":"J. Math. Sociol."},{"issue":"3","key":"14_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman, L.C.: Centrality in social networks conceptual clarification. Soc. Netw. 1(3), 215\u2013239 (1978)","journal-title":"Soc. Netw."},{"issue":"2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s10898-023-01275-y","volume":"86","author":"S Kahagalage","year":"2023","unstructured":"Kahagalage, S., Turan, H.H., Jalalvand, F., El Sawah, S.: A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems. J. Global Optim. 86(2), 467\u2013494 (2023)","journal-title":"J. Global Optim."},{"issue":"6","key":"14_CR9","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1002\/1520-6750(198812)35:6<615::AID-NAV3220350608>3.0.CO;2-K","volume":"35","author":"P Korhonen","year":"1988","unstructured":"Korhonen, P., Wallenius, J.: A pareto race. Naval Res. Logist. (NRL) 35(6), 615\u2013623 (1988)","journal-title":"Naval Res. Logist. (NRL)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-319-99259-4_19","volume-title":"Parallel Problem Solving from Nature - PPSN XV","author":"A Liefooghe","year":"2018","unstructured":"Liefooghe, A., Derbel, B., Verel, S., L\u00f3pez-Ib\u00e1\u00f1ez, M., Aguirre, H., Tanaka, K.: On pareto local optimal solutions networks. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) Parallel Problem Solving from Nature - PPSN XV. LNCS, pp. 232\u2013244. Springer International Publishing, Cham (2018)"},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1037\/h0043158","volume":"63","author":"GA Miller","year":"1956","unstructured":"Miller, G.A.: The magical number seven, plus or minus two: some limits on our capacity for processing information. Psychol. Rev. 63(2), 81\u201397 (1956)","journal-title":"Psychol. Rev."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004), publisher: American Physical Society","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"14_CR13","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-85646-7_7","volume-title":"Multiobjective Programming and Goal Programming","author":"L Paquete","year":"2009","unstructured":"Paquete, L., St\u00fctzle, T.: Clusters of non-dominated solutions in multiobjective combinatorial optimization: an experimental analysis. In: Barichard, V., Ehrgott, M., Gandibleux, X., T\u2019Kindt, V. (eds.) Multiobjective Programming and Goal Programming. LNEMS, pp. 69\u201377. Springer, Berlin, Heidelberg (2009)"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.cor.2015.05.007","volume":"64","author":"FJJ Pulido","year":"2015","unstructured":"Pulido, F.J.J., Mandow, L., P\u00e9rez-De-La-Cruz, J.L.L.: Dimensionality reduction in multi objective shortest path search. Comput. Oper. Res. 64, 60\u201370 (2015)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"14_CR15","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1016\/j.cor.2008.02.002","volume":"36","author":"A Raith","year":"2009","unstructured":"Raith, A., Ehrgott, M.: A comparison of solution strategies for biobjective shortest path problems. Comput. Oper. Res. 36(4), 1299\u20131331 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"16","key":"14_CR16","doi-asserted-by":"publisher","first-page":"5975","DOI":"10.1073\/pnas.0711295105","volume":"105","author":"JN Rouder","year":"2008","unstructured":"Rouder, J.N., Morey, R.D., Cowan, N., Zwilling, C.E., Morey, C.C., Pratte, M.S.: An assessment of fixed-capacity models of visual working memory. Proc. Natl. Acad. Sci. 105(16), 5975\u20135979 (2008)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"265","DOI":"10.7155\/jgaa.00108","volume":"9","author":"T Schank","year":"2005","unstructured":"Schank, T., Wagner, D.: Approximating clustering coefficient and transitivity. J. Graph Algorithms Appl. 9(2), 265\u2013275 (2005)","journal-title":"J. Graph Algorithms Appl."},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Traag, V.A., Waltman, L., van Eck, N.J.: From Louvain to Leiden: guaranteeing well-connected communities. Sci. Rep. 9(1), 5233 (2019). Publisher: Nature Publishing Group","DOI":"10.1038\/s41598-019-41695-z"},{"key":"14_CR19","unstructured":"Traag, V., et al.: vtraag\/leidenalg: 0.10.0 (2023)"},{"key":"14_CR20","unstructured":"Weise, J.: Evolutionary many-objective optimisation for pathfinding problems. Doctoral Thesis, Otto von Guericke University Magdeburg, Magdeburg (2023). Accepted: 2023\u201303-14T10:25:49Z. ISBN: 9781839107955"},{"key":"14_CR21","doi-asserted-by":"publisher","unstructured":"Weise, J.: Pareto graph analysis (2023). https:\/\/doi.org\/10.5281\/zenodo.10044244","DOI":"10.5281\/zenodo.10044244"},{"key":"14_CR22","doi-asserted-by":"publisher","unstructured":"Weise, J., Mostaghim, S.: Dataset (Pareto fronts and sets) for the Multi-objective pathfinding problem (2023). https:\/\/doi.org\/10.5281\/ZENODO.10008219","DOI":"10.5281\/ZENODO.10008219"},{"key":"14_CR23","unstructured":"Wilson, R.J.: Introduction to Graph Theory. Longman (2010)"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56852-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,25]],"date-time":"2024-03-25T00:15:19Z","timestamp":1711325719000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56852-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031568510","9783031568527"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56852-7_14","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":"21 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aberystwyth","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"3 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2024\/evoapps\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"77","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":"51","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":"66% - 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.4","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.7","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)"}}]}}