{"id":"https://openalex.org/W2388819821","doi":"https://doi.org/10.3233/kes-160335","title":"A novel approach to avoiding early stagnation in Ant Colony Optimization algorithms","display_name":"A novel approach to avoiding early stagnation in Ant Colony Optimization algorithms","publication_year":2016,"publication_date":"2016-05-04","ids":{"openalex":"https://openalex.org/W2388819821","doi":"https://doi.org/10.3233/kes-160335","mag":"2388819821"},"language":"en","primary_location":{"id":"doi:10.3233/kes-160335","is_oa":false,"landing_page_url":"https://doi.org/10.3233/kes-160335","pdf_url":null,"source":{"id":"https://openalex.org/S133764092","display_name":"International Journal of Knowledge-based and Intelligent Engineering Systems","issn_l":"1327-2314","issn":["1327-2314","1875-8827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Knowledge-based and Intelligent Engineering Systems","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/A5086745464","display_name":"Adam Byerly","orcid":"https://orcid.org/0000-0002-9124-5008"},"institutions":[{"id":"https://openalex.org/I24648388","display_name":"Bradley University","ror":"https://ror.org/04kmeaw70","country_code":"US","type":"education","lineage":["https://openalex.org/I24648388"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Adam Byerly","raw_affiliation_strings":["Bradley Univ.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bradley Univ.#TAB#","institution_ids":["https://openalex.org/I24648388"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038465756","display_name":"Alexander V. Uskov","orcid":"https://orcid.org/0000-0001-8816-4103"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alexander Uskov","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5086745464"],"corresponding_institution_ids":["https://openalex.org/I24648388"],"apc_list":null,"apc_paid":null,"fwci":0.4331,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.77930264,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"20","issue":"2","first_page":"113","last_page":"121"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":1.0,"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":1.0,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9977999925613403,"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/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.752768874168396},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7377719283103943},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6137652397155762},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5533398389816284},{"id":"https://openalex.org/keywords/ranging","display_name":"Ranging","score":0.5511646866798401},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4871222972869873},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.461816668510437},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3462318778038025}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.752768874168396},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7377719283103943},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6137652397155762},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5533398389816284},{"id":"https://openalex.org/C115051666","wikidata":"https://www.wikidata.org/wiki/Q6522493","display_name":"Ranging","level":2,"score":0.5511646866798401},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4871222972869873},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.461816668510437},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3462318778038025},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/kes-160335","is_oa":false,"landing_page_url":"https://doi.org/10.3233/kes-160335","pdf_url":null,"source":{"id":"https://openalex.org/S133764092","display_name":"International Journal of Knowledge-based and Intelligent Engineering Systems","issn_l":"1327-2314","issn":["1327-2314","1875-8827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Knowledge-based and Intelligent Engineering Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.7799999713897705}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1072516","https://openalex.org/W139609527","https://openalex.org/W626292722","https://openalex.org/W1524454700","https://openalex.org/W1548993723","https://openalex.org/W1597944741","https://openalex.org/W1801849579","https://openalex.org/W1945980349","https://openalex.org/W1978101274","https://openalex.org/W2042986967","https://openalex.org/W2103623338","https://openalex.org/W2107150129","https://openalex.org/W2107941094","https://openalex.org/W2119821299","https://openalex.org/W2124519289","https://openalex.org/W2142018123","https://openalex.org/W2142419985","https://openalex.org/W2144993156","https://openalex.org/W2148673189","https://openalex.org/W2154929945","https://openalex.org/W2161291324","https://openalex.org/W2182704406","https://openalex.org/W2324108981","https://openalex.org/W2541389358","https://openalex.org/W4285719527","https://openalex.org/W6681808426","https://openalex.org/W6686021225"],"related_works":["https://openalex.org/W4384112194","https://openalex.org/W2783354812","https://openalex.org/W2103009189","https://openalex.org/W4385871958","https://openalex.org/W1997193297","https://openalex.org/W4245157707","https://openalex.org/W2908391583","https://openalex.org/W2369428395","https://openalex.org/W2981400081","https://openalex.org/W2495211334"],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"a":[3,86],"novel":[4],"approach":[5,16],"to":[6,31,63,80],"avoiding":[7],"early":[8],"stagnation":[9,42],"in":[10,43,50,100],"Ant":[11],"Colony":[12],"Optimization":[13],"algorithms.":[14],"The":[15],"involves":[17],"oscillating":[18],"the":[19,38,55,65,101,106,114],"\u03b1":[20],"and":[21,83,99],"\u03b2":[22],"parameters":[23,108],"out":[24],"of":[25,41,75,96,103,105,113],"phase":[26],"with":[27,92],"each":[28,110],"other":[29],"according":[30],"an":[32],"offline":[33],"adaptation":[34],"formula":[35],"triggered":[36],"by":[37],"online":[39],"signal":[40],"improved":[44],"soluti":[45],"ons":[46],"across":[47,69],"iterations.":[48],"Further,":[49],"this":[51,61],"paper,":[52],"we":[53],"present":[54],"experimental":[56],"results":[57],"obtained":[58],"from":[59,78],"applying":[60],"method":[62],"solving":[64],"Traveling":[66],"Salesman":[67],"Problem":[68],"eight":[70],"fully":[71],"connected,":[72],"symmetric":[73],"maps":[74],"sizes":[76],"ranging":[77],"51":[79],"1,400":[81],"cities,":[82],"show":[84],"that":[85],"marginal":[87],"improvement":[88],"is":[89],"achieved":[90],"even":[91],"relatively":[93],"constrained":[94],"amounts":[95],"computation":[97],"time":[98],"absence":[102],"fine-tuning":[104],"ACO":[107],"towards":[109],"specific":[111],"instance":[112],"problem.":[115]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-23T06:36:01.041984","created_date":"2025-10-10T00:00:00"}