{"id":"https://openalex.org/W4385188767","doi":"https://doi.org/10.1145/3583133.3596424","title":"An Ant Colony Algorithm Assisted by Graph Neural Networks for Solving Vehicle Routing Problems","display_name":"An Ant Colony Algorithm Assisted by Graph Neural Networks for Solving Vehicle Routing Problems","publication_year":2023,"publication_date":"2023-07-15","ids":{"openalex":"https://openalex.org/W4385188767","doi":"https://doi.org/10.1145/3583133.3596424"},"language":"en","primary_location":{"id":"doi:10.1145/3583133.3596424","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583133.3596424","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},"type":"conference-paper","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/A5100369978","display_name":"Xiangyu Wang","orcid":"https://orcid.org/0000-0002-1832-0905"},"institutions":[{"id":"https://openalex.org/I20121455","display_name":"Bielefeld University","ror":"https://ror.org/02hpadn98","country_code":"DE","type":"education","lineage":["https://openalex.org/I20121455"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Xiangyu Wang","raw_affiliation_strings":["Bielefeld University, Bielefeld, Germany"],"raw_orcid":"https://orcid.org/0000-0002-1832-0905","affiliations":[{"raw_affiliation_string":"Bielefeld University, Bielefeld, Germany","institution_ids":["https://openalex.org/I20121455"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032314861","display_name":"Yaochu Jin","orcid":"https://orcid.org/0000-0003-1100-0631"},"institutions":[{"id":"https://openalex.org/I20121455","display_name":"Bielefeld University","ror":"https://ror.org/02hpadn98","country_code":"DE","type":"education","lineage":["https://openalex.org/I20121455"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Yaochu Jin","raw_affiliation_strings":["Bielefeld University, Bielefeld, Germany"],"raw_orcid":"https://orcid.org/0000-0003-1100-0631","affiliations":[{"raw_affiliation_string":"Bielefeld University, Bielefeld, Germany","institution_ids":["https://openalex.org/I20121455"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I20121455"],"apc_list":null,"apc_paid":null,"fwci":2.0355,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.86471457,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"5","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9955000281333923,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9955000281333923,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9837999939918518,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8515716791152954},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.7390727400779724},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6479679346084595},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6382147669792175},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.6077211499214172},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5323159098625183},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5300393104553223},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.5038327574729919},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4667181372642517},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4647483229637146},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4159148633480072},{"id":"https://openalex.org/keywords/ant","display_name":"ANT","score":0.4118790030479431},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34033337235450745},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.17724955081939697},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16699716448783875},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09184947609901428}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8515716791152954},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.7390727400779724},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6479679346084595},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6382147669792175},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.6077211499214172},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5323159098625183},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5300393104553223},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.5038327574729919},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4667181372642517},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4647483229637146},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4159148633480072},{"id":"https://openalex.org/C97467695","wikidata":"https://www.wikidata.org/wiki/Q295802","display_name":"ANT","level":2,"score":0.4118790030479431},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34033337235450745},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17724955081939697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16699716448783875},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09184947609901428},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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.1145/3583133.3596424","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583133.3596424","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.4300000071525574,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2154929945","https://openalex.org/W3182492747","https://openalex.org/W4211209519","https://openalex.org/W4302561932","https://openalex.org/W4312779634","https://openalex.org/W6748856961"],"related_works":["https://openalex.org/W1521114792","https://openalex.org/W2096518017","https://openalex.org/W2585908733","https://openalex.org/W4380761599","https://openalex.org/W2376174742","https://openalex.org/W972901047","https://openalex.org/W1993457592","https://openalex.org/W2590063588","https://openalex.org/W4213302123","https://openalex.org/W1597031259"],"abstract_inverted_index":{"Vehicle":[0],"routing":[1,49],"problems":[2],"have":[3],"attracted":[4],"increasing":[5],"attention":[6],"because":[7],"of":[8,12,24,70,122],"the":[9,18,22,27,61,74,94,97,104,118,123],"rapid":[10],"development":[11],"transportation.":[13],"Companies":[14],"want":[15],"to":[16,60,88,92,116],"reduce":[17],"cost":[19],"by":[20],"lowering":[21],"number":[23],"vehicles":[25],"and":[26,120],"total":[28],"distances,":[29],"which":[30,65,101],"can":[31,102],"be":[32],"considered":[33],"as":[34],"a":[35,55,68,82],"combinatorial":[36],"optimization":[37],"problem.":[38],"The":[39],"ant":[40,98],"colony":[41,99],"algorithm":[42],"shows":[43],"great":[44],"potential":[45],"in":[46,73,96],"solving":[47],"vehicle":[48],"problems.":[50],"However,":[51],"it":[52],"suffers":[53],"from":[54],"low":[56],"convergence":[57,105],"speed":[58],"due":[59],"randomly":[62],"initialized":[63],"pheromone,":[64],"may":[66],"cause":[67],"waste":[69],"computational":[71],"resources":[72],"early":[75],"search":[76],"process.":[77,106,125],"To":[78],"address":[79],"this":[80],"problem,":[81],"graph":[83],"neural":[84],"network":[85],"is":[86],"pre-trained":[87],"provide":[89],"prior":[90],"knowledge":[91],"initialize":[93],"pheromone":[95],"algorithm,":[100],"boost":[103],"In":[107],"addition,":[108],"some":[109],"classic":[110],"local":[111],"research":[112],"methods":[113],"are":[114],"applied":[115],"balance":[117],"exploration":[119],"exploitation":[121],"evolutionary":[124]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}