{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:34:51Z","timestamp":1725471291787},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540464846"},{"type":"electronic","value":"9783540464853"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11893295_104","type":"book-chapter","created":{"date-parts":[[2006,10,2]],"date-time":"2006-10-02T16:23:21Z","timestamp":1159806201000},"page":"946-953","source":"Crossref","is-referenced-by-count":0,"title":["Mitigating Deception in Genetic Search Through Suitable Coding"],"prefix":"10.1007","author":[{"given":"S. K.","family":"Basu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. K.","family":"Bhatia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"104_CR1","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/s00500-004-0438-8","volume":"10","author":"S.K. Basu","year":"2006","unstructured":"Basu, S.K., Bhatia, A.K.: A naive genetic approach for non-stationary constrained problems. Soft Computing\u00a010(2), 152\u2013162 (2006)","journal-title":"Soft Computing"},{"key":"104_CR2","unstructured":"Berkelaar, M.R., Dirks, J.: Lp_solve - a solver for linear programming problems with a callable subroutine library (1999), ftp:\/\/ftp.es.ele.tue.nl\/pub\/lp_solve"},{"issue":"1","key":"104_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00500-002-0240-4","volume":"8","author":"A.K. Bhatia","year":"2003","unstructured":"Bhatia, A.K., Basu, S.K.: Tackling 0\/1 knapsack problem with gene induction. Soft Computing\u00a08(1), 1\u20139 (2003)","journal-title":"Soft Computing"},{"key":"104_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-30499-9_26","volume-title":"Neural Information Processing","author":"A.K. Bhatia","year":"2004","unstructured":"Bhatia, A.K., Basu, S.K.: Packing bins using multi-chromosomal genetic representation and better-fit heuristic. In: Pal, N.R., Kasabov, N., Mudi, R.K., Pal, S., Parui, S.K. (eds.) ICONIP 2004. LNCS, vol.\u00a03316, pp. 181\u2013186. Springer, Heidelberg (2004)"},{"key":"104_CR5","volume-title":"Genetic Algorithms and Grouping Problems","author":"E. Falkenauer","year":"1998","unstructured":"Falkenauer, E.: Genetic Algorithms and Grouping Problems. John Wiley, Chichester (1998)"},{"key":"104_CR6","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)"},{"key":"104_CR7","doi-asserted-by":"crossref","unstructured":"Hancock, P.J.B.: An empirical comparison of selection methods in evolutionary algorithms. In: Fogarty, T.C. (ed.) Lecture Notes in Computer Science No. 865, pp. 80\u201394 (1994)","DOI":"10.1007\/3-540-58483-8_7"},{"issue":"3","key":"104_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1162\/evco.1999.7.3.231","volume":"7","author":"G. Harik","year":"1999","unstructured":"Harik, G., Cant\u00fa-Paz, E., Goldberg, D.E., Miller, B.L.: The gambler\u2019s ruin problem, genetic algorithms, and the sizing of populations. Evolutionary Computation\u00a07(3), 231\u2013253 (1999)","journal-title":"Evolutionary Computation"},{"issue":"4","key":"104_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1023\/A:1006504901164","volume":"12","author":"F. Herrera","year":"1998","unstructured":"Herrera, F., Lozano, M., Verdegay, J.L.: Tackling real-coded genetic algorithms: Operators and tools for behavioural analysis. Artificial Intelligence Review\u00a012(4), 265\u2013319 (1998)","journal-title":"Artificial Intelligence Review"},{"issue":"3","key":"104_CR10","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/322017.322026","volume":"24","author":"B.W.Y. Lin","year":"1977","unstructured":"Lin, B.W.Y., Rardin, R.L.: Development of a parametric generating procedure for integer programming test problems. Journal of the ACM\u00a024(3), 465\u2013472 (1977)","journal-title":"Journal of the ACM"},{"key":"104_CR11","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. John Wiley, Chichester (1988)"},{"key":"104_CR12","doi-asserted-by":"crossref","unstructured":"Reeves, C.R.: Genetic algorithms and neighbourhood search. In: Fogarty, T.C. (ed.) Lecture Notes in Computer Science No. 865, pp. 115\u2013130 (1994)","DOI":"10.1007\/3-540-58483-8_10"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11893295_104.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T20:49:35Z","timestamp":1707252575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11893295_104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540464846","9783540464853"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11893295_104","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}