{"id":"https://openalex.org/W1619281002","doi":"https://doi.org/10.1109/cec.2014.6900294","title":"Ant Colony Optimization and hypergraph covering problems","display_name":"Ant Colony Optimization and hypergraph covering problems","publication_year":2014,"publication_date":"2014-07-01","ids":{"openalex":"https://openalex.org/W1619281002","doi":"https://doi.org/10.1109/cec.2014.6900294","mag":"1619281002"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2014.6900294","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2014.6900294","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Congress on Evolutionary Computation (CEC)","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/A5043619805","display_name":"Ankit Pat","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Ankit Pat","raw_affiliation_strings":["Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada","[Cheriton School of Computer Science, University of Waterloo,, Waterloo, Canada]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"[Cheriton School of Computer Science, University of Waterloo,, Waterloo, Canada]","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5043619805"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.04247053,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1714","last_page":"1720"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9988999962806702,"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.9988999962806702,"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.9975000023841858,"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.9975000023841858,"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.806241512298584},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.7841957807540894},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.7417540550231934},{"id":"https://openalex.org/keywords/extremal-optimization","display_name":"Extremal optimization","score":0.6559292078018188},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5990213751792908},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5529386401176453},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5471450686454773},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5409227013587952},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.4951137602329254},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4612080156803131},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.44865554571151733},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.42563554644584656},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.4142047166824341},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37771618366241455},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3266040086746216},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31898194551467896},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.20165228843688965},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.14478355646133423},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07797706127166748}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.806241512298584},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.7841957807540894},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7417540550231934},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.6559292078018188},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5990213751792908},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5529386401176453},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5471450686454773},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5409227013587952},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4951137602329254},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4612080156803131},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.44865554571151733},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.42563554644584656},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4142047166824341},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37771618366241455},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3266040086746216},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31898194551467896},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20165228843688965},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.14478355646133423},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07797706127166748},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2014.6900294","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2014.6900294","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Congress on Evolutionary Computation (CEC)","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":35,"referenced_works":["https://openalex.org/W85156741","https://openalex.org/W203078010","https://openalex.org/W1482913321","https://openalex.org/W1543480758","https://openalex.org/W1570588782","https://openalex.org/W1632066424","https://openalex.org/W1635549461","https://openalex.org/W1655051759","https://openalex.org/W1801849579","https://openalex.org/W1859357731","https://openalex.org/W1979409761","https://openalex.org/W1993561093","https://openalex.org/W2009816066","https://openalex.org/W2017938154","https://openalex.org/W2042096932","https://openalex.org/W2052176278","https://openalex.org/W2057398816","https://openalex.org/W2060816316","https://openalex.org/W2066723908","https://openalex.org/W2093094460","https://openalex.org/W2105039734","https://openalex.org/W2118573797","https://openalex.org/W2130411910","https://openalex.org/W2144643443","https://openalex.org/W2165220807","https://openalex.org/W2293696308","https://openalex.org/W2401610261","https://openalex.org/W2614370452","https://openalex.org/W2949990147","https://openalex.org/W4292408555","https://openalex.org/W4300615711","https://openalex.org/W6603377405","https://openalex.org/W6628981622","https://openalex.org/W6632521495","https://openalex.org/W6653428413"],"related_works":["https://openalex.org/W2100782222","https://openalex.org/W2115404728","https://openalex.org/W2014637163","https://openalex.org/W3120026953","https://openalex.org/W187767610","https://openalex.org/W2597689725","https://openalex.org/W2592065458","https://openalex.org/W4210470436","https://openalex.org/W2146364482","https://openalex.org/W1988621216"],"abstract_inverted_index":{"Ant":[0,51],"Colony":[1],"Optimization":[2],"(ACO)":[3],"is":[4,98,145],"a":[5,133],"very":[6],"popular":[7],"metaheuristic":[8],"for":[9],"solving":[10],"computationally":[11],"hard":[12],"combinatorial":[13,30],"optimization":[14,31,114,137],"problems.":[15],"Runtime":[16],"analysis":[17],"of":[18,48,88,124,142],"ACO":[19,53],"with":[20],"respect":[21],"to":[22,118],"various":[23],"pseudo-boolean":[24],"functions":[25],"and":[26,80,91],"different":[27],"graph":[28],"based":[29],"problems":[32,61],"has":[33,107],"been":[34],"taken":[35],"up":[36],"in":[37],"recent":[38],"years.":[39],"In":[40,65],"this":[41],"paper,":[42],"we":[43,67,126],"investigate":[44],"the":[45,70,75,81,95,104,112,129,140],"runtime":[46],"behavior":[47],"an":[49],"MMAS*(Max-Min":[50],"System)":[52],"algorithm":[54,131],"on":[55,94],"some":[56],"well":[57],"known":[58],"hypergraph":[59],"covering":[60],"that":[62,103,128],"are":[63],"NP-Hard.":[64],"particular,":[66],"have":[68],"addressed":[69],"Minimum":[71,76],"Edge":[72],"Cover":[73,78],"problem,":[74],"Vertex":[77],"problem":[79],"Maximum":[82],"Weak-Independent":[83],"Set":[84],"problem.":[85],"The":[86,100],"influence":[87],"pheromone":[89,119],"values":[90],"heuristic":[92,105,143],"information":[93,106,144],"running":[96],"time":[97,115,138],"analysed.":[99],"results":[101],"indicate":[102],"greater":[108],"impact":[109],"towards":[110],"improving":[111],"expected":[113,136],"as":[116],"compared":[117],"values.":[120],"For":[121],"certain":[122],"instances":[123],"hypergraphs,":[125],"show":[127],"MMAS*":[130],"gives":[132],"constant":[134],"order":[135],"when":[139],"dominance":[141],"suitably":[146],"increased.":[147]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}