{"id":"https://openalex.org/W3206083529","doi":"https://doi.org/10.3390/a14100295","title":"Ant Colony Optimization with Warm-Up","display_name":"Ant Colony Optimization with Warm-Up","publication_year":2021,"publication_date":"2021-10-12","ids":{"openalex":"https://openalex.org/W3206083529","doi":"https://doi.org/10.3390/a14100295","mag":"3206083529"},"language":"en","primary_location":{"id":"doi:10.3390/a14100295","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14100295","pdf_url":"https://www.mdpi.com/1999-4893/14/10/295/pdf?version=1634813078","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/14/10/295/pdf?version=1634813078","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003354533","display_name":"Mattia Neroni","orcid":"https://orcid.org/0000-0002-4507-4789"},"institutions":[{"id":"https://openalex.org/I124601658","display_name":"University of Parma","ror":"https://ror.org/02k7wn190","country_code":"IT","type":"education","lineage":["https://openalex.org/I124601658"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Mattia Neroni","raw_affiliation_strings":["Department of Engineering and Architecture, University of Parma, 43124 Parma, Italy"],"raw_orcid":"https://orcid.org/0000-0002-4507-4789","affiliations":[{"raw_affiliation_string":"Department of Engineering and Architecture, University of Parma, 43124 Parma, Italy","institution_ids":["https://openalex.org/I124601658"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5003354533"],"corresponding_institution_ids":["https://openalex.org/I124601658"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":1.2592,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.84049612,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"14","issue":"10","first_page":"295","last_page":"295"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9987999796867371,"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.9987999796867371,"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.998199999332428,"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.9968000054359436,"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.8784241676330566},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7703225612640381},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.7054556012153625},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6877614855766296},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6257666945457458},{"id":"https://openalex.org/keywords/extremal-optimization","display_name":"Extremal optimization","score":0.5104121565818787},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4651108384132385},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.423850417137146},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42301759123802185},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.41359996795654297},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3747203052043915},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.28414538502693176},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22390031814575195},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.20060694217681885},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.12056836485862732}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8784241676330566},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7703225612640381},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.7054556012153625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6877614855766296},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6257666945457458},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.5104121565818787},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4651108384132385},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.423850417137146},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42301759123802185},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.41359996795654297},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3747203052043915},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28414538502693176},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22390031814575195},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.20060694217681885},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12056836485862732},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a14100295","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14100295","pdf_url":"https://www.mdpi.com/1999-4893/14/10/295/pdf?version=1634813078","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:a3ec1279c2c8463e9a9378d1610a436c","is_oa":true,"landing_page_url":"https://doaj.org/article/a3ec1279c2c8463e9a9378d1610a436c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 14, Iss 10, p 295 (2021)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/14/10/295/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a14100295","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a14100295","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14100295","pdf_url":"https://www.mdpi.com/1999-4893/14/10/295/pdf?version=1634813078","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3206083529.pdf"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W803853334","https://openalex.org/W1489881420","https://openalex.org/W1796403065","https://openalex.org/W1801849579","https://openalex.org/W2000790509","https://openalex.org/W2008665401","https://openalex.org/W2025704344","https://openalex.org/W2029319864","https://openalex.org/W2052396508","https://openalex.org/W2063914115","https://openalex.org/W2068745920","https://openalex.org/W2089196696","https://openalex.org/W2090435272","https://openalex.org/W2095967797","https://openalex.org/W2107941094","https://openalex.org/W2118573797","https://openalex.org/W2119650324","https://openalex.org/W2124253297","https://openalex.org/W2126281772","https://openalex.org/W2144643443","https://openalex.org/W2154487696","https://openalex.org/W2154929945","https://openalex.org/W2769848411","https://openalex.org/W3087480459","https://openalex.org/W3092077216","https://openalex.org/W3097546498","https://openalex.org/W3207672361","https://openalex.org/W6629425209"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W1611875833","https://openalex.org/W2208777194","https://openalex.org/W1997193297","https://openalex.org/W1975009952","https://openalex.org/W2406404685","https://openalex.org/W4245157707","https://openalex.org/W2369428395","https://openalex.org/W1588949866","https://openalex.org/W2462483068"],"abstract_inverted_index":{"The":[0,108,158],"Ant":[1,55],"Colony":[2],"Optimization":[3],"(ACO)":[4],"is":[5,75,83,110,120,153,161,193],"a":[6,29,59,69,164,176,186,199],"probabilistic":[7],"technique":[8],"inspired":[9],"by":[10,49],"the":[11,25,38,53,73,78,80,93,100,114,133,148,173,181,190,204,211,214,218,222],"behavior":[12],"of":[13,33,52,166,175,183,213],"ants":[14,34],"for":[15,62,72,92,180],"solving":[16,63],"computational":[17],"problems":[18],"that":[19,45,96],"may":[20],"be":[21,47,127,140],"reduced":[22],"to":[23,40,85,126,220],"finding":[24],"best":[26],"path":[27],"through":[28],"graph.":[30],"Some":[31],"species":[32],"deposit":[35],"pheromone":[36,81,200],"on":[37,113,163],"ground":[39],"mark":[41],"some":[42],"favorable":[43],"paths":[44],"should":[46],"used":[48,154],"other":[50,196],"members":[51],"colony.":[54],"colony":[56],"optimization":[57,64],"implements":[58],"similar":[60],"mechanism":[61],"problems.":[65],"In":[66,135],"this":[67,136],"paper":[68],"warm-up":[70,109,216],"procedure":[71],"ACO":[74,197,219],"proposed.":[76],"During":[77,189],"warm-up,":[79],"matrix":[82],"initialized":[84],"provide":[86],"an":[87],"efficient":[88],"new":[89],"starting":[90],"point":[91],"algorithm,":[94],"so":[95],"it":[97,138,145,152,192],"can":[98,139],"obtain":[99,221],"same":[101,223],"(or":[102],"better)":[103],"results":[104,205,226],"with":[105,195,227],"fewer":[106,228],"iterations.":[107,229],"based":[111],"exclusively":[112],"graph,":[115],"which,":[116],"in":[117,172,185,208],"most":[118,209],"applications,":[119],"given":[121],"and":[122,144,171,203],"does":[123],"not":[124],"need":[125],"recalculated":[128],"every":[129,150],"time":[130,151],"before":[131],"executing":[132],"algorithm.":[134],"way,":[137],"made":[141],"only":[142],"once,":[143],"speeds":[146],"up":[147],"algorithm":[149],"from":[155],"then":[156],"on.":[157],"proposed":[159,215],"solution":[160],"validated":[162],"set":[165],"traveling":[167],"salesman":[168],"problem":[169],"instances,":[170],"simulation":[174],"real":[177],"industrial":[178],"application":[179],"routing":[182],"pickers":[184],"manual":[187],"warehouse.":[188],"validation,":[191],"compared":[194],"adopting":[198],"initialization":[201],"technique,":[202],"show":[206],"that,":[207],"cases,":[210],"adoption":[212],"allows":[217],"or":[224],"better":[225]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":6}],"updated_date":"2026-05-22T06:13:13.366637","created_date":"2025-10-10T00:00:00"}