{"id":"https://openalex.org/W2483389144","doi":"https://doi.org/10.1145/2908812.2908927","title":"Ants can Learn from the Opposite","display_name":"Ants can Learn from the Opposite","publication_year":2016,"publication_date":"2016-07-20","ids":{"openalex":"https://openalex.org/W2483389144","doi":"https://doi.org/10.1145/2908812.2908927","mag":"2483389144"},"language":"en","primary_location":{"id":"doi:10.1145/2908812.2908927","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2908812.2908927","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference 2016","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/A5046066991","display_name":"Nicol\u00e1s Rojas-Morales","orcid":"https://orcid.org/0000-0001-7662-1397"},"institutions":[{"id":"https://openalex.org/I75778554","display_name":"Federico Santa Mar\u00eda Technical University","ror":"https://ror.org/05510vn56","country_code":"CL","type":"education","lineage":["https://openalex.org/I75778554"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"Nicol\u00e1s Rojas-Morales","raw_affiliation_strings":["Universidad T\u00e9cnica Federico Santa Mar\u00eda, Valparaiso, Chile"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidad T\u00e9cnica Federico Santa Mar\u00eda, Valparaiso, Chile","institution_ids":["https://openalex.org/I75778554"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006195699","display_name":"Mar\u00eda-Cristina Riff","orcid":"https://orcid.org/0000-0003-1676-266X"},"institutions":[{"id":"https://openalex.org/I75778554","display_name":"Federico Santa Mar\u00eda Technical University","ror":"https://ror.org/05510vn56","country_code":"CL","type":"education","lineage":["https://openalex.org/I75778554"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"Mar\u00eda-Cristina Riff","raw_affiliation_strings":["Universidad T\u00e9cnica Federico Santa Mar\u00eda, Valparaiso, Chile"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidad T\u00e9cnica Federico Santa Mar\u00eda, Valparaiso, Chile","institution_ids":["https://openalex.org/I75778554"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043516340","display_name":"Elizabeth Montero","orcid":"https://orcid.org/0000-0002-1690-3875"},"institutions":[{"id":"https://openalex.org/I75778554","display_name":"Federico Santa Mar\u00eda Technical University","ror":"https://ror.org/05510vn56","country_code":"CL","type":"education","lineage":["https://openalex.org/I75778554"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"Elizabeth Montero","raw_affiliation_strings":["Universidad T\u00e9cnica Federico Santa Mar\u00eda, Valparaiso, Chile"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidad T\u00e9cnica Federico Santa Mar\u00eda, Valparaiso, Chile","institution_ids":["https://openalex.org/I75778554"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I75778554"],"apc_list":null,"apc_paid":null,"fwci":1.01,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.71891556,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":96},"biblio":{"volume":"2","issue":null,"first_page":"389","last_page":"396"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9919000267982483,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.9515645503997803},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.7021661996841431},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6764011383056641},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.662409245967865},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6500217914581299},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5364568829536438},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5336984395980835},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5017757415771484},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.48574239015579224},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4480458199977875},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.41247954964637756},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3656557500362396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20499280095100403},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.055273205041885376}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.9515645503997803},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.7021661996841431},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6764011383056641},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.662409245967865},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6500217914581299},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5364568829536438},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5336984395980835},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5017757415771484},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.48574239015579224},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4480458199977875},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.41247954964637756},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3656557500362396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20499280095100403},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.055273205041885376},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2908812.2908927","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2908812.2908927","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference 2016","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1555426550","https://openalex.org/W1565321533","https://openalex.org/W1588619826","https://openalex.org/W1589607443","https://openalex.org/W1980380058","https://openalex.org/W2006737978","https://openalex.org/W2034350354","https://openalex.org/W2041905867","https://openalex.org/W2071706116","https://openalex.org/W2089670420","https://openalex.org/W2096166399","https://openalex.org/W2103584428","https://openalex.org/W2106889879","https://openalex.org/W2108679901","https://openalex.org/W2118980652","https://openalex.org/W2126843316","https://openalex.org/W2134788587","https://openalex.org/W2144573902","https://openalex.org/W2145975102","https://openalex.org/W2154369526","https://openalex.org/W2157833270","https://openalex.org/W2171964388","https://openalex.org/W2569549435","https://openalex.org/W4205774039"],"related_works":["https://openalex.org/W2462483068","https://openalex.org/W2900531744","https://openalex.org/W2070079705","https://openalex.org/W2162125251","https://openalex.org/W2394153495","https://openalex.org/W2038644949","https://openalex.org/W2388217074","https://openalex.org/W2358084676","https://openalex.org/W2372214059","https://openalex.org/W4252214543"],"abstract_inverted_index":{"In":[0],"this":[1,40],"work":[2],"we":[3],"present":[4,90],"different":[5],"learning":[6],"strategies":[7,65,93],"focused":[8],"on":[9,96],"detecting":[10],"candidate":[11,49,70],"solutions":[12,50,71,99],"that":[13,51,72,94,128],"are":[14,52],"not":[15],"interesting":[16],"to":[17,44,67,82,135],"be":[18,74,101],"explored":[19],"by":[20],"a":[21,30,114],"metaheuristic,":[22,46],"in":[23,55,103,137],"terms":[24,56],"of":[25,57,62,86],"evaluation":[26],"function.":[27],"We":[28,89,124],"include":[29],"first":[31],"step":[32,41],"before":[33],"the":[34,45,77,84,87,98],"metaheuristic.":[35,88],"The":[36,60],"information":[37],"obtained":[38],"from":[39,76],"is":[42,66,109],"given":[43],"for":[47,119],"visiting":[48],"more":[53],"promising":[54,126],"their":[58],"quality.":[59],"goal":[61],"using":[63,111],"these":[64],"learn":[68],"about":[69],"can":[73,100],"discarded":[75],"search":[78,85],"space,":[79],"and":[80],"thus":[81],"improve":[83],"two":[91],"new":[92],"differ":[95],"how":[97],"constructed":[102],"an":[104],"opposite":[105],"way.":[106],"Our":[107],"approach":[108,134],"evaluated":[110],"Ant":[112],"Solver,":[113],"well-known":[115],"ant":[116],"based":[117],"algorithm":[118],"solving":[120],"Constraint":[121],"Satisfaction":[122],"Problems.":[123],"show":[125],"results":[127],"make":[129],"our":[130],"solution":[131],"as":[132],"good":[133],"apply":[136],"other":[138],"metaheuristics.":[139]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}