{"id":"https://openalex.org/W2293696308","doi":"https://doi.org/10.1007/978-3-642-15461-4_28","title":"Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem","display_name":"Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2293696308","doi":"https://doi.org/10.1007/978-3-642-15461-4_28","mag":"2293696308"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-15461-4_28","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-15461-4_28","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":"conference-paper","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/A5004366897","display_name":"Timo K\u00f6tzing","orcid":"https://orcid.org/0000-0002-1028-5228"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Timo K\u00f6tzing","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Algorithms and Complexity, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Algorithms and Complexity, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089531887","display_name":"Frank Neumann","orcid":"https://orcid.org/0000-0002-2721-3618"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Frank Neumann","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Algorithms and Complexity, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Algorithms and Complexity, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034122679","display_name":"Heiko R\u00f6glin","orcid":"https://orcid.org/0009-0006-8438-3986"},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Heiko R\u00f6glin","raw_affiliation_strings":["Department of Quantitative Economics, Maastricht University, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Quantitative Economics, Maastricht University, The Netherlands","institution_ids":["https://openalex.org/I34352273"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038689623","display_name":"Carsten Witt","orcid":"https://orcid.org/0000-0002-6105-7700"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Carsten Witt","raw_affiliation_strings":["DTU Informatics, Technical University of Denmark, Kgs.\u00a0Lyngby, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DTU Informatics, Technical University of Denmark, Kgs.\u00a0Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"324","last_page":"335"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9987000226974487,"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.9987000226974487,"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.9925000071525574,"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.9797999858856201,"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.9334717988967896},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7395513653755188},{"id":"https://openalex.org/keywords/extremal-optimization","display_name":"Extremal optimization","score":0.7245652675628662},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6964018940925598},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.57591712474823},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5215929746627808},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5141015648841858},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3747211992740631},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3585699796676636},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2909564971923828},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22021371126174927},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.1070425808429718}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9334717988967896},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7395513653755188},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.7245652675628662},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6964018940925598},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.57591712474823},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5215929746627808},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5141015648841858},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3747211992740631},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3585699796676636},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2909564971923828},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22021371126174927},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.1070425808429718}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/978-3-642-15461-4_28","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-15461-4_28","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.183.7315","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.183.7315","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-i1.informatik.rwth-aachen.de/%7Eroeglin/publications/ANTS10.pdf","raw_type":"text"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/65761","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/65761","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dx.doi.org/10.1007/978-3-642-15461-4_28","raw_type":"Conference paper"},{"id":"pmh:oai:edoc.mpg.de:536698","is_oa":false,"landing_page_url":"http://edoc.mpg.de/536698","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Dorigo, Marco; Birattari, Mauro; Di Caro, Gianni A.; Doursat, Ren\u00e9; Engelbrecht, Andries P.; Floreano, Dario; Gambardella, Luca Maria; Gro\u00df, Roderich; Sahin, Erol; Sayama, Hiroki; St\u00fctzle, Thomas: Swarm Intelligence : 7th International Conference, ANTS 2010, Springer, 324-335 (2010)","raw_type":"Conference-Paper"},{"id":"pmh:oai:pure.atira.dk:publications/d0b53845-c0a9-495a-9b77-8e9619f6030a","is_oa":false,"landing_page_url":"https://orbit.dtu.dk/en/publications/d0b53845-c0a9-495a-9b77-8e9619f6030a","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"K\u00f6tzing , T , Neumann , F , R\u00f6glin , H & Witt , C 2010 , Theoretical properties of two ACO approaches for the traveling salesman problem . in Ant Colony Optimization and Swarm Intelligence - ANTS 2010 . Lecture Notes in Computer Science , no. 6234 . < http://www.springerlink.com/content/08t66146r4704104/ >","raw_type":"bookPart"},{"id":"pmh:oai:pure.mpg.de:item_1323931","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-1709-0","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W98056105","https://openalex.org/W187767610","https://openalex.org/W1512383952","https://openalex.org/W1573676079","https://openalex.org/W1635549461","https://openalex.org/W1915653146","https://openalex.org/W1965978641","https://openalex.org/W1993561093","https://openalex.org/W2011904305","https://openalex.org/W2034053794","https://openalex.org/W2039865013","https://openalex.org/W2042096932","https://openalex.org/W2079868147","https://openalex.org/W2106371135","https://openalex.org/W2144643443","https://openalex.org/W2154929945","https://openalex.org/W2415369160","https://openalex.org/W4299796063"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W1997193297","https://openalex.org/W1604040598","https://openalex.org/W2146364482","https://openalex.org/W2120093588","https://openalex.org/W2369428395","https://openalex.org/W3013791021","https://openalex.org/W2572756133","https://openalex.org/W2597689725","https://openalex.org/W1581626193"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}