{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:59Z","timestamp":1740107879115,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Department of Electronics and Information Technology, Ministry of Communication and Information Technology, Government of India","award":["23011\/22\/2013-R&D in CC & BT"],"award-info":[{"award-number":["23011\/22\/2013-R&D in CC & BT"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s00500-017-2650-3","type":"journal-article","created":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T07:13:53Z","timestamp":1496301233000},"page":"1763-1771","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Mathematical analysis of schema survival for genetic algorithms having dual mutation"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9223-3973","authenticated-orcid":false,"given":"Apoorva","family":"Mishra","sequence":"first","affiliation":[]},{"given":"Anupam","family":"Shukla","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,1]]},"reference":[{"key":"2650_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2013.05.007","author":"A Banerjee","year":"2013","unstructured":"Banerjee A (2013) A novel probabilistically-guided context-sensitive crossover operator for clustering. Swarm Evol Comput. doi:\n                        10.1016\/j.swevo.2013.05.007","journal-title":"Swarm Evol Comput"},{"key":"2650_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-015-1718-1","author":"MBR Basagoiti","year":"2016","unstructured":"Basagoiti MBR, Rodriguez IRV (2016) A modified genetic algorithm applied to the elevator dispatching problem. Soft Comput. doi:\n                        10.1007\/s00500-015-1718-1","journal-title":"Soft Comput"},{"key":"2650_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2013.08.035","author":"R Faraji","year":"2014","unstructured":"Faraji R, Naji HR (2014) An efficient crossover architecture for hardware parallel implementation of genetic algorithm. Neurocomputing. doi:\n                        10.1016\/j.neucom.2013.08.035","journal-title":"Neurocomputing"},{"key":"2650_CR4","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"D Goldberg","year":"1989","unstructured":"Goldberg D (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading"},{"key":"2650_CR5","doi-asserted-by":"publisher","unstructured":"Hsu C, Cho H (2015) A genetic algorithm for the maximum edge-disjoint paths problem. Neurocomputing. doi:\n                        10.1016\/j.neucom.2012.10.046","DOI":"10.1016\/j.neucom.2012."},{"key":"2650_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.02.035","author":"Y Li","year":"2014","unstructured":"Li Y, Yu J, Tao D (2014) Genetic algorithm for spanning tree construction in P2P distributed interactive applications. Neurocomputing. doi:\n                        10.1016\/j.neucom.2014.02.035","journal-title":"Neurocomputing"},{"key":"2650_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2070-9","author":"U Mehboob","year":"2016","unstructured":"Mehboob U, Qadir J, Ali S, Vasilakos A (2016) Genetic algorithms in wireless networking: techniques, applications, and issues. Soft Comput. doi:\n                        10.1007\/s00500-016-2070-9","journal-title":"Soft Comput"},{"key":"2650_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.07.035","author":"A Mishra","year":"2016","unstructured":"Mishra A, Shukla A (2016) Mathematical analysis of the cumulative effect of novel ternary crossover operator and mutation on probability of survival of a schema. Theor Comput Sci. doi:\n                        10.1016\/j.tcs.2016.07.035","journal-title":"Theor Comput Sci"},{"key":"2650_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2061-x","author":"B Nogueira","year":"2016","unstructured":"Nogueira B, Maciel P, Tavares E, Silva RMA, Andrade E (2016) Multi-objective optimization of multimedia embedded systems using genetic algorithms and stochastic simulation. Soft Comput. doi:\n                        10.1007\/s00500-016-2061-x","journal-title":"Soft Comput"},{"key":"2650_CR10","doi-asserted-by":"publisher","unstructured":"Pawar R, Saini JS, Gopal M, Mittal AP (2011) Towards generalized expression for schemata count. Appl Soft Comput J. doi:\n                        10.1016\/j.asoc.2010.07.012","DOI":"10.1016\/j.asoc.20"},{"key":"2650_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.04.005","author":"Z Qiongbing","year":"2016","unstructured":"Qiongbing Z, Lixin D (2016) A new crossover mechanism for genetic algorithms with variable-length chromosomes for path optimization problems. Expert Syst Appl. doi:\n                        10.1016\/j.eswa.2016.04.005","journal-title":"Expert Syst Appl"},{"key":"2650_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2122-1","author":"CC Shih","year":"2016","unstructured":"Shih CC, Horng MF, Pan TS, Pan JS, Chen CY (2016) A genetic-based effective approach to path-planning of autonomous underwater glider with upstream-current avoidance in variable oceans. Soft Comput. doi:\n                        10.1007\/s00500-016-2122-1","journal-title":"Soft Comput"},{"key":"2650_CR13","doi-asserted-by":"publisher","unstructured":"Shukla A, Tiwari R, Kala R (2010) Towards hybrid and adaptive computing studies in computational intelligence. Computational intelligence. Springer, Berlin. ISBN: 9783642143434. doi:\n                        10.1007\/978-3-642-14344-1","DOI":"10.1007\/978-3-642-14344-1"},{"key":"2650_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2181-3","author":"N Thi","year":"2016","unstructured":"Thi N, Quyen P, Chen JC (2016) Hybrid genetic algorithm to solve resource constrained assembly line balancing problem in footwear manufacturing. Soft Comput. doi:\n                        10.1007\/s00500-016-2181-3","journal-title":"Soft Comput"},{"key":"2650_CR15","doi-asserted-by":"publisher","unstructured":"Uzor CJ, Gongora M, Coupland S, Passow BN (2016) Adaptive-mutation compact genetic algorithm for dynamic environments. Soft Comput. doi:\n                        10.1007\/s00500-016-2195-x","DOI":"10.1007\/s00500-016-2195-x"},{"key":"2650_CR16","unstructured":"White D (2014) An overview of schema theory. Neural Evol Comput (cs.NE) 1\u201327. \n                        arXiv:1401.2651"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-017-2650-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2650-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2650-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,5]],"date-time":"2018-03-05T02:12:17Z","timestamp":1520215937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-017-2650-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,1]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["2650"],"URL":"https:\/\/doi.org\/10.1007\/s00500-017-2650-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2017,6,1]]}}}