{"id":"https://openalex.org/W1543940176","doi":"https://doi.org/10.1007/11839088_20","title":"Parallel Ant Colony Optimization for the Traveling Salesman Problem","display_name":"Parallel Ant Colony Optimization for the Traveling Salesman Problem","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1543940176","doi":"https://doi.org/10.1007/11839088_20","mag":"1543940176"},"language":"en","primary_location":{"id":"doi:10.1007/11839088_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11839088_20","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/A5044757400","display_name":"Max Manfrin","orcid":"https://orcid.org/0009-0002-3263-4086"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Max Manfrin","raw_affiliation_strings":["IRIDIA, CoDE, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IRIDIA, CoDE, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061782786","display_name":"Mauro Birattari","orcid":"https://orcid.org/0000-0003-3309-2194"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Mauro Birattari","raw_affiliation_strings":["IRIDIA, CoDE, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IRIDIA, CoDE, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074791154","display_name":"Thomas St\u00fctzle","orcid":"https://orcid.org/0000-0002-5820-0473"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Thomas St\u00fctzle","raw_affiliation_strings":["IRIDIA, CoDE, Universit\u00e9 Libre de Bruxelles, Avenue F. Roosevelt 50, CP 194/6, 1050, Brussels, Belgium","IRIDIA, CoDE, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IRIDIA, CoDE, Universit\u00e9 Libre de Bruxelles, Avenue F. Roosevelt 50, CP 194/6, 1050, Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]},{"raw_affiliation_string":"IRIDIA, CoDE, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024091899","display_name":"Marco Dorigo","orcid":"https://orcid.org/0000-0002-3971-0507"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Marco Dorigo","raw_affiliation_strings":["IRIDIA, CoDE, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium","IRIDIA, CoDE, Universit\u00e9 Libre de Bruxelles,,, Brussels, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IRIDIA, CoDE, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]},{"raw_affiliation_string":"IRIDIA, CoDE, Universit\u00e9 Libre de Bruxelles,,, Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":7.8381,"has_fulltext":false,"cited_by_count":129,"citation_normalized_percentile":{"value":0.9814932,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"224","last_page":"234"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994000196456909,"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.9994000196456909,"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.9921000003814697,"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.9886000156402588,"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.9344855546951294},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8411108255386353},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8190027475357056},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.8047515153884888},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.7375627756118774},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.6541330218315125},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5534937381744385},{"id":"https://openalex.org/keywords/extremal-optimization","display_name":"Extremal optimization","score":0.5258593559265137},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.513533353805542},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4982717037200928},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.46518081426620483},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.376248836517334},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2935595214366913},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13863465189933777},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12020412087440491},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.1084839403629303}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9344855546951294},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8411108255386353},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8190027475357056},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.8047515153884888},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7375627756118774},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.6541330218315125},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5534937381744385},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.5258593559265137},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.513533353805542},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4982717037200928},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.46518081426620483},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.376248836517334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2935595214366913},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13863465189933777},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12020412087440491},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.1084839403629303}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11839088_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11839088_20","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W68587524","https://openalex.org/W103650626","https://openalex.org/W376280045","https://openalex.org/W1504935863","https://openalex.org/W1537653938","https://openalex.org/W1545046546","https://openalex.org/W1573676079","https://openalex.org/W1591939288","https://openalex.org/W1801849579","https://openalex.org/W1813030236","https://openalex.org/W1941416453","https://openalex.org/W2011039300","https://openalex.org/W2056257094","https://openalex.org/W2078297643","https://openalex.org/W2092297694","https://openalex.org/W2121044470","https://openalex.org/W2476096155","https://openalex.org/W2903691225","https://openalex.org/W4249750499","https://openalex.org/W4285719527","https://openalex.org/W4292408555","https://openalex.org/W4302367531","https://openalex.org/W6602772817"],"related_works":["https://openalex.org/W1611875833","https://openalex.org/W2208777194","https://openalex.org/W2155977934","https://openalex.org/W2070079705","https://openalex.org/W2900531744","https://openalex.org/W2406404685","https://openalex.org/W1997193297","https://openalex.org/W2462483068","https://openalex.org/W2038644949","https://openalex.org/W2358796234"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":8}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}