{"id":"https://openalex.org/W4411600559","doi":"https://doi.org/10.1109/cec65147.2025.11042998","title":"Heuristic Initialisation based on Graph Structures for Shortest Path Search on Multi-objective Multigraphs","display_name":"Heuristic Initialisation based on Graph Structures for Shortest Path Search on Multi-objective Multigraphs","publication_year":2025,"publication_date":"2025-06-08","ids":{"openalex":"https://openalex.org/W4411600559","doi":"https://doi.org/10.1109/cec65147.2025.11042998"},"language":"en","primary_location":{"id":"doi:10.1109/cec65147.2025.11042998","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec65147.2025.11042998","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041983865","display_name":"Songwei Liu","orcid":"https://orcid.org/0000-0002-9892-0918"},"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":"Songwei Liu","raw_affiliation_strings":["University of London,School of Engineering and Materials Science Queen Mary,London,UK"],"affiliations":[{"raw_affiliation_string":"University of London,School of Engineering and Materials Science Queen Mary,London,UK","institution_ids":["https://openalex.org/I166337079"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086223393","display_name":"Lilla Beke","orcid":"https://orcid.org/0000-0002-1284-1080"},"institutions":[{"id":"https://openalex.org/I1332878012","display_name":"BT Group (United Kingdom)","ror":"https://ror.org/00kv9pj15","country_code":"GB","type":"company","lineage":["https://openalex.org/I1332878012"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Lilla Beke","raw_affiliation_strings":["Digital BT Group PLC,London,UK"],"affiliations":[{"raw_affiliation_string":"Digital BT Group PLC,London,UK","institution_ids":["https://openalex.org/I1332878012"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100450156","display_name":"Jun Chen","orcid":"https://orcid.org/0000-0001-9896-6898"},"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":["University of London,School of Engineering and Materials Science Queen Mary,London,UK"],"affiliations":[{"raw_affiliation_string":"University of London,School of Engineering and Materials Science Queen Mary,London,UK","institution_ids":["https://openalex.org/I166337079"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5041983865"],"corresponding_institution_ids":["https://openalex.org/I166337079"],"apc_list":null,"apc_paid":null,"fwci":1.561,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.83560091,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.983299970626831,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.983299970626831,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9688000082969666,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9659000039100647,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.6472325325012207},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6453659534454346},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5503715872764587},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5325547456741333},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5257980227470398},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43780824542045593},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4007427394390106},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3907589316368103},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27632901072502136},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.25370603799819946},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06419768929481506}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6472325325012207},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6453659534454346},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5503715872764587},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5325547456741333},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5257980227470398},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43780824542045593},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4007427394390106},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3907589316368103},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27632901072502136},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25370603799819946},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06419768929481506}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec65147.2025.11042998","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec65147.2025.11042998","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320006","display_name":"Royal Society","ror":"https://ror.org/03wnrjx87"},{"id":"https://openalex.org/F4320322725","display_name":"China Scholarship Council","ror":"https://ror.org/04atp4p48"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W224959492","https://openalex.org/W1543520236","https://openalex.org/W2015021106","https://openalex.org/W2085041447","https://openalex.org/W2126105956","https://openalex.org/W2141119792","https://openalex.org/W2169528473","https://openalex.org/W2588049758","https://openalex.org/W2962756421","https://openalex.org/W3015273457","https://openalex.org/W3150458138","https://openalex.org/W4294811594","https://openalex.org/W4318002264","https://openalex.org/W4364322662","https://openalex.org/W4387368532"],"related_works":["https://openalex.org/W3118505512","https://openalex.org/W2349797546","https://openalex.org/W191849398","https://openalex.org/W2359578922","https://openalex.org/W2767202586","https://openalex.org/W2996337372","https://openalex.org/W2018146256","https://openalex.org/W2376911392","https://openalex.org/W2388654557","https://openalex.org/W2198982833"],"abstract_inverted_index":{"This":[0],"paper":[1,122],"investigates":[2],"heuristic":[3,138,185],"initialisation":[4,28,140,187],"for":[5],"shortest":[6],"path":[7,21],"search":[8],"on":[9,165,169],"multi-objective":[10,171],"multigraphs":[11,172],"using":[12,75,161],"genetic":[13],"algorithms.":[14],"An":[15],"initialised":[16],"solution":[17,115],"comprises":[18],"a":[19,55,61,97,137,153],"node":[20,31,35,52,155,166,200,205],"and":[22,38,60,128,184,192,207,218],"an":[23],"edge":[24,139,186],"path.":[25],"The":[26,83],"state-of-the-art":[27,190,211],"method":[29,66,141,158],"encodes":[30],"paths":[32],"into":[33],"random-key":[34],"priority":[36,53,156],"sequences":[37],"assigns":[39],"random":[40,62,88,204],"values":[41,89],"to":[42,91,113,131,145,210],"represent":[43],"the":[44,51,87,125,132,147,189,198],"indices":[45],"of":[46,57,86,150],"traversed":[47],"parallel":[48],"edges,":[49],"where":[50],"is":[54,94,108,142,159],"combination":[56],"hop":[58,92,177],"count":[59],"value.":[63],"However,":[64],"this":[65,121],"has":[67],"three":[68],"limitations.":[69],"(i)":[70,175],"Hop":[71],"counts":[72,93,178],"are":[73,208],"computed":[74],"Dijkstra\u2019s":[76,151],"algorithm,":[77,152],"incurring":[78],"non-negligible":[79],"computational":[80,148],"cost.":[81],"(ii)":[82,193],"upper":[84],"bound":[85],"added":[90],"defined":[95],"by":[96],"hyperparameter,":[98],"requiring":[99],"tedious":[100],"parameter":[101],"tuning.":[102],"(iii)":[103],"Heuristic":[104],"information":[105],"about":[106],"edges":[107],"ignored,":[109],"despite":[110],"its":[111],"potential":[112,215],"improve":[114],"quality.":[116],"To":[117],"address":[118],"these":[119],"issues,":[120],"first":[123],"eliminates":[124],"randomisation":[126],"hyperparameter":[127],"constrains":[129],"randomness":[130,180],"range":[133],"[0,":[134,182],"1).":[135],"Second,":[136],"proposed.":[143],"Finally,":[144],"reduce":[146],"burden":[149],"learning-based":[154,199],"generation":[157],"devised":[160],"neural":[162],"networks":[163],"trained":[164],"embeddings.":[167],"Experiments":[168],"benchmark":[170],"show":[173],"that":[174],"combining":[176],"with":[179,194],"in":[181,216],"1)":[183],"outperforms":[188],"method,":[191],"limited":[195],"training":[196],"data,":[197],"priorities":[201,206],"surpass":[202],"entirely":[203],"comparable":[209],"performance,":[212],"highlighting":[213],"their":[214],"large-scale":[217],"dynamic":[219],"scenarios.":[220]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}