{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T18:31:33Z","timestamp":1773253893181,"version":"3.50.1"},"reference-count":29,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1051\/ro:2001107","type":"journal-article","created":{"date-parts":[[2003,11,19]],"date-time":"2003-11-19T08:42:52Z","timestamp":1069231372000},"page":"127-142","source":"Crossref","is-referenced-by-count":132,"title":["Solving the simple plant location problem by genetic algorithm"],"prefix":"10.1051","volume":"35","author":[{"given":"Jozef","family":"Kratica","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Du\u0161an","family":"To\u0161ic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Filipovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivana","family":"Ljubi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2002,8,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0377-2217(85)90246-2","volume":"22","author":"Aikens","year":"1985","journal-title":"European J. Oper. Res"},{"key":"R2","unstructured":"M.L. Alves and M.T. Almeida, Simulated Annealing Algorithm for the Simple Plant Location Problem: A Computational Study.Rev. Invest.12(1992)."},{"key":"R3","unstructured":"A.A. Aqeev, V.S. Beresnev, Polynomially Solvable Cases of the Simple Plant Location Problem, inProc. of the First Integer Programming and Combinatorial Optimization Conference, edited by R. Kannan and W.R. Pulleyblank. University of Waterloo Press, ON, Canada (1990) 1-6."},{"key":"R4","first-page":"170","volume":"15","author":"Beasley","year":"1993","journal-title":"Univ. Computing"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"J.E. Beasley, Obtaining Test ProblemsviaInternet.J. Global Optim.8(1996) 429-433, http:\/\/mscmga.ms.ic.ac.uk\/info.html","DOI":"10.1007\/BF02404002"},{"key":"R6","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0377-2217(93)90118-7","volume":"65","author":"Beasley","year":"1993","journal-title":"European J. Oper. Res."},{"key":"R7","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF01585746","volume":"46","author":"Conn","year":"1990","journal-title":"Math. Programming"},{"key":"R8","unstructured":"G. Cornuejols, G.L. Nemhauser and L.A. Wolsey, The Uncapacitated Facility Location Problem, inDiscrete Location Theory, edited by P.B. Mirchandani and R.L. Francis. John Wiley & Sons (1990), Chapter 3, pp. 120-171."},{"key":"R9","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0167-6377(85)90010-0","volume":"4","author":"Dearing","year":"1985","journal-title":"Oper. Res. Lett."},{"key":"R10","unstructured":"K.E. De Jong and W.M. Spears, Using Genetic Algorithms to Solve NP-Complete Problems, inProc. of the Third International Conference on Genetic Algorithms. Morgan Kaufmann, San Mateo, CA (1989) 124-132."},{"key":"R11","unstructured":"C. De Simone and C. Mannino,Easy Instances of the Plant Location Problem, Technical Report R-427. Gennaio, University of Roma, Italy (1996)."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"R. Dorne and J.K. Hao, A New Genetic Local Search Algorithm for Graph Coloring, inProc. of the 5th Conference on Parallel Problem Solving from Nature - PPSN V. Springer-Verlag,Lecture Notes in Comput. Sci.1498(1998) 745-754.","DOI":"10.1007\/BFb0056916"},{"key":"R13","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"Erlenkotter","year":"1978","journal-title":"Oper. Res."},{"key":"R14","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0377-2217(83)90194-7","volume":"12","author":"Francis","year":"1983","journal-title":"European J. Oper. Res."},{"key":"R15","unstructured":"B. Freisleben and P. Merz, New Genetic Local Search Operators for the Traveling Salesman Problem, inProc. of the 4th Conference on Parallel Problem Solving from Nature - PPSN IV.Springer-VerlagLecture Notes in Comput. Sci.1141(1996) 890-899."},{"key":"R16","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1016\/0377-2217(94)90277-1","volume":"76","author":"Gao","year":"1994","journal-title":"European J. Oper. Res."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"V.P. Grishukhin, On Polynomial Solvability Conditions for the Simplest Plant Location Problem, inSelected topics in discrete mathematics, edited by A.K. Kelmans and S. Ivanov. American Mathematical Society, Providence, RI (1994) 37-46.","DOI":"10.1090\/trans2\/158\/05"},{"key":"R18","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0377-2217(88)90029-X","volume":"35","author":"Guignard","year":"1988","journal-title":"European J. Oper. Res."},{"key":"R19","unstructured":"K. Holmberg,Experiments with Primal-Dual Decomposition and Subgradient Methods for the Uncapacitated Facility Location Problem, Research Report LiTH-MAT\/OPT-WP-1995-08, Optimization. Department of Mathematics, Linkoping Institute of Technology, Sweden (1995)."},{"key":"R20","doi-asserted-by":"crossref","unstructured":"S. Khuri, T. Back and J. Heitkotter, An Evolutionary Approach to Combinatorial Optimization Problems, inProc. of CSC'94. Phoenix, Arizona (1994).","DOI":"10.1145\/197530.197558"},{"key":"R21","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0377-2217(89)90189-6","volume":"39","author":"Koerkel","year":"1989","journal-title":"European J. Oper. Res"},{"key":"R22","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0377-2217(83)90181-9","volume":"12","author":"Krarup","year":"1983","journal-title":"European J. Oper. Res"},{"key":"R23","first-page":"271","volume":"18","author":"Kratica","year":"1999","journal-title":"Comput. Artificial Intelligence"},{"key":"R24","unstructured":"P. Merz and B. Freisleben, A Genetic Local Search Approach to the Quadratic Assignment Problem, inProc. of the Seventh International Conference on Genetic Algorithms. Morgan Kaufmann (1997) 465-472."},{"key":"R25","unstructured":"P. Merz and B. Freisleben, Genetic Local Search for the TSP: New Results, inProc. of the 1997 IEEE International Conference on Evolutionary Computation. IEEE Press (1997) 159-164."},{"key":"R26","unstructured":"C. Ryu and M. Guignard,An Exact Algorithm for the Simple Plant Location Problem with an Aggregate Capacity Constraint, TIMS\/ORSA Meeting. Orlando, FL (1992) 92-04-09."},{"key":"R27","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0167-6377(89)90054-0","volume":"8","author":"Simao","year":"1989","journal-title":"Oper. Res. Lett"},{"key":"R28","unstructured":"G. Syswerda, Uniform Crossover in Genetic Algorithms, inProc. of the Third International Conference on Genetic Algorithms. Morgan Kaufmann, San Mateo, CA (1989) 2-9."},{"key":"R29","unstructured":"D. Whitley, The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best, inProc. of the Third International Conference on Genetic Algorithms. Morgan Kaufmann, San Mateo, CA (1989) 116-123."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2001107\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T02:49:14Z","timestamp":1585277354000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2001107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":29,"journal-issue":{"issue":"1"},"alternative-id":["ro2103"],"URL":"https:\/\/doi.org\/10.1051\/ro:2001107","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}