{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T06:04:15Z","timestamp":1750831455054,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030436797"},{"type":"electronic","value":"9783030436803"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43680-3_3","type":"book-chapter","created":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T23:04:05Z","timestamp":1586387045000},"page":"35-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Comparison of Genetic Representations for Multi-objective Shortest Path Problems on Multigraphs"],"prefix":"10.1007","author":[{"given":"Lilla","family":"Beke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Weiszer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,9]]},"reference":[{"key":"3_CR1","unstructured":"Inspyred: Bio-inspired algorithms in Python. https:\/\/pythonhosted.org\/inspyred\/. Accessed 30 Oct 2019"},{"key":"3_CR2","unstructured":"This research utilised Queen Mary\u2019s apocrita HPC facility, supported by QMUL research-it. http:\/\/doi.org\/10.5281\/zenodo.438045. Accessed 12 Nov 2019"},{"issue":"4","key":"3_CR3","doi-asserted-by":"publisher","first-page":"789","DOI":"10.2298\/CSIS090710024A","volume":"7","author":"RA Abbaspour","year":"2010","unstructured":"Abbaspour, R.A., Samadzadegan, F.: An evolutionary solution for multimodal shortest path problem in metropolises. Comput. Sci. Inf. Syst. 7(4), 789\u2013811 (2010)","journal-title":"Comput. Sci. Inf. Syst."},{"issue":"6","key":"3_CR4","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/TEVC.2002.804323","volume":"6","author":"CW Ahn","year":"2002","unstructured":"Ahn, C.W., Ramakrishna, R.S.: A genetic algorithm for shortest path routing problem and the sizing of populations. IEEE Trans. Evol. Comput. 6(6), 566\u2013579 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6(2), 154\u2013160 (1994)","journal-title":"ORSA J. Comput."},{"issue":"12","key":"3_CR6","doi-asserted-by":"publisher","first-page":"3524","DOI":"10.1109\/TITS.2016.2587619","volume":"17","author":"J Chen","year":"2016","unstructured":"Chen, J., et al.: Toward a more realistic, cost-effective, and greener ground movement through active routing: a multiobjective shortest path approach. IEEE Trans. Intell. Transp. Syst. 17(12), 3524\u20133540 (2016)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"1","key":"3_CR7","doi-asserted-by":"publisher","first-page":"1518","DOI":"10.1016\/j.eswa.2011.08.044","volume":"39","author":"C Chitra","year":"2012","unstructured":"Chitra, C., Subbaraj, P.: A nondominated sorting genetic algorithm solution for shortest path routing problem in computer networks. Expert Syst. Appl. 39(1), 1518\u20131525 (2012)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"3_CR8","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":"2","key":"3_CR9","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.ejor.2015.11.034","volume":"251","author":"JF Ehmke","year":"2016","unstructured":"Ehmke, J.F., Campbell, A.M., Thomas, B.W.: Vehicle routing to minimize time-dependent emissions in urban areas. Eur. J. Oper. Res. 251(2), 478\u2013494 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR10","unstructured":"Fonseca, C.M., Knowles, J.D., Thiele, L., Zitzler, E.: A tutorial on the performance assessment of stochastic multiobjective optimizers. In: Third International Conference on Evolutionary Multi-Criterion Optimization (EMO 2005), vol. 216, p. 240 (2005)"},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ejor.2009.10.002","volume":"204","author":"T Garaix","year":"2010","unstructured":"Garaix, T., Artigues, C., Feillet, D., Josselin, D.: Vehicle routing problems with alternative paths: an application to on-demand transportation. Eur. J. Oper. Res. 204(1), 62\u201375 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s00291-005-0029-9","volume":"28","author":"M Gen","year":"2006","unstructured":"Gen, M., Altiparmak, F., Lin, L.: A genetic algorithm for two-stage transportation problem using priority-based encoding. OR Spectr. 28(3), 337\u2013354 (2006)","journal-title":"OR Spectr."},{"key":"3_CR13","unstructured":"Gen, M., Cheng, R., Wang, D.: Genetic algorithms for solving shortest path problems. In: Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC 1997), pp. 401\u2013406. IEEE (1997)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Gen, M., Lin, L.: A new approach for shortest path routing problem by random key-based GA. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 1411\u20131412. ACM (2006)","DOI":"10.1145\/1143997.1144220"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1080\/15472450.2014.941759","volume":"19","author":"J Hrn\u010d\u00ed\u0159","year":"2015","unstructured":"Hrn\u010d\u00ed\u0159, J., Rovatsos, M., Jakob, M.: Ridesharing on timetabled transport services: a multiagent planning approach. J. Intell. Transp. Syst. 19(1), 89\u2013105 (2015)","journal-title":"J. Intell. Transp. Syst."},{"key":"3_CR16","unstructured":"Inagaki, J., Haseyama, M., Kitajima, H.: A genetic algorithm for determining multiple routes and its applications. In: ISCAS 1999, Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No. 99CH36349), vol. 6, pp. 137\u2013140. IEEE (1999)"},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1016\/j.eswa.2010.07.064","volume":"38","author":"Z Ji","year":"2011","unstructured":"Ji, Z., Kim, Y.S., Chen, A.: Multi-objective $$\\alpha $$-reliable path finding in stochastic networks with correlated link costs: a simulation-based multi-objective genetic algorithm approach (SMOGA). Expert Syst. Appl. 38(3), 1515\u20131528 (2011)","journal-title":"Expert Syst. Appl."},{"issue":"6","key":"3_CR18","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1080\/13658816.2012.737921","volume":"27","author":"R Li","year":"2013","unstructured":"Li, R., Leung, Y., Huang, B., Lin, H.: A genetic algorithm for multiobjective dangerous goods route planning. Int. J. Geogr. Inf. Sci. 27(6), 1073\u20131089 (2013)","journal-title":"Int. J. Geogr. Inf. Sci."},{"issue":"3","key":"3_CR19","first-page":"416","volume":"128","author":"L Lin","year":"2008","unstructured":"Lin, L., Gen, M.: An effective evolutionary approach for bicriteria shortest path routing problems. IEEJ Trans. Electron. Inf. Syst. 128(3), 416\u2013423 (2008)","journal-title":"IEEJ Trans. Electron. Inf. Syst."},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-540-95978-6_7","volume-title":"Intelligent and Evolutionary Systems","author":"L Lin","year":"2009","unstructured":"Lin, L., Gen, M.: Priority-based genetic algorithm for shortest path routing problem in OSPF. In: Gen, M., et al. (eds.) Intelligent and Evolutionary Systems, pp. 91\u2013103. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-95978-6_7"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-16111-7_27","volume-title":"KI 2010: Advances in Artificial Intelligence","author":"E Machuca","year":"2010","unstructured":"Machuca, E., Mandow, L., de la Cruz, J.L.P., Ruiz-Sepulveda, A.: An empirical comparison of some multiobjective graph search algorithms. In: Dillmann, R., Beyerer, J., Hanebeck, U.D., Schultz, T. (eds.) KI 2010. LNCS (LNAI), vol. 6359, pp. 238\u2013245. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16111-7_27"},{"key":"3_CR22","unstructured":"Mandow, L., De la Cruz, J.P., et al.: A new approach to multiobjective A* search. In: IJCAI, vol. 8. Citeseer (2005)"},{"issue":"4","key":"3_CR23","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1016\/j.asoc.2008.01.002","volume":"8","author":"AW Mohemmed","year":"2008","unstructured":"Mohemmed, A.W., Sahoo, N.C., Geok, T.K.: Solving shortest path problem using particle swarm optimization. Appl. Soft Comput. 8(4), 1643\u20131653 (2008)","journal-title":"Appl. Soft Comput."},{"key":"3_CR24","unstructured":"Munetomo, M., Takai, Y., Sato, Y.: An adaptive network routing algorithm employing path genetic operators. In: ICGA (1997)"},{"issue":"3","key":"3_CR25","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1016\/j.ejor.2015.09.009","volume":"248","author":"J Qian","year":"2016","unstructured":"Qian, J., Eglese, R.: Fuel emissions optimization in vehicle routing problems with time-varying speeds. Eur. J. Oper. Res. 248(3), 840\u2013848 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"3_CR26","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/49.12889","volume":"6","author":"BM Waxman","year":"1988","unstructured":"Waxman, B.M.: Routing of multipoint connections. IEEE J. Sel. Areas Commun. 6(9), 1617\u20131622 (1988)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"3_CR27","first-page":"343","volume":"193","author":"H Yu","year":"2012","unstructured":"Yu, H., Lu, F.: A multi-modal route planning approach with an improved genetic algorithm. Adv. Geo-Spat. Inf. Sci. 193, 343\u2013348 (2012)","journal-title":"Adv. Geo-Spat. Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43680-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T19:03:19Z","timestamp":1614884599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43680-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030436797","9783030436803"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43680-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seville","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2020\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37","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":"14","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":"38% - 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.68","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.88","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)"}},{"value":"The conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}