{"id":"https://openalex.org/W1550335796","doi":"https://doi.org/10.1007/978-3-540-85984-0_19","title":"A New Hybrid Ant Colony Optimization Algorithm for the Traveling Salesman Problem","display_name":"A New Hybrid Ant Colony Optimization Algorithm for the Traveling Salesman Problem","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1550335796","doi":"https://doi.org/10.1007/978-3-540-85984-0_19","mag":"1550335796"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-85984-0_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-85984-0_19","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5100670421","display_name":"Xiaoxia Zhang","orcid":"https://orcid.org/0000-0002-3515-5278"},"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":true,"raw_author_name":"Xiaoxia Zhang","raw_affiliation_strings":["The Logistics Institute, Northeastern University, Shenyang, China","The Logistics Institute, Northeastern University, Shenyang, China#TAB#"],"affiliations":[{"raw_affiliation_string":"The Logistics Institute, Northeastern University, Shenyang, China","institution_ids":["https://openalex.org/I9224756"]},{"raw_affiliation_string":"The Logistics Institute, Northeastern University, Shenyang, China#TAB#","institution_ids":["https://openalex.org/I9224756"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080304378","display_name":"Lixin Tang","orcid":"https://orcid.org/0000-0002-9950-5169"},"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":"Lixin Tang","raw_affiliation_strings":["The Logistics Institute, Northeastern University, Shenyang, China","The Logistics Institute, Northeastern University, Shenyang, China#TAB#"],"affiliations":[{"raw_affiliation_string":"The Logistics Institute, Northeastern University, Shenyang, China","institution_ids":["https://openalex.org/I9224756"]},{"raw_affiliation_string":"The Logistics Institute, Northeastern University, Shenyang, China#TAB#","institution_ids":["https://openalex.org/I9224756"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100670421"],"corresponding_institution_ids":["https://openalex.org/I9224756"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.2782,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.54684418,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"148","last_page":"155"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994999766349792,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.996999979019165,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9904999732971191,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8966814875602722},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7313281297683716},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6987819075584412},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6874499320983887},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5845285058021545},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.5177342295646667},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4927511513233185},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.48472902178764343},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44435662031173706},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24821409583091736}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8966814875602722},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7313281297683716},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6987819075584412},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6874499320983887},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5845285058021545},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5177342295646667},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4927511513233185},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.48472902178764343},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44435662031173706},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24821409583091736},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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.1007/978-3-540-85984-0_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-85984-0_19","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1555127577","https://openalex.org/W1602136519","https://openalex.org/W1978354018","https://openalex.org/W2012515029","https://openalex.org/W2030346487","https://openalex.org/W2084507157","https://openalex.org/W2104670598","https://openalex.org/W2107306858","https://openalex.org/W2107941094","https://openalex.org/W2124993036","https://openalex.org/W2125509133","https://openalex.org/W2140481494","https://openalex.org/W2142661676","https://openalex.org/W2146987494","https://openalex.org/W2153446897","https://openalex.org/W2167920923","https://openalex.org/W2297395784","https://openalex.org/W2543084894"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W4245157707","https://openalex.org/W3159037256","https://openalex.org/W2208777194","https://openalex.org/W2908391583","https://openalex.org/W2406404685","https://openalex.org/W2369428395","https://openalex.org/W2347951034","https://openalex.org/W2388326823","https://openalex.org/W1997193297"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}