{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:21:49Z","timestamp":1781104909012,"version":"3.54.1"},"reference-count":54,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,4]]},"abstract":"<jats:p>A well-known combinatorial optimization problem, known as the uncapacitated facility location problem (UFLP) is considered in this article. A deterministic heuristic algorithm and a randomized heuristic algorithm are presented to solve UFLP. Though the proposed deterministic heuristic algorithm is very simple, it produces good solution for each instance of UFLP considered in this article. The main purpose of this article is to process all the data sets of UFLP available in the literature using a single algorithm. The proposed two algorithms are applied on these test instances of UFLP to determine their effectiveness. Here, the solution obtained from the proposed randomized algorithm is at least as good as the solution produced by the proposed deterministic algorithm. Hence, the proposed deterministic algorithm gives upper bound on the solution produced by the randomized algorithm. Although the proposed deterministic algorithm gives optimal results for most of the instances of UFLP, the randomized algorithm achieves optimal results for all the instances of UFLP considered in this article including those for which the deterministic algorithm fails to achieve the optimal solutions.<\/jats:p>","DOI":"10.4018\/ijncr.2019040102","type":"journal-article","created":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T13:18:30Z","timestamp":1553174310000},"page":"18-50","source":"Crossref","is-referenced-by-count":4,"title":["Solving Uncapacitated Facility Location Problem Using Heuristic Algorithms"],"prefix":"10.4018","volume":"8","author":[{"given":"Soumen","family":"Atta","sequence":"first","affiliation":[{"name":"JIS University, Kolkata, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Priya Ranjan Sinha","family":"Mahapatra","sequence":"additional","affiliation":[{"name":"University of Kalyani, Kalyani, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anirban","family":"Mukhopadhyay","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Kalyani, Kalyani, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJNCR.2019040102-0","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00144-1"},{"key":"IJNCR.2019040102-1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.8.3.289"},{"key":"IJNCR.2019040102-2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.23.6.585"},{"key":"IJNCR.2019040102-3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018956213524"},{"key":"IJNCR.2019040102-4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30976-2_28"},{"key":"IJNCR.2019040102-5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2014.04.010"},{"key":"IJNCR.2019040102-6","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-7563-6_22"},{"key":"IJNCR.2019040102-7","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-7566-7_8"},{"key":"IJNCR.2019040102-8","author":"M.Balinski","year":"1964","journal-title":"On finding integer solutions to linear programs. Tech. rep"},{"key":"IJNCR.2019040102-9","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90266-P"},{"key":"IJNCR.2019040102-10","doi-asserted-by":"crossref","unstructured":"Beasley, J. E. (1990) OR-Library: distributing test problems by electronic mail. Journal of the operational research society, 1069-1072.","DOI":"10.1057\/jors.1990.166"},{"key":"IJNCR.2019040102-11","unstructured":"Beltran-Royo, C., Vial, J. P., & Alonso-Ayuso, A. (2007) Solving the uncapacitated facility location problem with semi-Lagrangian relaxation. Statistics and Operations Research, Rey Juan Carlos University, Mostoles, Madrid, Espa\u00f1a"},{"key":"IJNCR.2019040102-12","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70728-3"},{"key":"IJNCR.2019040102-13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74208-1_3"},{"key":"IJNCR.2019040102-14","doi-asserted-by":"publisher","DOI":"10.1137\/070708901"},{"key":"IJNCR.2019040102-15","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703405754"},{"key":"IJNCR.2019040102-16","unstructured":"Cornu\u00e9jols G, Nemhauser GL, Wolsey LA (1983) The uncapacitated facility location problem. Carnegie-Mellon univ Pittsburgh pa management sciences research group"},{"key":"IJNCR.2019040102-17","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.6.992"},{"key":"IJNCR.2019040102-18","doi-asserted-by":"publisher","DOI":"10.1007\/BF02097805"},{"key":"IJNCR.2019040102-19","unstructured":"Garey, M.R. & Johnson, D.S. (1979). Computers and intractability: a guide to NP-completeness."},{"key":"IJNCR.2019040102-20","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2016.0692"},{"key":"IJNCR.2019040102-21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.02.020"},{"key":"IJNCR.2019040102-22","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00504-0"},{"key":"IJNCR.2019040102-23","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0993"},{"key":"IJNCR.2019040102-24","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2009.4983285"},{"key":"IJNCR.2019040102-25","unstructured":"Hoefer, M. (2003). UflLib, Benchmark Instances for the Uncapacitated Facility Location Problem. Retrieved from http:\/\/www.mpi-inf.mpg.de\/departments\/d1\/projects\/benchmarks\/UflLib"},{"key":"IJNCR.2019040102-26","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.18.12.B718"},{"key":"IJNCR.2019040102-27","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600675"},{"key":"IJNCR.2019040102-28","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00300-8"},{"key":"IJNCR.2019040102-29","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-25383-1_16"},{"key":"IJNCR.2019040102-30","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/978-3-642-56656-1_11","article-title":"Probabilistic tabu search algorithm for the multi-stage uncapacitated facility location problem","author":"Y. A.Kochetov","year":"2001","journal-title":"Operations research proceedings"},{"key":"IJNCR.2019040102-31","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(89)90189-6"},{"key":"IJNCR.2019040102-32","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(83)90181-9"},{"key":"IJNCR.2019040102-33","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2013.10.012"},{"key":"IJNCR.2019040102-34","doi-asserted-by":"publisher","DOI":"10.1051\/ro:2001107"},{"key":"IJNCR.2019040102-35","doi-asserted-by":"publisher","DOI":"10.1145\/2907050"},{"key":"IJNCR.2019040102-36","first-page":"429","article-title":"Solving the uncapacitated facility location problem using message passing algorithms.","author":"N.Lazic","year":"2010","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"IJNCR.2019040102-37","author":"J.Lenstra","year":"1979","journal-title":"Complexity of packing, covering and partitioning problems"},{"key":"IJNCR.2019040102-38","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.06.014"},{"key":"IJNCR.2019040102-39","author":"J.Leung","year":"1994","journal-title":"The two-level uncapacitated facility location problem. Tech. rep"},{"key":"IJNCR.2019040102-40","doi-asserted-by":"crossref","unstructured":"Li, S. (2011). A 1.488 approximation algorithm for the uncapacitated facility location problem. In International Colloquium on Automata, Languages, and Programming (pp 77-88). Springer.","DOI":"10.1007\/978-3-642-22012-8_5"},{"key":"IJNCR.2019040102-41","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2012.01.007"},{"key":"IJNCR.2019040102-42","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45753-4_20"},{"key":"IJNCR.2019040102-43","doi-asserted-by":"publisher","DOI":"10.1007\/s13160-014-0149-1"},{"key":"IJNCR.2019040102-44","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-014-0065-z"},{"key":"IJNCR.2019040102-45","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.02.046"},{"key":"IJNCR.2019040102-46","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.09.005"},{"key":"IJNCR.2019040102-47","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258600"},{"key":"IJNCR.2019040102-48","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.07.014"},{"key":"IJNCR.2019040102-49","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47867-1_18"},{"key":"IJNCR.2019040102-50","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(84)90258-3"},{"key":"IJNCR.2019040102-51","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.01.005"},{"key":"IJNCR.2019040102-52","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-007-9127-8"},{"key":"IJNCR.2019040102-53","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0704-x"}],"container-title":["International Journal of Natural Computing Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=225822","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T10:10:41Z","timestamp":1651831841000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJNCR.2019040102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":54,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.4018\/ijncr.2019040102","relation":{},"ISSN":["1947-928X","1947-9298"],"issn-type":[{"value":"1947-928X","type":"print"},{"value":"1947-9298","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4]]}}}