{"id":"https://openalex.org/W2032399727","doi":"https://doi.org/10.1109/cec.2012.6256528","title":"Max-min ant system with linear memory complexity","display_name":"Max-min ant system with linear memory complexity","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W2032399727","doi":"https://doi.org/10.1109/cec.2012.6256528","mag":"2032399727"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2012.6256528","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6256528","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},"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/A5103988292","display_name":"Oleg Kov\u00e1\u0159\u00edk","orcid":null},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Oleg Kovarik","raw_affiliation_strings":["Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Czech Republic","Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Czech"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Czech","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035026045","display_name":"Pavel Kord\u00edk","orcid":"https://orcid.org/0000-0003-1433-0089"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Pavel Kordik","raw_affiliation_strings":["Department of Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Czech Republic","Department of Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Czech"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]},{"raw_affiliation_string":"Department of Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Czech","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12903692,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994999766349792,"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.9994999766349792,"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/T11106","display_name":"Data Management and Algorithms","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9890999794006348,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.754599928855896},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.6138812303543091},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5970933437347412},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5551648736000061},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5472270846366882},{"id":"https://openalex.org/keywords/ant","display_name":"ANT","score":0.5169298052787781},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.49376925826072693},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.4725610613822937},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4124663770198822},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3822970390319824},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34791088104248047},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.270624577999115}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.754599928855896},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.6138812303543091},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5970933437347412},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5551648736000061},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5472270846366882},{"id":"https://openalex.org/C97467695","wikidata":"https://www.wikidata.org/wiki/Q295802","display_name":"ANT","level":2,"score":0.5169298052787781},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.49376925826072693},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4725610613822937},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4124663770198822},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3822970390319824},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34791088104248047},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.270624577999115},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2012.6256528","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6256528","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6800000071525574,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W187767610","https://openalex.org/W626292722","https://openalex.org/W1559839959","https://openalex.org/W1748133846","https://openalex.org/W2002425996","https://openalex.org/W2107631366","https://openalex.org/W2163428398","https://openalex.org/W4242361212","https://openalex.org/W6607571859","https://openalex.org/W6619920785","https://openalex.org/W6637980374"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W4245157707","https://openalex.org/W2208777194","https://openalex.org/W2908391583","https://openalex.org/W2406404685","https://openalex.org/W2369428395","https://openalex.org/W4237535716","https://openalex.org/W2110363036","https://openalex.org/W2347951034","https://openalex.org/W1997193297"],"abstract_inverted_index":{"We":[0,40],"improved":[1],"memory":[2,76],"complexity":[3],"of":[4,12,24,38,46,68,85,93,96],"Max-Min":[5],"Ant":[6,16],"System":[7],"algorithm,":[8],"which":[9],"is":[10,35,52,80],"one":[11],"the":[13,29,36,49,60,75,104],"best":[14],"performing":[15],"Colony":[17],"Optimization":[18],"algorithms.":[19],"Standard":[20],"implementation":[21],"uses":[22],"n2matrix":[23],"artificial":[25],"pheromone":[26,50],"to":[27,73,106],"solve":[28],"Traveling":[30],"Salesman":[31],"Problem,":[32],"where":[33,90],"n":[34],"number":[37],"cities.":[39],"show,":[41],"that":[42],"only":[43],"small":[44],"fraction":[45],"values":[47],"in":[48,71,83],"matrix":[51,61],"changed":[53],"from":[54],"a":[55],"global":[56],"value":[57],"and":[58],"so":[59],"can":[62],"be":[63,107],"replaced":[64],"by":[65],"an":[66],"array":[67],"hash":[69],"tables":[70],"order":[72],"reduce":[74],"complexity.":[77],"This":[78],"improvement":[79],"very":[81],"useful":[82],"case":[84],"parallelization":[86],"on":[87],"multicore":[88],"architectures,":[89],"frequent":[91],"transfers":[92],"random":[94],"parts":[95],"matrices":[97],"cause":[98],"radical":[99],"slowdown.":[100],"Also":[101],"it":[102],"enables":[103],"algorithm":[105],"competitive":[108],"with":[109],"others":[110],"when":[111],"solving":[112],"large":[113],"instances.":[114]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}