{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:50:30Z","timestamp":1767707430419},"reference-count":16,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1996,6]]},"DOI":"10.1016\/0305-0548(95)00063-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:08:45Z","timestamp":1027598925000},"page":"587-596","source":"Crossref","is-referenced-by-count":120,"title":["Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems"],"prefix":"10.1016","volume":"23","author":[{"given":"Christopher R.","family":"Houck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey A.","family":"Joines","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael G.","family":"Kay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(95)00063-1_BIB1","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/opre.20.1.94","article-title":"The transportation-location problems","volume":"20","author":"Cooper","year":"1972","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(95)00063-1_BIB2","first-page":"443","article-title":"Properties and solution methods for large location-allocation problems","volume":"33","author":"Love","year":"1982","journal-title":"J. Ops Res. Soc."},{"key":"10.1016\/0305-0548(95)00063-1_BIB3","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1002\/nav.3800220304","article-title":"A computational procedure for the exact solution of location-allocation problems with rectangular distances","volume":"22","author":"Love","year":"1975","journal-title":"Naval Res. Logist. Q."},{"key":"10.1016\/0305-0548(95)00063-1_BIB4","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1111\/j.1467-8667.1993.tb00226.x","article-title":"A new approach to solving applied location\/allocation problems","volume":"8","author":"Daskin","year":"1993","journal-title":"Microcomputers Civil Engng"},{"key":"10.1016\/0305-0548(95)00063-1_BIB5","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1287\/opre.11.3.331","article-title":"Location-allocation problems","volume":"11","author":"Cooper","year":"1963","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(95)00063-1_BIB6","series-title":"Facilities Location: Models & Methods","author":"Love","year":"1988"},{"key":"10.1016\/0305-0548(95)00063-1_BIB7","series-title":"Genetic Algorithms and Simulated Annealing","author":"Davis","year":"1987"},{"key":"10.1016\/0305-0548(95)00063-1_BIB8","series-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Michalewicz","year":"1992"},{"key":"10.1016\/0305-0548(95)00063-1_BIB9","series-title":"Facility Layout and Location: An Analytical Approach","author":"Francis","year":"1992"},{"key":"10.1016\/0305-0548(95)00063-1_BIB10","series-title":"Distribution Management: Mathematical Modeling and Practical Analysis","author":"Eilon","year":"1971"},{"key":"10.1016\/0305-0548(95)00063-1_BIB11","author":"Davis","year":"1991"},{"key":"10.1016\/0305-0548(95)00063-1_BIB12","series-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/0305-0548(95)00063-1_BIB13","series-title":"Adaptation in Natural and Artificial Systems","author":"Holland","year":"1975"},{"key":"10.1016\/0305-0548(95)00063-1_BIB14","series-title":"Proc. IEEE Conf. Evolutionary Computation","first-page":"579","article-title":"On the use of non-stationary penalty functions to solve constrained optimization problems with genetic algorithms","author":"Joines","year":"1994"},{"key":"10.1016\/0305-0548(95)00063-1_BIB15","series-title":"Simulation Modeling and Analysis","author":"Law","year":"1991"},{"key":"10.1016\/0305-0548(95)00063-1_BIB16","first-page":"28","article-title":"The generalization of Student's problem when several different population variances are involved","volume":"34","author":"Welch","year":"1947","journal-title":"Biometrika"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054895000631?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054895000631?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:59:00Z","timestamp":1556672340000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054895000631"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["0305054895000631"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(95)00063-1","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}