{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T20:25:22Z","timestamp":1778099122784,"version":"3.51.4"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,7,29]],"date-time":"2015-07-29T00:00:00Z","timestamp":1438128000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s11047-015-9509-2","type":"journal-article","created":{"date-parts":[[2015,7,28]],"date-time":"2015-07-28T14:29:01Z","timestamp":1438093741000},"page":"503-517","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":42,"title":["A new approach for solving set covering problem using jumping particle swarm optimization method"],"prefix":"10.1007","volume":"15","author":[{"given":"S.","family":"Balaji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Revathi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,29]]},"reference":[{"issue":"10","key":"9509_CR1","doi-asserted-by":"crossref","first-page":"1118","DOI":"10.1057\/palgrave.jors.2601317","volume":"53","author":"Uwe Aickelin","year":"2002","unstructured":"Aickelin Uwe (2002) An indirect genetic algorithm for set covering problems. J Oper Res Soc 53(10):1118\u20131126","journal-title":"J Oper Res Soc"},{"key":"9509_CR3","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1111\/j.1467-8640.2010.00365.x","volume":"26","author":"RM Aliguliyev","year":"2010","unstructured":"Aliguliyev RM (2010) Clustering techniques and Discrete particle Swarm Optimization algorithm for Multi-document summarization. Comput Intell 26:420\u2013448","journal-title":"Comput Intell"},{"key":"9509_CR4","unstructured":"Al-kazemi B, Mohan CK (2002) Multi-phase discrete particle swarm optimization. In: Fourth international workshop on frontiers in evolutionary algorithms, Kinsale, Ireland"},{"key":"9509_CR5","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/j.ejor.2010.01.035","volume":"205","author":"ZN Azimi","year":"2010","unstructured":"Azimi ZN, Toth P, Galli L (2010) An electromagnetism metaheuristic for the unicost set covering problem. Eur J Oper Res 205:290\u2013300","journal-title":"Eur J Oper Res"},{"issue":"6","key":"9509_CR6","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1287\/opre.44.6.875","volume":"44","author":"E Balas","year":"1996","unstructured":"Balas E, Carrera MC (1996) A dynamic subgradient-based branch-and-bound procedure for set covering. Oper Res 44(6):875\u2013890","journal-title":"Oper Res"},{"key":"9509_CR7","doi-asserted-by":"crossref","first-page":"3162","DOI":"10.1016\/j.cor.2005.11.026","volume":"34","author":"J Bautista","year":"2007","unstructured":"Bautista J, Pereira J (2007) A GRASP algorithm to solve the unicost set covering problem. Comput Oper Res 34:3162\u20133173","journal-title":"Comput Oper Res"},{"issue":"1","key":"9509_CR8","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2","volume":"37","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) A Lagrangian heuristic for set covering problems. Nav Res Logist 37(1):151\u2013164","journal-title":"Nav Res Logist"},{"key":"9509_CR9","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"JE Beasley","year":"1996","unstructured":"Beasley JE, Chu RC (1996) A genetic algorithm for the set covering problem. Eur J Oper Res 94:392\u2013404","journal-title":"Eur J Oper Res"},{"key":"9509_CR10","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1023\/A:1018900128545","volume":"86","author":"MJ Brusco","year":"1999","unstructured":"Brusco MJ, Jacobs LW, Thompson GM (1999) A morphing procedure to supplement a simulated annealing heuristic for cost and coverage correlated set covering problems. Ann Oper Res 86:611\u2013627","journal-title":"Ann Oper Res"},{"key":"9509_CR11","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1023\/A:1019225027893","volume":"98","author":"A Caprara","year":"2000","unstructured":"Caprara A, Toth P, Fischetti M (2000) Algorithms for the set covering problem. Ann Oper Res 98:353\u2013371","journal-title":"Ann Oper Res"},{"key":"9509_CR12","first-page":"215","volume":"81","author":"S Ceria","year":"1998","unstructured":"Ceria S, Nobili P, Sassano A (1998) A Lagrangian-based heuristic for large-scale set covering problems. Math Program 81:215\u2013228","journal-title":"Math Program"},{"key":"9509_CR2","doi-asserted-by":"crossref","unstructured":"Chen AL, Yang GK, Wu ZM (2006) Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. J Zhejiang Univ Sci A 7(4):607\u2013614","DOI":"10.1631\/jzus.2006.A0607"},{"key":"9509_CR13","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s11047-009-9137-9","volume":"9","author":"S Consoli","year":"2010","unstructured":"Consoli S, P\u00e9rez JAM, Dowman KD, Mladenovi\u0107 N (2010) Discrete particle swarm optimization for the minimum labelling steiner tree problem. Nat Comput 9:29\u201346","journal-title":"Nat Comput"},{"key":"9509_CR14","doi-asserted-by":"crossref","unstructured":"Cormode G, Karloff H, Wirth A (2010) Set cover algorithms for very large datasets. In: ACM CIKM\u201910","DOI":"10.1145\/1871437.1871501"},{"key":"9509_CR15","doi-asserted-by":"crossref","unstructured":"Correa ES, Freitas AA, Johnson CG (2006) A new discrete particle swarm algorithm applied to attribute selection in a bioinformatic data set. In: Proceedings of the GECCO, pp 35\u201342","DOI":"10.1145\/1143997.1144003"},{"key":"9509_CR16","first-page":"1","volume":"7","author":"J Dem\u015bar","year":"2006","unstructured":"Dem\u015bar J (2006) Statistical comparison of classifiers over multiple data sets. J Mach Learn Res 7:1\u201330","journal-title":"J Mach Learn Res"},{"issue":"6","key":"9509_CR17","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","volume":"36","author":"ML Fisher","year":"1990","unstructured":"Fisher ML, Kedia P (1990) Optimal solution of set covering\/partitioning problems using dual heuristics. Manage Sci 36(6):674\u2013688","journal-title":"Manage Sci"},{"key":"9509_CR18","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/j.dam.2006.04.043","volume":"155","author":"P Galinier","year":"2007","unstructured":"Galinier P, Hertz A (2007) Solution techniques for the large set covering problem. Discrete Appl Math 155:312\u2013326","journal-title":"Discrete Appl Math"},{"key":"9509_CR19","unstructured":"Garc\u00eda FJM, P\u00e9rez JAM (2008) Jumping frogs optimization: a new swarm method for discrete optimization, Technical Report DEIOC 3\/2008, Department of Statistics, O.R and computing, University of La Laguna, Tenerife, Spain"},{"key":"9509_CR20","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"9509_CR21","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0377-2217(96)00161-0","volume":"101","author":"T Grossman","year":"1997","unstructured":"Grossman T, Wool A (1997) Computational experience with approximation algorithms for the set covering problem. Eur J Oper Res 101:81\u201392","journal-title":"Eur J Oper Res"},{"key":"9509_CR22","unstructured":"Guti\u00e9rrez JPC, Silva DL, P\u00e9rez JAM (2008) Exploring feasible and infeasible regions in the vehicle routing problem with time windows using a multi-objective particle swarm optimization approach. In: Proceedings of the international workshop on nature inspired cooperatives strategies for optimization, NICSO"},{"issue":"5","key":"9509_CR23","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1287\/inte.27.5.68","volume":"27","author":"E Housos","year":"1997","unstructured":"Housos E, Elmoth T (1997) Automatic optimization of subproblems in scheduling airlines crews. Interfaces 27(5):68\u201377","journal-title":"Interfaces"},{"key":"9509_CR24","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of the 4th IEEE international conference on neural networks, Perth, Australia, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"9509_CR25","first-page":"4104","volume":"5","author":"J Kennedy","year":"1997","unstructured":"Kennedy J, Eberhart R (1997) A discrete binary version of the particle swarm algorithm. IEEE Conf Syst Man Cybern 5:4104\u20134108","journal-title":"IEEE Conf Syst Man Cybern"},{"key":"9509_CR26","doi-asserted-by":"crossref","first-page":"1387","DOI":"10.1016\/j.ejor.2005.09.028","volume":"176","author":"G Lan","year":"2007","unstructured":"Lan G, DePuy GW, Whitehouse GE (2007) An effective and simple heuristic for the set covering problem. Eur J Oper Res 176:1387\u20131403","journal-title":"Eur J Oper Res"},{"key":"9509_CR27","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1109\/JSEE.2012.00049","volume":"23","author":"Y Li","year":"2012","unstructured":"Li Y, Cai Z (2012) Gravity-based heuristic for set covering problems and its application in fault diagnosis. J Syst Eng Electron 23:391\u2013398","journal-title":"J Syst Eng Electron"},{"key":"9509_CR28","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1023\/B:JMMA.0000038619.69509.bf","volume":"3","author":"J Li","year":"2004","unstructured":"Li J, Kwan RSK (2004) A meta-heuristic with orthogonal experiment for the set covering problem. J Math Model Algorithms 3:263\u2013283","journal-title":"J Math Model Algorithms"},{"key":"9509_CR29","doi-asserted-by":"crossref","first-page":"3099","DOI":"10.1016\/j.cor.2005.11.017","volume":"34","author":"C-J Liaoa","year":"2007","unstructured":"Liaoa C-J, Tseng C-T, Luarn P (2007) A discrete version of particle swarm optimization for flowshop scheduling problems. Comput Oper Res 34:3099\u20133111","journal-title":"Comput Oper Res"},{"key":"9509_CR30","first-page":"103","volume":"1","author":"PJA Martinoli","year":"2006","unstructured":"Martinoli PJA (2006) Discrete multi-valued particle swarm optimization. Proc IEEE Swarm Intell Symp 1:103\u2013110","journal-title":"Proc IEEE Swarm Intell Symp"},{"key":"9509_CR31","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1002\/etep.632","volume":"22","author":"J Moirangthem","year":"2012","unstructured":"Moirangthem J, Dash SS, Ramas R (2012) Determination of minimum break point set using paricle swarm optimization for system-wide protective relay setting and coordination. Eur Trans Electr Power 22:1126\u20131135","journal-title":"Eur Trans Electr Power"},{"key":"9509_CR32","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/S0377-2217(00)00205-8","volume":"133","author":"M Ohlsson","year":"2001","unstructured":"Ohlsson M, Peterson C, Soderberg B (2001) An efficient mean field approach to the set covering problem. Eur J Oper Res 133:583\u2013595","journal-title":"Eur J Oper Res"},{"key":"9509_CR33","doi-asserted-by":"crossref","first-page":"2807","DOI":"10.1016\/j.cor.2006.12.030","volume":"35","author":"Q-K Pan","year":"2008","unstructured":"Pan Q-K, Tasgetiren MF, Liang Y-C (2008) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput Oper Res 35:2807\u20132839","journal-title":"Comput Oper Res"},{"key":"9509_CR34","doi-asserted-by":"crossref","first-page":"3520","DOI":"10.1016\/j.cor.2005.03.030","volume":"33","author":"PM Pardalos","year":"2006","unstructured":"Pardalos PM et al (2006) Experimental analysis of approximation algorithms for the vertex cover and set covering problems. Comput Oper Res 33:3520\u20133534","journal-title":"Comput Oper Res"},{"key":"9509_CR35","doi-asserted-by":"crossref","unstructured":"Qiang L, Na QX, Shi-rang L (2009) A discrete particle swarm optimization algorithm with fully communicated information, ACM GEC, pp 393\u2013400","DOI":"10.1145\/1543834.1543887"},{"key":"9509_CR36","first-page":"504","volume":"43","author":"S Raja Balachandar","year":"2010","unstructured":"Raja Balachandar S, Kannan K (2010) A meta-heuristic algorithm for set covering problem based on gravity. WASET 43:504\u2013509","journal-title":"WASET"},{"key":"9509_CR37","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1016\/j.cie.2010.02.011","volume":"58","author":"Z-G Ren","year":"2010","unstructured":"Ren Z-G, Feng Z-R, Ke L-J, Zhang Z-J (2010) New ideas for applying ant colony optimization to the set covering problem. Comput Ind Eng 58:774\u2013784","journal-title":"Comput Ind Eng"},{"key":"9509_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-008-0224-y","volume":"121","author":"A Saxena","year":"2010","unstructured":"Saxena A, Goyal V, Lejeune MA (2010) MIP reformulations of the probabilistic set covering problem. Math Program Ser A 121:1\u201331","journal-title":"Math Program Ser A"},{"issue":"2","key":"9509_CR39","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1017\/S1759078710000279","volume":"2","author":"AA Sherbaz","year":"2010","unstructured":"Sherbaz AA, Kuseler T, Adams C, Marsalek R, Povalac K (2010) WiMAX parameters adaptation through a baseband processor using discrete particle swarm method. Int J Microw Wirel Technol 2(2):165\u2013171","journal-title":"Int J Microw Wirel Technol"},{"key":"9509_CR40","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","volume":"103","author":"XH Shi","year":"2007","unstructured":"Shi XH, Liang YC, Lee HP, Lu C, Wang QX (2007) Particle swarm optimization-based algorithms for TSP and generalized TSP. Inf Process Lett 103:169\u2013176","journal-title":"Inf Process Lett"},{"key":"9509_CR41","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1016\/S0305-0548(01)00026-0","volume":"29","author":"M Solar","year":"2002","unstructured":"Solar M, Parada V, Urrutia R (2002) A parallel genetic algorithm to solve the set-covering problem. Comput Oper Res 29:1221\u20131235","journal-title":"Comput Oper Res"},{"key":"9509_CR42","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle T, Hoos HH (2000) Max\u2013min ant system. Future Gener Comput Syst 16:889\u2013914","journal-title":"Future Gener Comput Syst"},{"key":"9509_CR43","doi-asserted-by":"crossref","unstructured":"Tasgetiren MF, Suganthan PN, Pan Q-K (2007) A discrete particle swarm optimization algorithm for the generalized traveling salesman problem. In: Proceedings of the GECCO, London, pp 158\u2013165","DOI":"10.1145\/1276958.1276980"},{"key":"9509_CR44","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.ipl.2005.02.009","volume":"94","author":"OA Telelis","year":"2005","unstructured":"Telelis OA, Zissimopoulos V (2005) Absolute O(logm) error in approximating random set covering: an average case analysis. Inf Process Lett 94:171\u2013177","journal-title":"Inf Process Lett"},{"key":"9509_CR45","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1287\/opre.19.6.1363","volume":"19","author":"C Toregas","year":"1971","unstructured":"Toregas C, Swain R, ReVelle C, Bergman L (1971) The location of emergency service facilities. Oper Res Int J 19:1363\u20131373","journal-title":"Oper Res Int J"},{"issue":"2","key":"9509_CR46","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0167-6377(84)90047-6","volume":"3","author":"FJ Vasko","year":"1984","unstructured":"Vasko FJ, Wilson GR (1984) Using a facility location algorithm to solve large set covering problems. Oper Res Lett 3(2):85\u201390","journal-title":"Oper Res Lett"},{"issue":"3","key":"9509_CR47","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1287\/opre.35.3.346","volume":"35","author":"FJ Vasko","year":"1987","unstructured":"Vasko FJ, Wolf FE (1987) Optimal selection of ingot sizes via set covering. Oper Res 35(3):346\u2013353","journal-title":"Oper Res"},{"key":"9509_CR48","doi-asserted-by":"crossref","unstructured":"Whitehouse GE, DePuy GW, Moraga RJ (2002) Meta-RaPS approach for solving the resource allocation problem. In: Proceedings of the 2002 world automation congress, Orlando, FL","DOI":"10.1109\/WAC.2002.1049428"},{"key":"9509_CR49","unstructured":"Wolsey LA (1998) Lagrangian duality. In: Wolsey (ed) Integer programming. Wiley, New York, pp 167\u2013181"},{"key":"9509_CR50","unstructured":"Hollander M, Wolfe DA (1973) Nonparametric statistical methods, 2nd ed. Wiley, New York"},{"key":"9509_CR51","unstructured":"Nemenyi PB (1963) Distribution free multiple comparisons, Ph.D. thesis. Princeton University, New Jersey"},{"key":"9509_CR52","unstructured":"Secrest BR (2001) Traveling salesman problem for surveillance mission using Particle Swarm Optimization, Master\u2019s Thesis, School of Engineering and Management of the Air Force institute of Technology"},{"key":"9509_CR53","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1016\/j.ejor.2004.10.018","volume":"172","author":"M Yagiura","year":"2006","unstructured":"Yagiura M, Kishida M, Ibaraki T (2006) A 3-flip neighborhood local search for the set covering problem. Eur J Oper Res 172:472\u2013499","journal-title":"Eur J Oper Res"},{"key":"9509_CR54","unstructured":"Yang S, Wang M, Jiao L (2004) A quantum particle swarm optimization. In: Proceedings of the CEC2004, the congress on evolutionary computing, vol 1, pp 320\u2013324"},{"key":"9509_CR55","first-page":"327","volume":"13228691","author":"Z-H Zhan","year":"2012","unstructured":"Zhan Z-H, Zhang J, Du K, Xiao J (2012) Extended binary particle swarm optimization approach for disjoint set covers problem wireless sensor networks. IEEE Conf Technol Appl Artif Intell 13228691:327\u2013331","journal-title":"IEEE Conf Technol Appl Artif Intell"},{"key":"9509_CR56","doi-asserted-by":"crossref","unstructured":"Zhang C, Sun J, Wang Y, Yang Q (2007) An improved discrete particle swarm optimization algorithm for TSP, IEEE\/WIC\/ACM international conferences on web intelligence and intelligent agent technology\u2014workshops, pp 35\u201338","DOI":"10.1109\/WI-IATW.2007.38"},{"key":"9509_CR57","doi-asserted-by":"crossref","unstructured":"Zhang H, Sun J, Liu J (2007) A new simplification method for terrain model using discrete particle swarm optimization. In: Proceedings of the 15th international symposium on advances in geographic information systems ACM GIS, pp 1\u20134","DOI":"10.1145\/1341012.1341091"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-015-9509-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-015-9509-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-015-9509-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T19:43:27Z","timestamp":1748547807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-015-9509-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,29]]},"references-count":57,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["9509"],"URL":"https:\/\/doi.org\/10.1007\/s11047-015-9509-2","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,29]]}}}