{"id":"https://openalex.org/W1973375522","doi":"https://doi.org/10.1145/1068009.1068051","title":"Solving geometric TSP with ants","display_name":"Solving geometric TSP with ants","publication_year":2005,"publication_date":"2005-06-25","ids":{"openalex":"https://openalex.org/W1973375522","doi":"https://doi.org/10.1145/1068009.1068051","mag":"1973375522"},"language":"en","primary_location":{"id":"doi:10.1145/1068009.1068051","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1068009.1068051","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"article","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/A5100829364","display_name":"Thang Nguyen Bui","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Thang N. Bui","raw_affiliation_strings":["Pennsylvania State University at Harrisburg, Middletown, PA"],"affiliations":[{"raw_affiliation_string":"Pennsylvania State University at Harrisburg, Middletown, PA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018306691","display_name":"Mufit Colpan","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mufit Colpan","raw_affiliation_strings":["Pennsylvania State University at Harrisburg, Middletown, PA"],"affiliations":[{"raw_affiliation_string":"Pennsylvania State University at Harrisburg, Middletown, PA","institution_ids":["https://openalex.org/I130769515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100829364"],"corresponding_institution_ids":["https://openalex.org/I130769515"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.09715992,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"271","last_page":"272"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9990000128746033,"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.9990000128746033,"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.9988999962806702,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9768999814987183,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9126266241073608},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7320196032524109},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6239194273948669},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6012803316116333},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5889869928359985},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5359433889389038},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5333001613616943},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3789949417114258},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37321770191192627},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2583000659942627}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9126266241073608},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7320196032524109},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6239194273948669},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6012803316116333},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5889869928359985},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5359433889389038},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5333001613616943},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3789949417114258},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37321770191192627},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2583000659942627},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1068009.1068051","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1068009.1068051","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.421.2868","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.421.2868","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bham.ac.uk/~wbl/biblio/gecco2005/docs/p271.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1933569933","https://openalex.org/W2091674391","https://openalex.org/W2102076751","https://openalex.org/W2154929945","https://openalex.org/W4205241946","https://openalex.org/W4246467599"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W4385871958","https://openalex.org/W4245157707","https://openalex.org/W1997193297","https://openalex.org/W2031913815","https://openalex.org/W2208777194","https://openalex.org/W2908391583","https://openalex.org/W2369428395","https://openalex.org/W2406404685","https://openalex.org/W2981400081"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3,40],"ant-based":[4,41],"approach":[5,42],"for":[6,64,87],"solving":[7],"the":[8,22,26,33,69,84,91,103],"Traveling":[9],"Salesman":[10],"Problem":[11],"(TSP).":[12],"Novel":[13],"concepts":[14],"of":[15,28,35,39,72,102],"this":[16,53,81,94],"algorithm":[17,54,82,95],"that":[18,52,78,98],"distinguish":[19],"it":[20],"from":[21,75],"other":[23],"heuristics":[24],"are":[25],"inclusion":[27],"a":[29,36],"preprocessing":[30],"stage":[31],"and":[32,58],"use":[34],"modified":[37],"version":[38],"with":[43],"local":[44],"optimization":[45],"in":[46],"multi":[47],"stages.":[48],"Experimental":[49],"results":[50],"show":[51],"outperforms":[55],"ACS":[56],"[1]":[57],"is":[59],"comparable":[60],"to":[61],"MMAS":[62],"[4]":[63],"Euclidean":[65,73],"TSP":[66,74],"instances.":[67,89],"Of":[68],"40":[70],"instances":[71],"TSPLIB":[76],"[5]":[77],"were":[79,99],"tested,":[80],"found":[83],"optimal":[85],"solution":[86],"37":[88],"For":[90],"remaining":[92],"instances,":[93],"returned":[96],"solutions":[97],"within":[100],"0.3%":[101],"optimum.":[104]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}