{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T20:59:21Z","timestamp":1771966761288,"version":"3.50.1"},"reference-count":37,"publisher":"Emerald","issue":"5","license":[{"start":{"date-parts":[[2022,4,13]],"date-time":"2022-04-13T00:00:00Z","timestamp":1649808000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["DTA"],"published-print":{"date-parts":[[2022,12,9]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title><jats:p>The paper aims to provide an efficient meta-heuristic algorithm to solve the partial set covering problem (PSCP). With rich application scenarios, the PSCP is a fascinating and well-known non-deterministic polynomial (NP)-hard problem whose goal is to cover at least k elements with as few subsets as possible.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title><jats:p>In this work, the authors present a novel variant of the ant colony optimization (ACO) algorithm, called Argentine ant system (AAS), to deal with the PSCP. The developed AAS is an integrated system of different populations that use the same pheromone to communicate. Moreover, an effective local search framework with the relaxed configuration checking (RCC) and the volatilization-fixed weight mechanism is proposed to improve the exploitation of the algorithm.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Findings<\/jats:title><jats:p>A detailed experimental evaluation of 75 instances reveals that the proposed algorithm outperforms the competitors in terms of the quality of the optimal solutions. Also, the performance of AAS gradually improves with the growing instance size, which shows the potential in handling complex practical scenarios. Finally, the designed components of AAS are experimentally proved to be beneficial to the whole framework. Finally, the key components in AAS have been demonstrated.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title><jats:p>At present, there is no heuristic method to solve this problem. The authors present the first implementation of heuristic algorithm for solving PSCP and provide competitive solutions.<\/jats:p><\/jats:sec>","DOI":"10.1108\/dta-08-2021-0205","type":"journal-article","created":{"date-parts":[[2022,4,13]],"date-time":"2022-04-13T15:25:49Z","timestamp":1649863549000},"page":"762-781","source":"Crossref","is-referenced-by-count":2,"title":["An Argentine ant system algorithm for partial set covering problem"],"prefix":"10.1108","volume":"56","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4477-6164","authenticated-orcid":false,"given":"Xiaofan","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9328-1328","authenticated-orcid":false,"given":"Yupeng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6226-2394","authenticated-orcid":false,"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6564-0365","authenticated-orcid":false,"given":"Shuai","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2022,4,13]]},"reference":[{"key":"key2022120707384959200_ref001","first-page":"2635","article-title":"A k-elitist max-min ant system approach to cost-based abduction","year":"2003"},{"key":"key2022120707384959200_ref002","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2016.06.006","article-title":"A hybrid of max\u2013min ant system and linear programming for the k-covering problem","volume":"76","year":"2016","journal-title":"Computers & Operations Research"},{"issue":"2","key":"key2022120707384959200_ref003","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1108\/DTA-08-2019-0138","article-title":"B\u00f6len: software module clustering method using the combination of shuffled frog leaping and genetic algorithm","volume":"55","year":"2021","journal-title":"Data Technologies and Applications"},{"issue":"11","key":"key2022120707384959200_ref004","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","article-title":"Or-library: distributing test problems by electronic mail","volume":"41","year":"1990","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"key2022120707384959200_ref005","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/j.plrev.2005.10.001","article-title":"Ant colony optimization: introduction and recent trends","volume":"2","year":"2005","journal-title":"Physics of Life Reviews"},{"issue":"4","key":"key2022120707384959200_ref006","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1287\/ijoc.1080.0271","article-title":"Beam-aco for simple assembly line balancing","volume":"20","year":"2008","journal-title":"Informs Journal on Computing"},{"issue":"9-10","key":"key2022120707384959200_ref007","doi-asserted-by":"crossref","first-page":"1672","DOI":"10.1016\/j.artint.2011.03.003","article-title":"Local search with edge weighting and configuration checking heuristics for minimum vertex cover","volume":"175","year":"2011","journal-title":"Artificial Intelligence"},{"key":"key2022120707384959200_ref008","article-title":"On approximating partial set cover and generalizations","volume-title":"Journal of Environmental Sciences (China)","year":"2019"},{"issue":"1","key":"key2022120707384959200_ref009","first-page":"64","article-title":"Optimizing discounted cash flows in project scheduling\u2014an ant colony optimization approach","volume":"40","year":"2009","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)"},{"key":"key2022120707384959200_ref010","first-page":"311","article-title":"Ant colony optimization: overview and recent advances","volume-title":"Handbook of Metaheuristics","year":"2019"},{"issue":"1","key":"key2022120707384959200_ref011","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","article-title":"Ant system: optimization by a colony of cooperating agents","volume":"26","year":"1996","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)"},{"issue":"3","key":"key2022120707384959200_ref012","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1016\/j.ejor.2015.05.038","article-title":"An efficient local search heuristic with row weighting for the unicost set covering problem","volume":"246","year":"2015","journal-title":"European Journal of Operational Research"},{"key":"key2022120707384959200_ref013","article-title":"Population-based gradient descent weight learning for graph coloring problems","volume":"212","year":"2021","journal-title":"Knowledge-Based Systems"},{"key":"key2022120707384959200_ref039","first-page":"90","article-title":"Computers and intractability: a guide to the theory of np-completeness (Michael R. Garey and David S. Johnson)","volume-title":"Siam Review","year":"1982"},{"issue":"4","key":"key2022120707384959200_ref014","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/s00040-004-0770-0","article-title":"Colony structure in introduced and native populations of the invasive argentine ant, linepithema humile","volume":"51","year":"2004","journal-title":"Insectes Sociaux"},{"issue":"4","key":"key2022120707384959200_ref015","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s00040-008-1019-0","article-title":"Nest connectivity and colony structure in unicolonial argentine ants","volume":"55","year":"2008","journal-title":"Insectes Sociaux"},{"key":"key2022120707384959200_ref016","first-page":"47","article-title":"On partial covering for geometric set systems","volume-title":"34th International Symposium on Computational Geometry (SoCG 2018)","year":"2018"},{"issue":"12","key":"key2022120707384959200_ref018","doi-asserted-by":"crossref","first-page":"4529","DOI":"10.1007\/s10489-020-01799-w","article-title":"A novel ant colony optimization based on game for traveling salesman problem","volume":"50","year":"2020","journal-title":"Applied Intelligence"},{"key":"key2022120707384959200_ref019","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.asoc.2018.10.025","article-title":"On the optimal placement of cameras for surveillance and the underlying set cover problem","volume":"74","year":"2019","journal-title":"Applied Soft Computing"},{"key":"key2022120707384959200_ref020","first-page":"1569","article-title":"Solving set cover and dominating set via maximum satisfiability","year":"2020"},{"key":"key2022120707384959200_ref021","first-page":"498","article-title":"Computers and intractability. A guide to the theory of NP-completeness","volume-title":"Journal of Symbolic Logic","year":"1983"},{"issue":"7","key":"key2022120707384959200_ref022","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1109\/12.936240","article-title":"Converter placement supporting broadcast in wdm optical networks","volume":"50","year":"2001","journal-title":"IEEE Transactions on Computers"},{"issue":"4","key":"key2022120707384959200_ref023","doi-asserted-by":"crossref","first-page":"4618","DOI":"10.1016\/j.eswa.2011.09.076","article-title":"A survey: ant colony optimization based recent research and implementation on several engineering domain","volume":"39","year":"2012","journal-title":"Expert Systems with Applications"},{"key":"key2022120707384959200_ref024","volume-title":"Design and Analysis of Experiments","year":"2017"},{"issue":"1","key":"key2022120707384959200_ref025","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1177\/0160017615600222","article-title":"Maximal coverage location problem: impacts, significance, and evolution","volume":"39","year":"2016","journal-title":"International Regional Science Review"},{"key":"key2022120707384959200_ref026","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.asoc.2013.10.017","article-title":"An ant colony algorithm for the multi-compartment vehicle routing problem","volume":"15","year":"2014","journal-title":"Applied Soft Computing"},{"issue":"4","key":"key2022120707384959200_ref027","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1108\/DTA-08-2019-0140","article-title":"Mutation reduction in software mutation testing using firefly optimization algorithm","volume":"54","year":"2020","journal-title":"Data Technologies and Applications"},{"key":"key2022120707384959200_ref028","first-page":"109","article-title":"Covering problems","volume-title":"Foundations of Location Analysis","year":"2011"},{"issue":"8","key":"key2022120707384959200_ref029","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","article-title":"Max\u2013min ant system","volume":"16","year":"2000","journal-title":"Future Generation Computer Systems"},{"issue":"1","key":"key2022120707384959200_ref030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.patcog.2010.07.013","article-title":"Color image segmentation using histogram thresholding\u2013fuzzy c-means hybrid approach","volume":"44","year":"2011","journal-title":"Pattern Recognition"},{"issue":"1","key":"key2022120707384959200_ref031","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1111\/j.1472-4642.2009.00630.x","article-title":"The worldwide expansion of the argentine ant","volume":"16","year":"2010","journal-title":"Diversity and Distributions"},{"issue":"6","key":"key2022120707384959200_ref032","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1016\/j.ins.2009.11.044","article-title":"An efficient hybrid algorithm for resource-constrained project scheduling","volume":"180","year":"2010","journal-title":"Information Sciences"},{"issue":"5","key":"key2022120707384959200_ref033","first-page":"695","article-title":"Kuhn\u2013munkres parallel genetic algorithm for the set cover problem and its application to large-scale wireless sensor networks","volume":"20","year":"2015","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"key2022120707384959200_ref034","first-page":"80","article-title":"Recent progress in program analysis","volume":"30","year":"2019","journal-title":"Journal of Software"},{"issue":"3","key":"key2022120707384959200_ref035","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1108\/OHI-03-2019-B0025","article-title":"Application of hybrid ant colony algorithm in urban traffic path planning","volume":"44","year":"2019","journal-title":"Open House International"},{"issue":"7","key":"key2022120707384959200_ref036","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1007\/s00521-016-2800-z","article-title":"An efficient local search for partial vertex cover problem","volume":"30","year":"2018","journal-title":"Neural Computing and Applications"},{"key":"key2022120707384959200_ref037","article-title":"A decomposition-based memetic algorithm using helper objectives for shortwave radio broadcast resource allocation problem in China","volume":"91","year":"2020","journal-title":"Applied Soft Computing"}],"container-title":["Data Technologies and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/DTA-08-2021-0205\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/DTA-08-2021-0205\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:15:18Z","timestamp":1753398918000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/dta\/article\/56\/5\/762-781\/48119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,13]]},"references-count":37,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2022,4,13]]},"published-print":{"date-parts":[[2022,12,9]]}},"alternative-id":["10.1108\/DTA-08-2021-0205"],"URL":"https:\/\/doi.org\/10.1108\/dta-08-2021-0205","relation":{},"ISSN":["2514-9288"],"issn-type":[{"value":"2514-9288","type":"print"}],"subject":[],"published":{"date-parts":[[2022,4,13]]}}}