{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T22:14:43Z","timestamp":1773699283315,"version":"3.50.1"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100006749","name":"Faculty of Informatics, Burapha University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006749","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3117987","type":"journal-article","created":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T04:25:24Z","timestamp":1633407924000},"page":"137902-137922","source":"Crossref","is-referenced-by-count":8,"title":["Ring-Based Crossovers in Genetic Algorithms: Characteristic Decomposition and Their Generalization"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8827-2902","authenticated-orcid":false,"given":"Sunisa","family":"Rimcharoen","sequence":"first","affiliation":[{"name":"Faculty of Informatics, Burapha University, Saen Suk, Thailand"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8883-3629","authenticated-orcid":false,"given":"Nutthanon","family":"Leelathakul","sequence":"additional","affiliation":[{"name":"Faculty of Informatics, Burapha University, Saen Suk, Thailand"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Problem definitions and evaluation criteria for the CEC 2014 special session and competition on single objective real-parameter numerical optimization","author":"liang","year":"2013"},{"key":"ref38","article-title":"Travelling salesman and sequence scheduling: Quality solutions using genetic edge recombination","author":"whitley","year":"1991","journal-title":"Handbook of Genetic Algorithms"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.08.025"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568220"},{"key":"ref31","first-page":"43","article-title":"Initial population for genetic algorithms: A metric approach","author":"diaz-gomez","year":"2007","journal-title":"Proc Int Conf Genet Evol Methods"},{"key":"ref30","first-page":"511","article-title":"Escaping hierarchical traps with competent genetic algorithm","author":"pelikan","year":"2001","journal-title":"Proc Genet Evol Comput Conf"},{"key":"ref37","first-page":"154","article-title":"Alleles, loci, and the traveling salesman problem","author":"goldberg","year":"1985","journal-title":"Proc 1st Int Conf Genet Algorithms Their Appl"},{"key":"ref36","article-title":"Genetic algorithms: Basic ideas, variants and analysis","author":"sharapov","year":"2007","journal-title":"Vision Systems Segmentation and Pattern Recognition"},{"key":"ref35","first-page":"73","article-title":"Average concept of crossover operator in real coded genetic algorithm","author":"rahman","year":"2013","journal-title":"Proc Econ Develop Res"},{"key":"ref34","article-title":"Multi-modal optimization using genetic algorithms","author":"grueninger","year":"1996"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113381"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1504\/IJAISC.2014.059280"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100759"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JCSSE.2017.8025922"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1995.489183"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.11.089"},{"key":"ref15","first-page":"1286","article-title":"A novel crossover operator for genetic algorithms: Ring crossover","volume":"1","author":"kaya","year":"2012","journal-title":"Proc Inf Comput Sci"},{"key":"ref16","first-page":"525","article-title":"BOA: The Bayesian optimization algorithm","author":"pelikan","year":"1999","journal-title":"Proc 1st Ann Conf Genet Evol Comput (GECCO)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01530778"},{"key":"ref18","first-page":"61","article-title":"Improving search in genetic algorithms","author":"booker","year":"1987","journal-title":"Proc Genet Algorithm Simulation Annealing"},{"key":"ref19","first-page":"2","article-title":"Uniform crossover in genetic algorithms","author":"syswerda","year":"1989","journal-title":"Proc Intl Conf on Genetic Algorithms"},{"key":"ref28","first-page":"184","article-title":"Fitness distance correlation as a measure of problem difficulty for genetic algorithms","author":"jones","year":"1995","journal-title":"Proceedings of the 6th International Conference on Genetic Algorithms"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00171"},{"key":"ref27","first-page":"37","article-title":"Massive multimodality, deception, and genetic algorithms","author":"goldberg","year":"1992","journal-title":"Parallel Problem Solving from Nature"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.10.035"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3009966"},{"key":"ref29","article-title":"Simple genetic algorithms and the minimal deceptive problem","author":"goldberg","year":"1987","journal-title":"Genetic Algorithms and Simulated Annealing"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99259-4_3"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100646"},{"key":"ref7","volume":"1","author":"gwiazda","year":"2006","journal-title":"Genetic Algorithms Reference Vol 1 Crossover for Single-Objective Numerical Optimization Problems"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-0940-2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3040345"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1090.001.0001"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1994.2.3.279"},{"key":"ref22","author":"goldberg","year":"1989","journal-title":"Genetic Algorithms in Search Optimization and Machine Learning"},{"key":"ref21","first-page":"245","article-title":"The royal road for genetic algorithms: Fitness landscapes and GA performance","author":"mitchell","year":"1992","journal-title":"Proc 1st Eur Conf Artif Life"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-094832-4.50012-X"},{"key":"ref23","first-page":"97","article-title":"Modeling building-block interdependency","author":"watson","year":"1998","journal-title":"Parallel Problem Solving from Nature"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF01531277"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.806169"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09558870.pdf?arnumber=9558870","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:03:22Z","timestamp":1662667402000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9558870\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3117987","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}