{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T20:03:48Z","timestamp":1725998628918},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811315947"},{"type":"electronic","value":"9789811315954"}],"license":[{"start":{"date-parts":[[2018,10,31]],"date-time":"2018-10-31T00:00:00Z","timestamp":1540944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-981-13-1595-4_60","type":"book-chapter","created":{"date-parts":[[2018,10,30]],"date-time":"2018-10-30T17:39:11Z","timestamp":1540921151000},"page":"761-769","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Performance Assessment of Thirteen Crossover Operators Using GA"],"prefix":"10.1007","author":[{"given":"Ashish","family":"Jain","sequence":"first","affiliation":[]},{"given":"Tripti","family":"Mishra","sequence":"additional","affiliation":[]},{"given":"Jyoti","family":"Grover","sequence":"additional","affiliation":[]},{"given":"Vivek","family":"Verma","sequence":"additional","affiliation":[]},{"given":"Sumit","family":"Srivastava","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,31]]},"reference":[{"key":"60_CR1","unstructured":"Goldberg, D.: Genetic Algorithm in Search Optimization and Machine Learning, Fourth Impression. Pearson Education (2009)"},{"key":"60_CR2","unstructured":"Zbigniew, M.: Genetic algorithms\u2009+\u2009data structures\u2009=\u2009evolution programs. Springer Science & Business Media (2013)"},{"key":"60_CR3","doi-asserted-by":"crossref","unstructured":"Gonzalez, T.F.: Handbook of Approximation Algorithms and Metaheuristics. CRC Press (2007)","DOI":"10.1201\/9781420010749"},{"key":"60_CR4","doi-asserted-by":"crossref","unstructured":"Mitchell, M.: An introduction to genetic algorithms. MIT Press (1998)","DOI":"10.7551\/mitpress\/3927.001.0001"},{"key":"60_CR5","unstructured":"Sivanandam, S.N., Deepa, S.N.: Introduction to Genetic Algorithm. Springer Science & Business Media (2007)"},{"key":"60_CR6","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1109\/21.286385","volume":"24","author":"M Srinivas","year":"1994","unstructured":"Srinivas, M., Patnaik, L.M.: Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans. Syst. Man Cybernet. 24, 656\u2013667 (1994)","journal-title":"IEEE Trans. Syst. Man Cybernet."},{"key":"60_CR7","doi-asserted-by":"crossref","unstructured":"Picek, S., Golub, M., Jakobovic, D.: Evaluation of crossover operator performance in genetic algorithms with binary representation. Bio-Insp. Comput. Appl. 223\u2013230 (2012)","DOI":"10.1007\/978-3-642-24553-4_31"},{"key":"60_CR8","unstructured":"Sheskin, D.: Handbook of Parametric and Nonparametric Statistical Procedures, 4th ed. Chapman and Hall\/CRC (2007)"},{"key":"60_CR9","doi-asserted-by":"crossref","unstructured":"Spears, W., Vic, A.: A study of crossover operators in genetic programming. Methodol. Intell. Syst. 409\u2013418 (1991)","DOI":"10.21236\/ADA294071"},{"key":"60_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0305-0548(93)E0024-N","volume":"22","author":"PW Poon","year":"1995","unstructured":"Poon, P.W., Carter, J.N.: Genetic algorithm crossover operators for ordering applications. Comput. Oper. Res. 22, 135\u2013147 (1995)","journal-title":"Comput. Oper. Res."},{"key":"60_CR11","first-page":"265","volume-title":"Foundations of Genetic Algorithms","author":"Larry J. Eshelman","year":"1991","unstructured":"Eshelman, L.J.: The CHC adaptive search algorithm: how to have safe search when engaging in nontraditional genetic recombination. In: Foundations of Genetic Algorithms, pp. 265\u2013283. Morgan Kaufmann, San Francisco, CA, USA (1991)"},{"key":"60_CR12","doi-asserted-by":"publisher","DOI":"10.1201\/9781482273960","volume-title":"Evolutionary Computation","author":"D Dumitrescu","year":"2000","unstructured":"Dumitrescu, D., Lazzerini, B., Jain, L.C., Dumitrescu, A.: Evolutionary Computation. CRC Press, Florida, USA (2000)"},{"key":"60_CR13","doi-asserted-by":"crossref","unstructured":"Ishibuchi, H., Tsukamoto, N., Nojima, Y.: Maintaining the diversity of solutions by non-geometric binary crossover: a worst one-max solver competition case study. In: Proceedings of the Genetic and Evolutionary Computation Conference GECCO\u201908. pp. 1111\u20131112 (2008)","DOI":"10.1145\/1389095.1389303"},{"key":"60_CR14","doi-asserted-by":"publisher","first-page":"3853","DOI":"10.1016\/j.eswa.2009.11.033","volume":"37","author":"KY Chan","year":"2010","unstructured":"Chan, K.Y., Kwong, C.K., Jiang, H., Aydin, M.E., Fogarty, T.C.: A new orthogonal array based crossover, with analysis of gene interactions, for evolutionary algorithms and its application to car door design. Expert Syst. Appl. 37, 3853\u20133862 (2010)","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"60_CR15","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/TEVC.2004.826895","volume":"8","author":"JT Tsai","year":"2004","unstructured":"Tsai, J.T., Liu, T.K., Chou, J.H.: Hybrid taguchi-genetic algorithm for global numerical optimization. IEEE Trans. Evol. Comput. 8(4), 365\u2013377 (2004)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"60_CR16","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/4235.910464","volume":"5","author":"YW Leung","year":"2001","unstructured":"Leung, Y.W., Yuping, W.: An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Trans. Evol. Comput. 5, 41\u201353 (2001)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"60_CR17","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1080\/00207160210939","volume":"79","author":"JG Digalakis","year":"2002","unstructured":"Digalakis, J.G., Konstantinos, G.M.: An experimental study of benchmarking functions for genetic algorithms. Int. J. Comput. Math. 79, 403\u2013416 (2002)","journal-title":"Int. J. Comput. Math."},{"key":"60_CR18","unstructured":"Pohlheim, H.: Geatbx Examples of Objective Functions (2006). http:\/\/www.geatbx.com\/download\/GEATbx_ObjFunExpl_v37.pdf"},{"key":"60_CR19","volume-title":"Problem definitions and evaluation criteria for the CEC 2014 special session and competition on single objective real-parameter numerical optimization","author":"JJ Liang","year":"2013","unstructured":"Liang, J.J., Qu, B.Y., Suganthan, P.N.: Problem definitions and evaluation criteria for the CEC 2014 special session and competition on single objective real-parameter numerical optimization. Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore, Computational Intelligence Laboratory (2013)"},{"key":"60_CR20","unstructured":"Liang, J.J., Qu B.Y., Suganthan P.N., Chen, Q.: Problem definitions and evaluation criteria for the CEC 2015 competition on learning-based real-parameter single objective optimization. Technical Report 201411A, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore (2014)"},{"key":"60_CR21","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ins.2014.12.016","volume":"299","author":"Z Beheshti","year":"2015","unstructured":"Beheshti, Z., Shamsuddin, S.M., Shafaatunnur, H.: Memetic binary particle swarm optimization for discrete optimization problems. Inf. Sci. 299, 58\u201384 (2015)","journal-title":"Inf. Sci."},{"key":"60_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac, J., Garcia, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evolution. Computat. 1, 3\u201318 (2011)","journal-title":"Swarm Evolution. Computat."}],"container-title":["Advances in Intelligent Systems and Computing","Soft Computing for Problem Solving"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-1595-4_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,14]],"date-time":"2020-11-14T05:20:13Z","timestamp":1605331213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-1595-4_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,31]]},"ISBN":["9789811315947","9789811315954"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-1595-4_60","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2018,10,31]]}}}