{"id":"https://openalex.org/W1537653938","doi":"https://doi.org/10.1023/a:1015057701750","title":"Multi Colony Ant Algorithms","display_name":"Multi Colony Ant Algorithms","publication_year":2002,"publication_date":"2002-05-01","ids":{"openalex":"https://openalex.org/W1537653938","doi":"https://doi.org/10.1023/a:1015057701750","mag":"1537653938"},"language":"en","primary_location":{"id":"doi:10.1023/a:1015057701750","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1015057701750","pdf_url":null,"source":{"id":"https://openalex.org/S111418578","display_name":"Journal of Heuristics","issn_l":"1381-1231","issn":["1381-1231","1572-9397"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Heuristics","raw_type":"journal-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/A5016253883","display_name":"Martin Middendorf","orcid":"https://orcid.org/0000-0002-5426-1092"},"institutions":[{"id":"https://openalex.org/I199417121","display_name":"Catholic University of Eichst\u00e4tt-Ingolstadt","ror":"https://ror.org/00mx91s63","country_code":"DE","type":"education","lineage":["https://openalex.org/I199417121"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin Middendorf","raw_affiliation_strings":["Fachgruppe f\u00fcr Informatik, Katholische Universit\u00e4t Eichst\u00e4tt, Ostenstr. 28, D-85072, Eichst\u00e4tt, Germany","Fachgruppe f\u00fcr Informatik, Katholische Universit\u00e4t Eichst\u00e4tt, Ostenstr. 28, D-85072 Eichst\u00e4tt, Germany. martin.middendorf@ku-eichstaett.de#TAB#"],"affiliations":[{"raw_affiliation_string":"Fachgruppe f\u00fcr Informatik, Katholische Universit\u00e4t Eichst\u00e4tt, Ostenstr. 28, D-85072, Eichst\u00e4tt, Germany","institution_ids":["https://openalex.org/I199417121"]},{"raw_affiliation_string":"Fachgruppe f\u00fcr Informatik, Katholische Universit\u00e4t Eichst\u00e4tt, Ostenstr. 28, D-85072 Eichst\u00e4tt, Germany. martin.middendorf@ku-eichstaett.de#TAB#","institution_ids":["https://openalex.org/I199417121"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061620798","display_name":"Frank Reischle","orcid":null},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Frank Reischle","raw_affiliation_strings":["Institut f\u00fcr Angewandte Informatik und Formale Beschreibungsverfahren (AIFB), Universit\u00e4t Karlsruhe, D-76128, Karlsruhe, Germany","Institut f\u00fcr Angewandte Informatik und Formale Beschreibungsverfahren (AIFB), Universit\u00e4t Karlsruhe, D-76128 Karlsruhe, Germany. frank.reischle@gmx.net#TAB#"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Angewandte Informatik und Formale Beschreibungsverfahren (AIFB), Universit\u00e4t Karlsruhe, D-76128, Karlsruhe, Germany","institution_ids":[]},{"raw_affiliation_string":"Institut f\u00fcr Angewandte Informatik und Formale Beschreibungsverfahren (AIFB), Universit\u00e4t Karlsruhe, D-76128 Karlsruhe, Germany. frank.reischle@gmx.net#TAB#","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082605480","display_name":"Hartmut Schmeck","orcid":"https://orcid.org/0000-0002-4295-7631"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Hartmut Schmeck","raw_affiliation_strings":["Institut f\u00fcr Angewandte Informatik und Formale Beschreibungsverfahren (AIFB), Universit\u00e4t Karlsruhe, D-76128, Karlsruhe, Germany","Institut f\u00fcr Angewandte Informatik und Formale Beschreibungsverfahren (AIFB), Universit\u00e4t Karlsruhe, D-76128 Karlsruhe, Germany. schmeck@aifb.uni-karlsruhe.de#TAB#"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Angewandte Informatik und Formale Beschreibungsverfahren (AIFB), Universit\u00e4t Karlsruhe, D-76128, Karlsruhe, Germany","institution_ids":[]},{"raw_affiliation_string":"Institut f\u00fcr Angewandte Informatik und Formale Beschreibungsverfahren (AIFB), Universit\u00e4t Karlsruhe, D-76128 Karlsruhe, Germany. schmeck@aifb.uni-karlsruhe.de#TAB#","institution_ids":["https://openalex.org/I102335020"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5016253883"],"corresponding_institution_ids":["https://openalex.org/I199417121"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":18.9189,"has_fulltext":false,"cited_by_count":177,"citation_normalized_percentile":{"value":0.9964687,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"8","issue":"3","first_page":"305","last_page":"320"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9922000169754028,"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.9922000169754028,"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.9865000247955322,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9567000269889832,"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/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8072764277458191},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.6415355205535889},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6368274688720703},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6135791540145874},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.5497145056724548},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5141739845275879},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.42800015211105347},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.37215977907180786},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3222053647041321},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.29898667335510254},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27112406492233276},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.11821439862251282}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8072764277458191},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.6415355205535889},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6368274688720703},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6135791540145874},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.5497145056724548},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5141739845275879},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.42800015211105347},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.37215977907180786},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3222053647041321},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.29898667335510254},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27112406492233276},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.11821439862251282}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1023/a:1015057701750","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1015057701750","pdf_url":null,"source":{"id":"https://openalex.org/S111418578","display_name":"Journal of Heuristics","issn_l":"1381-1231","issn":["1381-1231","1572-9397"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Heuristics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W118692873","https://openalex.org/W133371706","https://openalex.org/W147559675","https://openalex.org/W231725279","https://openalex.org/W1488651132","https://openalex.org/W1492640216","https://openalex.org/W1504935863","https://openalex.org/W1530715683","https://openalex.org/W1557288165","https://openalex.org/W1566652554","https://openalex.org/W1580654495","https://openalex.org/W1587263632","https://openalex.org/W1602076081","https://openalex.org/W1607240485","https://openalex.org/W1801849579","https://openalex.org/W1933569933","https://openalex.org/W1941416453","https://openalex.org/W1994815518","https://openalex.org/W2032431794","https://openalex.org/W2048698391","https://openalex.org/W2089933214","https://openalex.org/W2106972943","https://openalex.org/W2107941094","https://openalex.org/W2140481494","https://openalex.org/W6629566668","https://openalex.org/W6635178849","https://openalex.org/W6635910384"],"related_works":["https://openalex.org/W1611875833","https://openalex.org/W2462483068","https://openalex.org/W3134118207","https://openalex.org/W2961293269","https://openalex.org/W90370723","https://openalex.org/W1509961061","https://openalex.org/W2061413861","https://openalex.org/W2593334699","https://openalex.org/W4200602616","https://openalex.org/W2093825635"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":10}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}