{"id":"https://openalex.org/W4416768256","doi":"https://doi.org/10.34133/icomputing.0245","title":"Density-Guided Ant Colony Optimization Algorithm for Dynamic Vehicle Routing Problems","display_name":"Density-Guided Ant Colony Optimization Algorithm for Dynamic Vehicle Routing Problems","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4416768256","doi":"https://doi.org/10.34133/icomputing.0245"},"language":"en","primary_location":{"id":"doi:10.34133/icomputing.0245","is_oa":true,"landing_page_url":"https://doi.org/10.34133/icomputing.0245","pdf_url":null,"source":{"id":"https://openalex.org/S4387281904","display_name":"Intelligent Computing","issn_l":"2771-5892","issn":["2771-5892"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Intelligent Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.34133/icomputing.0245","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089231151","display_name":"Junfeng Chen","orcid":"https://orcid.org/0000-0002-3642-007X"},"institutions":[{"id":"https://openalex.org/I163340411","display_name":"Hohai University","ror":"https://ror.org/01wd4xt90","country_code":"CN","type":"education","lineage":["https://openalex.org/I163340411"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Junfeng Chen","raw_affiliation_strings":["College of Artificial Intelligence and Automation, \rHohai University, Changzhou, China","CHINA"],"raw_orcid":"https://orcid.org/0000-0002-3642-007X","affiliations":[{"raw_affiliation_string":"College of Artificial Intelligence and Automation, \rHohai University, Changzhou, China","institution_ids":["https://openalex.org/I163340411"]},{"raw_affiliation_string":"CHINA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102930883","display_name":"Yuqi Lu","orcid":"https://orcid.org/0000-0002-4913-2173"},"institutions":[{"id":"https://openalex.org/I163340411","display_name":"Hohai University","ror":"https://ror.org/01wd4xt90","country_code":"CN","type":"education","lineage":["https://openalex.org/I163340411"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuqi Lu","raw_affiliation_strings":["College of Artificial Intelligence and Automation, \rHohai University, Changzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Artificial Intelligence and Automation, \rHohai University, Changzhou, China","institution_ids":["https://openalex.org/I163340411"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I163340411"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.43166908,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.670199990272522,"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.670199990272522,"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.15800000727176666,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.018200000748038292,"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/initialization","display_name":"Initialization","score":0.664900004863739},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6615999937057495},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6166999936103821},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5537999868392944},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.546500027179718},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4480000138282776},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.445499986410141},{"id":"https://openalex.org/keywords/baseline","display_name":"Baseline (sea)","score":0.42089998722076416}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6769999861717224},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.664900004863739},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6615999937057495},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6166999936103821},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5558000206947327},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5537999868392944},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.546500027179718},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4480000138282776},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.445499986410141},{"id":"https://openalex.org/C12725497","wikidata":"https://www.wikidata.org/wiki/Q810247","display_name":"Baseline (sea)","level":2,"score":0.42089998722076416},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.399399995803833},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3952000141143799},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.38350000977516174},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.3831000030040741},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34049999713897705},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.321399986743927},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.3127000033855438},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.30660000443458557},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.2969000041484833},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.28700000047683716},{"id":"https://openalex.org/C47796450","wikidata":"https://www.wikidata.org/wiki/Q508378","display_name":"Intelligent transportation system","level":2,"score":0.2824000120162964},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.26159998774528503},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.2522999942302704},{"id":"https://openalex.org/C58758708","wikidata":"https://www.wikidata.org/wiki/Q7240233","display_name":"Premature convergence","level":3,"score":0.25060001015663147}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.34133/icomputing.0245","is_oa":true,"landing_page_url":"https://doi.org/10.34133/icomputing.0245","pdf_url":null,"source":{"id":"https://openalex.org/S4387281904","display_name":"Intelligent Computing","issn_l":"2771-5892","issn":["2771-5892"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Intelligent Computing","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:ec977421053f4a15952e72764d5c5353","is_oa":true,"landing_page_url":"https://doaj.org/article/ec977421053f4a15952e72764d5c5353","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Intelligent Computing, Vol 4 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.34133/icomputing.0245","is_oa":true,"landing_page_url":"https://doi.org/10.34133/icomputing.0245","pdf_url":null,"source":{"id":"https://openalex.org/S4387281904","display_name":"Intelligent Computing","issn_l":"2771-5892","issn":["2771-5892"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Intelligent Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1136684380","https://openalex.org/W1982405185","https://openalex.org/W2024060531","https://openalex.org/W2031236641","https://openalex.org/W2050403199","https://openalex.org/W2111563176","https://openalex.org/W2112653202","https://openalex.org/W2114844199","https://openalex.org/W2137849348","https://openalex.org/W2167920923","https://openalex.org/W2170436854","https://openalex.org/W2341256628","https://openalex.org/W2612255098","https://openalex.org/W2725780652","https://openalex.org/W2924354689","https://openalex.org/W2943528199","https://openalex.org/W4246598646"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,28,40,75],"density-guided":[4,123],"ant":[5],"colony":[6],"optimization":[7,124],"(DG-ACO)":[8],"algorithm":[9,26,44],"to":[10,34,52,82,101],"address":[11],"dynamic":[12,22,71,76],"vehicle":[13],"routing":[14],"problems":[15],"(DVRPs)":[16],"involving":[17],"real-time":[18,83,131],"traffic":[19,31,84],"fluctuations":[20],"and":[21,49,56,74,108,125,133],"customer":[23],"demands.":[24],"The":[25,117],"integrates":[27],"grid-based":[29],"spatiotemporal":[30],"density":[32],"matrix":[33],"guide":[35],"path":[36,106],"exploration,":[37],"along":[38],"with":[39],"hybrid":[41],"population":[42],"initialization":[43],"that":[45,80,94],"combines":[46],"uniform":[47],"sampling":[48],"density-prioritized":[50],"seeding":[51],"enhance":[53],"convergence":[54],"speed":[55],"solution":[57],"diversity.":[58],"To":[59],"further":[60],"improve":[61],"adaptability,":[62],"we":[63],"introduce":[64],"an":[65,109],"adaptive":[66],"large":[67],"neighborhood":[68],"search":[69],"for":[70,130],"request":[72],"handling":[73],"pheromone":[77],"update":[78],"mechanism":[79],"adjusts":[81],"conditions.":[85],"Extensive":[86],"experiments":[87],"on":[88],"9":[89],"benchmark":[90],"DVRP":[91],"instances":[92],"demonstrate":[93],"DG-ACO":[95],"outperforms":[96],"baseline":[97],"algorithms,":[98],"achieving":[99],"up":[100],"26.7%":[102],"reduction":[103],"in":[104,114],"optimal":[105],"length":[107],"average":[110],"of":[111,122],"18.2%":[112],"improvement":[113],"computational":[115],"efficiency.":[116],"results":[118],"validate":[119],"the":[120,127],"effectiveness":[121],"highlight":[126],"algorithm\u2019s":[128],"potential":[129],"logistics":[132],"intelligent":[134],"transportation":[135],"systems.":[136]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-11-11T00:00:00"}