{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T04:03:15Z","timestamp":1747713795048,"version":"3.40.5"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1023\/a:1016536623961","type":"journal-article","created":{"date-parts":[[2002,12,29]],"date-time":"2002-12-29T03:32:49Z","timestamp":1041132769000},"page":"503-514","source":"Crossref","is-referenced-by-count":10,"title":["Enhanced Direct and Indirect Genetic Algorithm Approaches for a Mall Layout and Tenant Selection Problem"],"prefix":"10.1007","volume":"8","author":[{"given":"Uwe","family":"Aickelin","sequence":"first","affiliation":[]},{"given":"Kathryn A.","family":"Dowsland","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5091608_CR1","volume-title":"Genetic Algorithms for Multiple-Choice Optimisation Problems","author":"U. Aickelin","year":"1999","unstructured":"Aickelin, U. (1999). \u201cGenetic Algorithms for Multiple-Choice Optimisation Problems.\u201d Ph.D. Dissertation, University of Wales, Swansea, United Kingdom."},{"key":"5091608_CR2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/(SICI)1099-1425(200005\/06)3:3<139::AID-JOS41>3.0.CO;2-2","volume":"3","author":"U. Aickelin","year":"2000","unstructured":"Aickelin, U. and K. Dowsland. (2000). \u201cExploiting Problem Structure in a Genetic Algorithm Approach to a Nurse Rostering Problem.\u201d Journal of Scheduling 3, 139\u2013153.","journal-title":"Journal of Scheduling"},{"key":"5091608_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/inte.18.2.1","volume":"18","author":"J. Bean","year":"1988","unstructured":"Bean, J., C. Noon, S. Ryan, and G. Salton. (1988). \u201cSelecting Tenants in a Shopping Mall.\u201d Interfaces 18, 1\u20139.","journal-title":"Interfaces"},{"key":"5091608_CR4","first-page":"61","volume-title":"Proceedings of the First International Reference on Genetic Algorithms and their Applications","author":"L. Davis","year":"1985","unstructured":"Davis, L. (1985). \u201cAdapting Operator Probabilities in Genetic Algorithms.\u201d In J. Grefenstette (ed.), Proceedings of the First International Reference on Genetic Algorithms and their Applications. Hillsdale, NJ: Erlbaum, pp. 61\u201367."},{"key":"5091608_CR5","first-page":"5","volume-title":"Foundations of Genetic Algorithms 2","author":"K. De Jong","year":"1993","unstructured":"De Jong, K. (1993). \u201cGenetic Algorithms are NOT Function Optimisers.\u201d In D. Whitley (ed.), Foundations of Genetic Algorithms 2. San Mateo: Morgan Kaufmann, pp. 5\u201317."},{"key":"5091608_CR6","first-page":"4","volume":"8","author":"K. Deb","year":"1996","unstructured":"Deb, K. (1996). \u201cGenetic Algorithms for Function Optimisation.\u201d Genetic Algorithms and Soft Computing 8, 4\u201331.","journal-title":"Genetic Algorithms and Soft Computing"},{"key":"5091608_CR7","doi-asserted-by":"crossref","DOI":"10.1109\/9780470544600","volume-title":"Evolutionary Computation: The Fossil Record.","author":"D. Fogel","year":"1998","unstructured":"Fogel, D. (1998). Evolutionary Computation: The Fossil Record. New York: IEEE Press, Physica-Verlag."},{"key":"5091608_CR8","first-page":"154","volume-title":"Proceedings of the First International Reference on Genetic Algorithms and their Applications","author":"D. Goldberg","year":"1985","unstructured":"Goldberg, D. and R. Lingle. (1985). \u201cAlleles, Loci, and the Travelling Salesman Problem.\u201d In J. Grefenstette (ed.), Proceedings of the First International Reference on Genetic Algorithms and their Applications. Hillsdale, NJ: Erlbaum, pp. 154\u2013159."},{"key":"5091608_CR9","first-page":"92","volume":"45","author":"A. Hadj-Alouane","year":"1997","unstructured":"Hadj-Alouane, A. and J. Bean. (1997). \u201cA Genetic Algorithm For The Multiple-Choice Integer Program.\u201d INFORMS 45, 92\u2013101.","journal-title":"INFORMS"},{"key":"5091608_CR10","volume-title":"Adaption in Natural and Artificial Systems","author":"J. Holland","year":"1976","unstructured":"Holland, J. (1976). Adaption in Natural and Artificial Systems. Ann Arbor: University of Michigan Press."},{"key":"5091608_CR11","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/BF02125404","volume":"63","author":"C. Reeves","year":"1996","unstructured":"Reeves, C. (1996). \u201cHybrid Genetic Algorithms for Bin-Packing and Related Problems.\u201d Annals of OR 63, 371\u2013396.","journal-title":"Annals of OR"},{"key":"5091608_CR12","first-page":"231","volume":"45","author":"C. Reeves","year":"1997","unstructured":"Reeves, C. (1997). \u201cGenetic Algorithms for the Operations Researcher.\u201d INFORMS 45, 231\u2013250.","journal-title":"INFORMS"},{"key":"5091608_CR13","first-page":"499","volume-title":"Proceedings of the Fifth International Reference on Genetic Algorithms","author":"A. Smith","year":"1993","unstructured":"Smith, A. and D. Tate. (1993). \u201cGenetic Optimization Using a Penalty Function.\u201d In S. Forrest (ed.), Proceedings of the Fifth International Reference on Genetic Algorithms. San Mateo: Morgan Kaufmann, pp. 499\u2013505."},{"key":"5091608_CR14","first-page":"335","volume-title":"Handbook of Genetic Algorithms","author":"G. Syswerda","year":"1996","unstructured":"Syswerda, G. (1996). \u201cSchedule Optimisation Using Genetic Algorithms.\u201d In L. Davis (ed.), Handbook of Genetic Algorithms. London: International Thomson Computer Press, pp. 335\u2013349."},{"issue":"2","key":"5091608_CR15","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1162\/evco.1998.6.2.161","volume":"6","author":"A. Tuson","year":"1998","unstructured":"Tuson, A. and P. Ross. (1998). \u201cAdapting Operator Settings in Genetic Algorithms.\u201d Evolutionary Computation 6(2), 161\u2013184.","journal-title":"Evolutionary Computation"},{"key":"5091608_CR16","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1016\/0305-0548(94)90022-1","volume":"21","author":"S. Yeralan","year":"1994","unstructured":"Yeralan, S. and C.-S. Lin. (1994). \u201cGenetic SearchWith Dynamic Operating Disciples.\u201d Computers and Operations Research 21, 941\u2013954.","journal-title":"Computers and Operations Research"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1016536623961.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1016536623961\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1016536623961.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:12:03Z","timestamp":1747653123000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1016536623961"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["5091608"],"URL":"https:\/\/doi.org\/10.1023\/a:1016536623961","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}