{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T15:48:42Z","timestamp":1757778522939},"reference-count":29,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1995,12]]},"DOI":"10.1016\/0020-0190(95)00113-x","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T01:23:41Z","timestamp":1051233821000},"page":"281-292","source":"Crossref","is-referenced-by-count":9,"title":["Abranching process model for genetic algorithms"],"prefix":"10.1016","volume":"56","author":[{"given":"Uday Kumar","family":"Chakraborty","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00113-X_BIB1","series-title":"A Connectionist Machine for Genetic Hill-climbing","author":"Ackley","year":"1987"},{"key":"10.1016\/0020-0190(95)00113-X_BIB2","series-title":"Foundations of Genetic Algorithms","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/B978-0-08-050684-5.50007-0","article-title":"An extension to the theory of convergence and a proof of the time complexity of genetic algorithms","author":"Ankenbrandt","year":"1991"},{"key":"10.1016\/0020-0190(95)00113-X_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/evco.1993.1.1.1","article-title":"An overview of evolutionary algorithms for parameter optimization","volume":"1","author":"Back","year":"1993","journal-title":"Evolutionary Comput."},{"key":"10.1016\/0020-0190(95)00113-X_BIB4","series-title":"Discrete-Event System Simulation","author":"Banks","year":"1984"},{"key":"10.1016\/0020-0190(95)00113-X_BIB5","series-title":"Proc. 4th Internat. Conf. on Genetic Algorithms","year":"1991"},{"key":"10.1016\/0020-0190(95)00113-X_BIB6","first-page":"13","article-title":"Artificial genetic search in the N-queens problem","volume":"Vol. 1","author":"Chakraborty","year":"1991"},{"key":"10.1016\/0020-0190(95)00113-X_BIB7","series-title":"Proc. IEEE Internat. Conf. TENCON '92","first-page":"433","article-title":"Bit-string optimization in a brachytherapy dosimetry problem","author":"Chakraborty","year":"1992"},{"key":"10.1016\/0020-0190(95)00113-X_BIB8","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0190(93)90027-7","article-title":"Using reliability analysis to estimate the number of generations to convergence in genetic algorithms","volume":"46","author":"Chakraborty","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(95)00113-X_BIB9","first-page":"91","article-title":"Optimization in the reliability problem: an inferential search approach","volume":"Vol. 1","author":"Chakraborty","year":"1991"},{"key":"10.1016\/0020-0190(95)00113-X_BIB10","article-title":"An analysis of the behavior of a class of genetic adaptive systems","author":"De Jong","year":"1975"},{"key":"10.1016\/0020-0190(95)00113-X_BIB11","volume":"Vol. 1","author":"Feller","year":"1968"},{"key":"10.1016\/0020-0190(95)00113-X_BIB12","series-title":"Proc. 5th Internat. Conf. on Genetic Algorithms","year":"1993"},{"key":"10.1016\/0020-0190(95)00113-X_BIB13","series-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/0020-0190(95)00113-X_BIB14","series-title":"Proc. 3rd Internat. Conf. on Genetic Algorithms","first-page":"70","article-title":"Sizing populations for serial and parallel genetic algorithms","author":"Goldberg","year":"1989"},{"key":"10.1016\/0020-0190(95)00113-X_BIB15","series-title":"Foundations of Genetic Algorithms","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/B978-0-08-050684-5.50008-2","article-title":"A comparative analysis of selection schemes used in genetic algorithms","author":"Goldberg","year":"1991"},{"key":"10.1016\/0020-0190(95)00113-X_BIB16","first-page":"493","article-title":"Messy genetic algorithms: Motivation, analysis, and first results","volume":"3","author":"Goldberg","year":"1989","journal-title":"Complex Systems"},{"key":"10.1016\/0020-0190(95)00113-X_BIB17","series-title":"Proc. 2nd Internat. Conf. on Genetic Algorithms","first-page":"1","article-title":"Finite markov chain analysis of genetic algorithms","author":"Goldberg","year":"1987"},{"key":"10.1016\/0020-0190(95)00113-X_BIB18","series-title":"Proc. 2nd Internat. Conf. on Genetic Algorithms","year":"1987"},{"key":"10.1016\/0020-0190(95)00113-X_BIB19","first-page":"75","article-title":"Deception considered harmful","volume":"Vol. 2","author":"Grefenstette","year":"1993"},{"key":"10.1016\/0020-0190(95)00113-X_BIB20","series-title":"The Theory of Branching Processes","author":"Harris","year":"1963"},{"key":"10.1016\/0020-0190(95)00113-X_BIB21","series-title":"Adaptation in Natural and Artificial Systems","author":"Holland","year":"1975"},{"key":"10.1016\/0020-0190(95)00113-X_BIB22","series-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Michalewicz","year":"1992"},{"key":"10.1016\/0020-0190(95)00113-X_BIB23","series-title":"Foundations of Genetic Algorithms","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1016\/B978-0-08-050684-5.50023-9","article-title":"Evolution in time and space \u2014 The parallel genetic algorithm","author":"M\u00fchlenbein","year":"1991"},{"key":"10.1016\/0020-0190(95)00113-X_BIB24","first-page":"259","article-title":"Non-linear genetic representations","volume":"Vol. 2","author":"Radcliffe","year":"1992"},{"key":"10.1016\/0020-0190(95)00113-X_BIB25","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF01531276","article-title":"The algebra of genetic algorithms","volume":"10","author":"Radcliffe","year":"1994","journal-title":"Ann. Math. and Artificial Intelligence"},{"key":"10.1016\/0020-0190(95)00113-X_BIB26","series-title":"Proc. 3rd Internat. Conf. on Genetic Algorithms","year":"1989"},{"key":"10.1016\/0020-0190(95)00113-X_BIB27","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1214\/aoms\/1177730256","article-title":"Table for estimating the goodness of fit of empirical distributions","volume":"19","author":"Smirnov","year":"1948","journal-title":"Ann. of Math. Statist."},{"key":"10.1016\/0020-0190(95)00113-X_BIB28","series-title":"Proc. 3rd Internat. Conf. on Genetic Algorithms","first-page":"2","article-title":"Uniform crossover in genetic algorithms","author":"Syswerda","year":"1989"},{"key":"10.1016\/0020-0190(95)00113-X_BIB29","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0004-3702(91)90019-G","article-title":"Generalizing the notion of schema in genetic algorithms","volume":"50","author":"Vose","year":"1991","journal-title":"Artificial Intelligence"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500113X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500113X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T02:59:04Z","timestamp":1555297144000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909500113X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["002001909500113X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00113-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}