{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T05:08:20Z","timestamp":1781672900097,"version":"3.54.5"},"publisher-location":"Singapore","reference-count":34,"publisher":"Springer Singapore","isbn-type":[{"value":"9789811598289","type":"print"},{"value":"9789811598296","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-981-15-9829-6_46","type":"book-chapter","created":{"date-parts":[[2021,3,17]],"date-time":"2021-03-17T22:02:50Z","timestamp":1616018570000},"page":"581-598","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["An Overview of Crossover Techniques in\u00a0Genetic Algorithm"],"prefix":"10.1007","author":[{"given":"Joseph L.","family":"Pachuau","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arnab","family":"Roy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anish","family":"Kumar Saha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,3,18]]},"reference":[{"issue":"2","key":"46_CR1","first-page":"224","volume":"2","author":"N Kumbharana","year":"2013","unstructured":"Kumbharana, N., Pandey, G.M.: A comparative study of aco, ga and sa for solving travelling salesman problem. Int. J. Soc. Appl. Comput. Sci. 2(2), 224\u2013228 (2013)","journal-title":"Int. J. Soc. Appl. Comput. Sci."},{"issue":"1","key":"46_CR2","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.ejor.2013.01.043","volume":"228","author":"S Yuan","year":"2013","unstructured":"Yuan, S., Skinner, B., Huang, S., Liu, D.: A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms. Eur. J. Oper. Res. 228(1), 72\u201382 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"46_CR3","first-page":"474","volume":"91","author":"R Nakano","year":"1991","unstructured":"Nakano, R., Yamada, T.: Conventional genetic algorithm for job shop problems. ICGA 91, 474\u2013479 (1991)","journal-title":"ICGA"},{"issue":"1","key":"46_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0165-1889(94)90067-1","volume":"18","author":"J Arifovic","year":"1994","unstructured":"Arifovic, J.: Genetic algorithm learning and the cobweb model. J. Econom. Dynam. Control 18(1), 3\u201328 (1994)","journal-title":"J. Econom. Dynam. Control"},{"key":"46_CR5","unstructured":"Jin-Yu, Z., Yan, C., Xian-Xiang, H.: Edge detection of images based on improved sobel operator and genetic algorithms. In: 2009 International Conference on Image Analysis and Signal Processing, pp.\u00a031\u201335. IEEE (2009)"},{"issue":"1\u20133","key":"46_CR6","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/S0045-7949(00)00089-4","volume":"78","author":"O Hasan\u00e7ebi","year":"2000","unstructured":"Hasan\u00e7ebi, O., Erbatur, F.: Evaluation of crossover techniques in genetic algorithm based optimum structural design. Comput. Struct. 78(1\u20133), 435\u2013448 (2000)","journal-title":"Comput. Struct."},{"issue":"15","key":"46_CR7","first-page":"3","volume":"42","author":"SR Sutar","year":"2012","unstructured":"Sutar, S.R., Bichkar, R.S.: University timetabling based on hard constraints using genetic algorithm. Int. J. Comput. Appl. 42(15), 3\u20135 (2012)","journal-title":"Int. J. Comput. Appl."},{"issue":"2","key":"46_CR8","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/j.ejor.2017.07.027","volume":"265","author":"RL Kadri","year":"2018","unstructured":"Kadri, R.L., Boctor, F.F.: An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: the single mode case. Eur. J. Oper. Res. 265(2), 454\u2013462 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"Rajesh, K., Visali, N., Sreenivasulu, N.: Optimal load scheduling of thermal power plants by genetic algorithm. In: Emerging Trends in Electrical, Communications, and Information Technologies, pp.\u00a0397\u2013409, Springer (2020)","DOI":"10.1007\/978-981-13-8942-9_33"},{"issue":"5","key":"46_CR10","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1007\/s10845-015-1074-0","volume":"28","author":"Y-K Lin","year":"2017","unstructured":"Lin, Y.-K., Chong, C.S.: Fast ga-based project scheduling for computing resources allocation in a cloud manufacturing system. J. Intell. Manufact. 28(5), 1189\u20131201 (2017)","journal-title":"J. Intell. Manufact."},{"key":"46_CR11","doi-asserted-by":"publisher","first-page":"1450","DOI":"10.1016\/j.jclepro.2016.11.115","volume":"167","author":"Y Xiao","year":"2017","unstructured":"Xiao, Y., Konak, A.: A genetic algorithm with exact dynamic programming for the green vehicle routing and scheduling problem. Journal of Cleaner Production 167, 1450\u20131463 (2017)","journal-title":"Journal of Cleaner Production"},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"Roeva, O., Fidanova, S., Paprzycki, M.: Population size influence on the genetic and ant algorithms performance in case of cultivation process modeling. In: Recent Advances in Computational Optimization, pp.\u00a0107\u2013120, Springer (2015)","DOI":"10.1007\/978-3-319-12631-9_7"},{"key":"46_CR13","doi-asserted-by":"crossref","unstructured":"Shukla, A., Pandey, H.M., Mehrotra, D.: Comparative review of selection techniques in genetic algorithm. In: 2015 International Conference on Futuristic Trends on Computational Analysis and Knowledge Management (ABLAZE), pp.\u00a0515\u2013519, IEEE (2015)","DOI":"10.1109\/ABLAZE.2015.7154916"},{"key":"46_CR14","doi-asserted-by":"crossref","unstructured":"Haupt, R.L.: Optimum population size and mutation rate for a simple real genetic algorithm that optimizes array factors. In: IEEE Antennas and Propagation Society International Symposium. Transmitting Waves of Progress to the Next Millennium. 2000 Digest. Held in conjunction with: USNC\/URSI National Radio Science Meeting (C), vol.\u00a02, pp.\u00a01034\u20131037, IEEE (2000)","DOI":"10.1109\/APS.2000.875398"},{"key":"46_CR15","doi-asserted-by":"crossref","unstructured":"Safe, M., Carballido, J., Ponzoni, I., Brignole, N.: On stopping criteria for genetic algorithms. In: Brazilian Symposium on Artificial Intelligence, pp.\u00a0405\u2013413, Springer (2004)","DOI":"10.1007\/978-3-540-28645-5_41"},{"key":"46_CR16","unstructured":"Murata, T., Ishibuchi, H.: Performance evaluation of genetic algorithms for flowshop scheduling problems. In: Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence, pp.\u00a0812\u2013817, IEEE (1994)"},{"issue":"1","key":"46_CR17","first-page":"305","volume":"5","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz, Z., Nazhiyath, G., Michalewicz, M.: A note on usefulness of geometrical crossover for numerical optimization problems. Evol. Program. 5(1), 305\u2013312 (1996)","journal-title":"Evol. Program."},{"key":"46_CR18","doi-asserted-by":"crossref","unstructured":"Wright, A.H.: Genetic algorithms for real parameter optimization. In: Foundations of Genetic Algorithms, vol.\u00a01, pp.\u00a0205\u2013218, Elsevier (1991)","DOI":"10.1016\/B978-0-08-050684-5.50016-1"},{"key":"46_CR19","doi-asserted-by":"crossref","unstructured":"Eshelman, L.J., Schaffer, J.D.: Real-coded genetic algorithms and interval-schemata. In: Foundations of Genetic Algorithms, vol.\u00a02, pp.\u00a0187\u2013202, Elsevier (1993)","DOI":"10.1016\/B978-0-08-094832-4.50018-0"},{"issue":"1","key":"46_CR20","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1016\/j.amc.2006.10.047","volume":"188","author":"K Deep","year":"2007","unstructured":"Deep, K., Thakur, M.: A new crossover operator for real coded genetic algorithms. Appl. Math. Comput. 188(1), 895\u2013911 (2007)","journal-title":"Appl. Math. Comput."},{"key":"46_CR21","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1109\/LAWP.2005.846432","volume":"4","author":"E Bort","year":"2005","unstructured":"Bort, E., Franceschini, G., Massa, A., Rocca, P.: Improving the effectiveness of ga-based approaches to microwave imaging through an innovative parabolic crossover. IEEE Antennas Wireless Propag. Lett. 4, 138\u2013142 (2005)","journal-title":"IEEE Antennas Wireless Propag. Lett."},{"key":"46_CR22","unstructured":"Moscato, P., et\u00a0al.: On genetic crossover operators for relative order preservation. C3P Report, vol.\u00a0778 (1989)"},{"key":"46_CR23","unstructured":"Goldberg, D.E., Lingle, R., et\u00a0al.: Alleles, loci, and the traveling salesman problem. In: Proceedings of an International Conference on Genetic Algorithms and their Applications, vol.\u00a0154, pp.\u00a0154\u2013159, Lawrence Erlbaum, Hillsdale, NJ (1985)"},{"key":"46_CR24","unstructured":"Oliver, I.M., Smith, D.J., Holland, J.R.C.: A study of permutation crossover operators on the traveling salesman problem. In: ICGA (1987)"},{"key":"46_CR25","first-page":"133","volume":"89","author":"LD Whitley","year":"1989","unstructured":"Whitley, L.D., Starkweather, T., Fuquay, D.: Scheduling problems and traveling salesmen: the genetic edge recombination operator. ICGA 89, 133\u201340 (1989)","journal-title":"ICGA"},{"issue":"6","key":"46_CR26","first-page":"96","volume":"3","author":"ZH Ahmed","year":"2010","unstructured":"Ahmed, Z.H.: Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator. Int. J. Biometrics Bioinform. (IJBB) 3(6), 96 (2010)","journal-title":"Int. J. Biometrics Bioinform. (IJBB)"},{"key":"46_CR27","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.cie.2019.05.012","volume":"133","author":"A Arram","year":"2019","unstructured":"Arram, A., Ayob, M.: A novel multi-parent order crossover in genetic algorithm for combinatorial optimization problems. Comput. Ind. Eng. 133, 267\u2013274 (2019)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"46_CR28","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/BF02480863","volume":"4","author":"M Gen","year":"2000","unstructured":"Gen, M., Choi, J., Ida, K.: Improved genetic algorithm for generalized transportation problem. Artif. Life Rob. 4(2), 96\u2013102 (2000)","journal-title":"Artif. Life Rob."},{"key":"46_CR29","doi-asserted-by":"crossref","unstructured":"Fatyanosa, T.N., Bachtiar, F.A., Data, M.: Feature selection using variable length chromosome genetic algorithm for sentiment analysis. In: 2018 International Conference on Sustainable Information Engineering and Technology (SIET), pp.\u00a027\u201332. IEEE (2018)","DOI":"10.1109\/SIET.2018.8693190"},{"key":"46_CR30","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.eswa.2016.04.005","volume":"60","author":"Z Qiongbing","year":"2016","unstructured":"Qiongbing, Z., Lixin, D.: A new crossover mechanism for genetic algorithms with variable-length chromosomes for path optimization problems. Expert Syst. Appl. 60, 183\u2013189 (2016)","journal-title":"Expert Syst. Appl."},{"issue":"06","key":"46_CR31","first-page":"774","volume":"6","author":"E Anand","year":"2016","unstructured":"Anand, E., Panneerselvam, R.: A study of crossover operators for genetic algorithm and proposal of a new crossover operator to solve open shop scheduling problem. Am. J. Ind. Bus. Manage. 6(06), 774 (2016)","journal-title":"Am. J. Ind. Bus. Manage."},{"key":"46_CR32","doi-asserted-by":"crossref","unstructured":"Akter, S., Nahar, N., ShahadatHossain, M., Andersson, K.: A new crossover technique to improve genetic algorithm and its application to tsp. In: 2019 International Conference on Electrical, Computer and Communication Engineering (ECCE), pp.\u00a01\u20136. IEEE (2019)","DOI":"10.1109\/ECACE.2019.8679367"},{"issue":"2","key":"46_CR33","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/TITS.2008.922884","volume":"9","author":"X-B Hu","year":"2008","unstructured":"Hu, X.-B., Di Paolo, E.: Binary-representation-based genetic algorithm for aircraft arrival sequencing and scheduling. IEEE Trans. Intell. Trans. Syst. 9(2), 301\u2013310 (2008)","journal-title":"IEEE Trans. Intell. Trans. Syst."},{"issue":"2","key":"46_CR34","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1109\/JIOT.2018.2795548","volume":"5","author":"Z Shen","year":"2018","unstructured":"Shen, Z., Yu, H., Yu, L., Miao, C., Chen, Y., Lesser, V.R.: Dynamic generation of internet of things organizational structures through evolutionary computing. IEEE Int. Things J. 5(2), 943\u2013954 (2018)","journal-title":"IEEE Int. Things J."}],"container-title":["Smart Innovation, Systems and Technologies","Modeling, Simulation and Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-9829-6_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T05:39:59Z","timestamp":1724650799000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-9829-6_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9789811598289","9789811598296"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-9829-6_46","relation":{},"ISSN":["2190-3018","2190-3026"],"issn-type":[{"value":"2190-3018","type":"print"},{"value":"2190-3026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"18 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}