{"id":"https://openalex.org/W3150458138","doi":"https://doi.org/10.1007/s42979-021-00512-z","title":"A Comparison of Genetic Representations and Initialisation Methods for the Multi-objective Shortest Path Problem on Multigraphs","display_name":"A Comparison of Genetic Representations and Initialisation Methods for the Multi-objective Shortest Path Problem on Multigraphs","publication_year":2021,"publication_date":"2021-03-30","ids":{"openalex":"https://openalex.org/W3150458138","doi":"https://doi.org/10.1007/s42979-021-00512-z","mag":"3150458138"},"language":"en","primary_location":{"id":"doi:10.1007/s42979-021-00512-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s42979-021-00512-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s42979-021-00512-z.pdf","source":{"id":"https://openalex.org/S4210174798","display_name":"SN Computer Science","issn_l":"2661-8907","issn":["2661-8907","2662-995X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SN Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s42979-021-00512-z.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086223393","display_name":"Lilla Beke","orcid":"https://orcid.org/0000-0002-1284-1080"},"institutions":[{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Lilla Beke","raw_affiliation_strings":["School of Engineering and Materials Science, Queen Mary of London, London, UK"],"raw_orcid":"https://orcid.org/0000-0002-1284-1080","affiliations":[{"raw_affiliation_string":"School of Engineering and Materials Science, Queen Mary of London, London, UK","institution_ids":["https://openalex.org/I166337079"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078769590","display_name":"Michal Weiszer","orcid":"https://orcid.org/0000-0003-3513-5792"},"institutions":[{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Michal Weiszer","raw_affiliation_strings":["School of Engineering and Materials Science, Queen Mary of London, London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Engineering and Materials Science, Queen Mary of London, London, UK","institution_ids":["https://openalex.org/I166337079"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076006482","display_name":"Jun Chen","orcid":"https://orcid.org/0000-0003-2360-3712"},"institutions":[{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jun Chen","raw_affiliation_strings":["School of Engineering and Materials Science, Queen Mary of London, London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Engineering and Materials Science, Queen Mary of London, London, UK","institution_ids":["https://openalex.org/I166337079"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5086223393"],"corresponding_institution_ids":["https://openalex.org/I166337079"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":1.8145,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.85678435,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"2","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9909999966621399,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multigraph","display_name":"Multigraph","score":0.9077526926994324},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6463209390640259},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6029648780822754},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6023837327957153},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5284329056739807},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4902689754962921},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.474056214094162},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43146276473999023},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.41717642545700073},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4116542637348175},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34829244017601013},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.29407382011413574},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27916419506073}],"concepts":[{"id":"https://openalex.org/C17758045","wikidata":"https://www.wikidata.org/wiki/Q2642629","display_name":"Multigraph","level":3,"score":0.9077526926994324},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6463209390640259},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6029648780822754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6023837327957153},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5284329056739807},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4902689754962921},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.474056214094162},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43146276473999023},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.41717642545700073},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4116542637348175},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34829244017601013},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29407382011413574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27916419506073},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s42979-021-00512-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s42979-021-00512-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s42979-021-00512-z.pdf","source":{"id":"https://openalex.org/S4210174798","display_name":"SN Computer Science","issn_l":"2661-8907","issn":["2661-8907","2662-995X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SN Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s42979-021-00512-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s42979-021-00512-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s42979-021-00512-z.pdf","source":{"id":"https://openalex.org/S4210174798","display_name":"SN Computer Science","issn_l":"2661-8907","issn":["2661-8907","2662-995X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SN Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.7699999809265137,"id":"https://metadata.un.org/sdg/7"}],"awards":[{"id":"https://openalex.org/G3864502123","display_name":"TRANSIT: Towards a Robust Airport Decision Support System for Intelligent Taxiing","funder_award_id":"EP/N029496/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G4035636879","display_name":"TRANSIT: Towards a Robust Airport Decision Support System for Intelligent Taxiing","funder_award_id":"EP/N029356/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G4901359581","display_name":"TRANSIT: Towards a Robust Airport Decision Support System for Intelligent Taxiing","funder_award_id":"EP/N029577/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G5121952071","display_name":null,"funder_award_id":"EP/N029577/2","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G5657975588","display_name":null,"funder_award_id":"EP/N029496/2","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G5858133855","display_name":null,"funder_award_id":"EP/N029496/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G619975666","display_name":"TRANSIT: Towards a Robust Airport Decision Support System for Intelligent Taxiing","funder_award_id":"EP/N029577/2","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6661111950","display_name":null,"funder_award_id":"EP/N029356/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6668216983","display_name":null,"funder_award_id":"EP/N029577/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3150458138.pdf","grobid_xml":"https://content.openalex.org/works/W3150458138.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W128059956","https://openalex.org/W202911434","https://openalex.org/W1513540105","https://openalex.org/W1574989942","https://openalex.org/W1826740954","https://openalex.org/W1875948141","https://openalex.org/W1889956542","https://openalex.org/W1964005729","https://openalex.org/W1964880423","https://openalex.org/W1970166004","https://openalex.org/W1978381746","https://openalex.org/W1982148434","https://openalex.org/W1985891092","https://openalex.org/W1988829186","https://openalex.org/W1998062665","https://openalex.org/W2004617458","https://openalex.org/W2007204663","https://openalex.org/W2011609932","https://openalex.org/W2016612645","https://openalex.org/W2024688851","https://openalex.org/W2039568841","https://openalex.org/W2059317120","https://openalex.org/W2071140440","https://openalex.org/W2085041447","https://openalex.org/W2105808107","https://openalex.org/W2117473144","https://openalex.org/W2119926658","https://openalex.org/W2126105956","https://openalex.org/W2141119792","https://openalex.org/W2151779407","https://openalex.org/W2168079536","https://openalex.org/W2190592067","https://openalex.org/W2192308205","https://openalex.org/W2341449573","https://openalex.org/W2427371368","https://openalex.org/W3015273457","https://openalex.org/W3208470237","https://openalex.org/W4230806782"],"related_works":["https://openalex.org/W2964122414","https://openalex.org/W2781078086","https://openalex.org/W2914213999","https://openalex.org/W2114952748","https://openalex.org/W2604238334","https://openalex.org/W2380420450","https://openalex.org/W2059954821","https://openalex.org/W1983162902","https://openalex.org/W1549308032","https://openalex.org/W176042955"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"compares":[3],"different":[4,25],"solution":[5,85,145],"approaches":[6],"for":[7,30,111,213],"the":[8,78,96,112,126,132,138,143,156,160,183,217],"multi-objective":[9],"shortest":[10],"path":[11],"problem":[12,171],"(MSPP)":[13],"on":[14,166],"multigraphs.":[15],"Multigraphs":[16],"as":[17,59],"a":[18,31,35,92,101,167],"modelling":[19,45],"tool":[20],"are":[21,41,87,151,211],"able":[22],"to":[23,90,125,137,154,197,206,216],"capture":[24],"available":[26],"trade-offs":[27],"between":[28],"objectives":[29,51],"given":[32,102],"section":[33],"of":[34,95,122,159,170],"route.":[36],"For":[37],"this":[38],"reason,":[39],"they":[40],"increasingly":[42],"popular":[43,134],"in":[44,100,192],"transportation":[46,64],"problems":[47],"with":[48,186],"multiple":[49],"conflicting":[50],"(e.g.,":[52],"travel":[53],"time":[54,103],"and":[55,68,141,176],"fuel":[56],"consumption),":[57],"such":[58],"time-dependent":[60],"vehicle":[61],"routing,":[62],"multi-modal":[63],"planning,":[65],"energy-efficient":[66],"driving,":[67],"airport":[69],"operations.":[70],"The":[71,162,201,209],"multigraph":[72,127,139,219],"MSPP":[73],"is":[74,164],"more":[75],"complex":[76],"than":[77],"NP-hard":[79],"simple":[80,113],"graph":[81,114],"MSPP.":[82,115,128,220],"Therefore,":[83],"approximate":[84],"methods":[86,150],"often":[88],"needed":[89],"find":[91],"good":[93,190],"approximation":[94],"true":[97],"Pareto":[98],"front":[99],"budget.":[104],"Evolutionary":[105],"algorithms":[106],"have":[107],"been":[108,119],"successfully":[109],"applied":[110],"However,":[116],"there":[117],"has":[118],"limited":[120],"investigation":[121],"their":[123],"applications":[124],"Here,":[129],"we":[130],"extend":[131],"most":[133],"genetic":[135],"representations":[136,202],"case":[140],"compare":[142],"achieved":[144],"qualities.":[146],"Two":[147],"heuristic":[148,187],"initialisation":[149,188],"also":[152],"considered":[153],"improve":[155],"convergence":[157],"properties":[158],"algorithms.":[161],"comparison":[163],"based":[165],"diverse":[168],"set":[169],"instances,":[172],"including":[173],"both":[174],"bi-objective":[175],"triple":[177],"objective":[178],"problems.":[179],"We":[180],"found":[181,205],"that":[182],"metaheuristic":[184],"approach":[185],"provides":[189],"solutions":[191],"shorter":[193],"running":[194],"times":[195],"compared":[196],"an":[198],"exact":[199],"algorithm.":[200],"were":[203],"all":[204],"be":[207],"competitive.":[208],"results":[210],"encouraging":[212],"future":[214],"application":[215],"time-constrained":[218]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4}],"updated_date":"2026-06-09T15:46:55.921056","created_date":"2025-10-10T00:00:00"}