{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:49:12Z","timestamp":1761896952905,"version":"3.37.3"},"reference-count":59,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/100000190","name":"U.S. Department of Commerce","doi-asserted-by":"publisher","award":["BS123456"],"award-info":[{"award-number":["BS123456"]}],"id":[{"id":"10.13039\/100000190","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2891424","type":"journal-article","created":{"date-parts":[[2019,1,8]],"date-time":"2019-01-08T21:05:36Z","timestamp":1546981536000},"page":"9395-9405","source":"Crossref","is-referenced-by-count":8,"title":["The Minimization of Public Facilities With Enhanced Genetic Algorithms Using War Elimination"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6689-1980","authenticated-orcid":false,"given":"Pavel","family":"Seda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Mark","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuan-Wu","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milos","family":"Seda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiri","family":"Hosek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jenq-Shiou","family":"Leu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-016-9609-7"},{"key":"ref38","first-page":"1","article-title":"Senario-based heuristics with path-relinking for the robust set covering problem","author":"coco","year":"2015","journal-title":"Proc 11th Metaheuristics Int Conf (MIC)"},{"journal-title":"Effective Java","year":"2016","author":"bloch","key":"ref33"},{"key":"ref32","first-page":"963","article-title":"Analysis of the complexity of quick sort for two dimension table","volume":"30","author":"hu","year":"2007","journal-title":"Chinese Journal of Computers-Chinese Edition"},{"key":"ref31","first-page":"39315","article-title":"Performance evaluation of merge and quick sort using GPU computing with CUDA","volume":"10","author":"faujdar","year":"2015","journal-title":"Int J Appl Eng Res"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/InPar.2012.6339592"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(87)90141-X"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/189164"},{"article-title":"Systems and methods for configuring an electronic device","year":"2016","author":"aslund","key":"ref35"},{"article-title":"SDRAM memory device with an embedded NAND flash controller","year":"2010","author":"avraham","key":"ref34"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2015.07.015"},{"key":"ref27","first-page":"1","article-title":"Evolving simple symbolic regression models by multi-objective genetic programming","author":"kommenda","year":"2016","journal-title":"Genetic Programming Theory and Practice X"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2015.10.005"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/Dynamics.2016.7819075"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1049\/cp.2011.0483"},{"article-title":"Using motion planning and genetic algorithms in movement optimization of industrial robots","year":"2012","author":"bez\u00e1k","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00095"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1038\/nature14543"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2819162"},{"key":"ref23","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","author":"mitchell","year":"1998","journal-title":"An Introduction to Genetic Algorithms"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1770-5_5"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.11.005"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2015.07.019"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1038\/sj\/jors\/0411109"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/IWAST.2013.6595803"},{"key":"ref58","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.cor.2014.10.009","article-title":"A simulated annealing heuristic for the open location-routing problem","volume":"62","author":"vincent","year":"2015","journal-title":"Comput Oper Res"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2015.02.005"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/CONFLUENCE.2016.7508052"},{"article-title":"Ant colony optimization (ACO) with simulated annealing approach (SAA) for optimized multipath operation in vanet","year":"2018","author":"krishnakumar","key":"ref55"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2669106"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18965-4_27"},{"journal-title":"Set Covering","year":"2018","author":"beasley","key":"ref52"},{"journal-title":"Hospitals in Europe Healthcare Data","year":"2018","author":"pascal","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.091913.131765"},{"key":"ref40","first-page":"355","article-title":"Solving a weighted set covering problem for improving algorithms for cutting stock problems with setup costs by solution merging","author":"klocker","year":"2017","journal-title":"Proc Int Conf Comput Aided Syst Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2015.2480885"},{"journal-title":"Genetic Algorithms in Search Optimization and Machine Learning","year":"1989","author":"goldberg","key":"ref13"},{"journal-title":"Evolutionary Optimization Algorithms","year":"2013","author":"simon","key":"ref14"},{"journal-title":"Genetic Algorithms","year":"2008","author":"goldberg","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.15446\/dyna.v82n189.43092"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2015.2481463"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2846049"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2776295"},{"key":"ref4","first-page":"6","article-title":"A research for scheduling method of rehabilitation medical resource for smart traditional Chinese medicine based on genetic algorithm and its application on the treatment for dysphagia","volume":"14","author":"chen","year":"2017","journal-title":"China Medical Equipment"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SHUSER.2012.6268827"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2014.12.014"},{"journal-title":"Being Young in Europe Today—Demographic Trends","year":"2018","key":"ref8"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/2629697"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.artmed.2007.07.010"},{"journal-title":"Number of Hospitals","year":"2018","author":"organization","key":"ref9"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmsy.2016.06.006"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.10.054"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1137\/130942541"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-016-3308-y"},{"key":"ref42","first-page":"219","article-title":"Site selection of nature reserve based on the self-learning tabu search algorithm with space-ecology set covering problem: An example from daiyun mountain, southeast china","volume":"28","author":"huang","year":"2017","journal-title":"Chinese Journal of Applied Ecology"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06740-7_6"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00159-X"},{"key":"ref43","article-title":"A minimisation of network covering services in a threshold distance","author":"\u0161eda","year":"2015","journal-title":"Mendely"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08605307.pdf?arnumber=8605307","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:54:20Z","timestamp":1641988460000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8605307\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":59,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2891424","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}