{"id":"https://openalex.org/W4385188301","doi":"https://doi.org/10.1145/3583133.3596423","title":"Graph Q-learning Assisted Ant Colony Optimization for Vehicle Routing Problems with Time Windows","display_name":"Graph Q-learning Assisted Ant Colony Optimization for Vehicle Routing Problems with Time Windows","publication_year":2023,"publication_date":"2023-07-15","ids":{"openalex":"https://openalex.org/W4385188301","doi":"https://doi.org/10.1145/3583133.3596423"},"language":"en","primary_location":{"id":"doi:10.1145/3583133.3596423","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583133.3596423","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583133.3596423","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":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3583133.3596423","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101900645","display_name":"Peng Yue","orcid":"https://orcid.org/0000-0003-0200-2416"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Peng Yue","raw_affiliation_strings":["Northeastern University, Liaoning, China"],"raw_orcid":"https://orcid.org/0000-0003-0200-2416","affiliations":[{"raw_affiliation_string":"Northeastern University, Liaoning, China","institution_ids":["https://openalex.org/I9224756"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101653069","display_name":"Shiqing Liu","orcid":"https://orcid.org/0000-0002-9657-1726"},"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":"Shiqing Liu","raw_affiliation_strings":["Bielefeld University, Bielefeld, Germany"],"raw_orcid":"https://orcid.org/0000-0002-9657-1726","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":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5345,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.81313175,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"7","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987000226974487,"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.9987000226974487,"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.9800000190734863,"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/T11106","display_name":"Data Management and Algorithms","score":0.9743000268936157,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.840368390083313},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7067283391952515},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7020851969718933},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6453388333320618},{"id":"https://openalex.org/keywords/hyperparameter","display_name":"Hyperparameter","score":0.6389604210853577},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5489197969436646},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.519071638584137},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5155653953552246},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.514998197555542},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.511812150478363},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5057072639465332},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4898469150066376},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.42490434646606445},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.4117595851421356},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.32171905040740967},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21522489190101624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17492571473121643},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16667646169662476}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.840368390083313},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7067283391952515},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7020851969718933},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6453388333320618},{"id":"https://openalex.org/C8642999","wikidata":"https://www.wikidata.org/wiki/Q4171168","display_name":"Hyperparameter","level":2,"score":0.6389604210853577},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5489197969436646},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.519071638584137},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5155653953552246},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.514998197555542},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.511812150478363},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5057072639465332},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4898469150066376},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.42490434646606445},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4117595851421356},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.32171905040740967},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21522489190101624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17492571473121643},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16667646169662476},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3583133.3596423","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583133.3596423","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583133.3596423","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":{"id":"doi:10.1145/3583133.3596423","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583133.3596423","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583133.3596423","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4385188301.pdf","grobid_xml":"https://content.openalex.org/works/W4385188301.grobid-xml"},"referenced_works_count":6,"referenced_works":["https://openalex.org/W2107941094","https://openalex.org/W2154929945","https://openalex.org/W2907492528","https://openalex.org/W3170112077","https://openalex.org/W3182492747","https://openalex.org/W4323643744"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W1997193297","https://openalex.org/W4245157707","https://openalex.org/W2908391583","https://openalex.org/W2017411971","https://openalex.org/W2369428395","https://openalex.org/W2172069777","https://openalex.org/W2981400081","https://openalex.org/W2956620057","https://openalex.org/W2384341213"],"abstract_inverted_index":{"Vehicle":[0],"routing":[1],"problem":[2],"with":[3,33],"time":[4,34],"windows":[5],"(VRPTW)":[6],"is":[7,39],"a":[8,24,28,45,99,146],"typical":[9],"class":[10],"of":[11,19,31,47,134,141,162],"constrained":[12],"path":[13],"planning":[14],"problems":[15],"in":[16,75,81],"the":[17,37,52,124,139,160,166],"field":[18],"combinatorial":[20],"optimization.":[21],"VRPTW":[22],"considers":[23],"delivery":[25],"task":[26],"for":[27,44],"given":[29],"set":[30],"customers":[32],"windows,":[35],"and":[36,73,153],"target":[38],"to":[40,71,87,109,113,137],"find":[41],"optimal":[42],"routes":[43],"group":[46],"vehicles":[48],"that":[49],"can":[50,157],"minimize":[51],"total":[53],"transportation":[54],"cost.":[55],"The":[56],"traditional":[57],"heuristics":[58],"suffer":[59],"from":[60],"several":[61],"limitations":[62],"when":[63],"solving":[64],"VRPTW,":[65],"such":[66],"as":[67],"poor":[68],"scalability,":[69],"sensitivity":[70],"hyperparameters":[72,140,161],"difficulty":[74],"handling":[76],"complex":[77],"constraints.":[78],"Recent":[79],"advance":[80],"machine":[82],"learning":[83],"makes":[84],"it":[85],"possible":[86],"enhance":[88],"heuristic":[89,126],"approaches":[90],"via":[91],"learned":[92,125],"knowledge.":[93],"In":[94],"this":[95],"paper,":[96],"we":[97,144],"propose":[98],"graph":[100,130],"Q-learning":[101,154],"assisted":[102],"ant":[103,115],"colony":[104,116],"optimization":[105,117],"algorithm":[106],"named":[107],"GQL-ACO":[108],"solve":[110],"VRPTW.":[111],"Compared":[112],"vanilla":[114],"(ACO),":[118],"our":[119],"proposed":[120],"method":[121],"first":[122],"employs":[123],"values":[127],"by":[128,150],"using":[129],"Q":[131],"learning,":[132],"instead":[133],"handcrafted":[135],"ones,":[136],"define":[138],"ACO.":[142],"Second,":[143],"design":[145],"collaborative":[147],"search":[148,167],"strategy":[149],"combining":[151],"ACO":[152,163],"effectively,":[155],"which":[156],"adaptively":[158],"adjust":[159],"based":[164],"on":[165],"experiences.":[168]},"counts_by_year":[{"year":2024,"cited_by_count":3}],"updated_date":"2026-08-24T07:32:12.397491","created_date":"2025-10-10T00:00:00"}