{"id":"https://openalex.org/W2360167953","doi":null,"title":"Improved ant colony algorithm for solving vehicle routing problem with time windows","display_name":"Improved ant colony algorithm for solving vehicle routing problem with time windows","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2360167953","mag":"2360167953"},"language":"en","primary_location":{"id":"mag:2360167953","doi":null,"is_oa":false,"landing_page_url":"https://en.cnki.com.cn/Article_en/CJFDTOTAL-KZYC201009021.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764380666","display_name":"Kongzhi yu juece","issn_l":"1001-0920","issn":["1001-0920"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","poland-40","russia-white-list-3"],"host_organization":"https://openalex.org/P4320800596","host_organization_name":"Northeastern University","host_organization_lineage":["https://openalex.org/P4320800596"],"host_organization_lineage_names":["Northeastern University"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Kongzhi yu juece","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5060664084","display_name":"Jiafu Tang","orcid":"https://orcid.org/0000-0002-0745-318X","observed_orcids":["https://orcid.org/0000-0002-0745-318X"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jiafu Tang","raw_affiliation_strings":["1a"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"1a","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5060664084"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7662,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.7772874,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":93},"biblio":{"volume":null,"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.9976000189781189,"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.9976000189781189,"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.002300000051036477,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vehicle-routing-problem-with-time-windows","display_name":"vehicle routing problem with time windows","score":0.9269999861717224},{"id":"https://openalex.org/keywords/ant-colony-optimization","display_name":"ant colony optimization","score":0.7910000085830688},{"id":"https://openalex.org/keywords/ant-colony-system","display_name":"ant colony system","score":0.9390000104904175},{"id":"https://openalex.org/keywords/max-min-ant-system","display_name":"Max-Min Ant System","score":0.996999979019165},{"id":"https://openalex.org/keywords/pheromone-evaporation","display_name":"pheromone evaporation","score":0.8100000023841858},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.8989999890327454},{"id":"https://openalex.org/keywords/local-optima-avoidance","display_name":"local optima avoidance","score":0.7080000042915344},{"id":"https://openalex.org/keywords/service-waiting-time","display_name":"service waiting time","score":0.7049999833106995}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7769436836242676},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.648379385471344},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6198000907897949},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5900428295135498},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5842635035514832},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5656567811965942},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5612680912017822},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5380430221557617},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.32977166771888733},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21901583671569824},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2360167953","doi":null,"is_oa":false,"landing_page_url":"https://en.cnki.com.cn/Article_en/CJFDTOTAL-KZYC201009021.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764380666","display_name":"Kongzhi yu juece","issn_l":"1001-0920","issn":["1001-0920"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","poland-40","russia-white-list-3"],"host_organization":"https://openalex.org/P4320800596","host_organization_name":"Northeastern University","host_organization_lineage":["https://openalex.org/P4320800596"],"host_organization_lineage_names":["Northeastern University"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Kongzhi yu juece","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2382902764","https://openalex.org/W2378264567","https://openalex.org/W3004657291","https://openalex.org/W2168068780","https://openalex.org/W2372558217","https://openalex.org/W2380896805","https://openalex.org/W2383926906","https://openalex.org/W7095444831","https://openalex.org/W2888676721","https://openalex.org/W6922194140"],"abstract_inverted_index":{"An":[0],"improved":[1],"ant":[2,11,17],"colony":[3,12],"algorithm":[4,9,42,90,95,99],"is":[5,58,68,91],"designed.":[6],"The":[7],"given":[8],"combines":[10],"system":[13,18],"(ACS)":[14],"and":[15,20,28,65,96,105],"max-min":[16],"(MMAS),":[19],"introduces":[21],"the":[22,41,78,89],"factors":[23],"of":[24,102],"time":[25,30],"windows":[26],"width":[27],"waiting":[29],"for":[31],"service":[32],"into":[33,44],"state":[34],"transfer":[35],"rules.":[36],"In":[37],"order":[38],"to":[39,76],"avoid":[40],"trapping":[43],"local":[45],"optimum,":[46],"different":[47,54],"pheromone":[48],"evaporating":[49],"rules":[50],"are":[51,74],"used":[52,75],"under":[53],"stages.":[55],"2-opt":[56],"which":[57,67],"an":[59,69],"intra-optimizing":[60],"method":[61,71],"in":[62],"a":[63],"road":[64],"2-opt*":[66],"inter-optimizing":[70],"between":[72],"roads":[73],"improve":[77],"optimizing":[79],"solution":[80],"received":[81],"from":[82],"each":[83],"iteration.":[84],"Experiment":[85],"results":[86],"show":[87],"that":[88],"better":[92],"than":[93],"genetic":[94],"Tabu":[97],"search":[98],"on":[100],"aspects":[101],"solving":[103],"effects":[104],"operation":[106],"effectiveness.":[107]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2016-06-24T00:00:00"}