{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T14:50:16Z","timestamp":1648824616751},"reference-count":14,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comp. Intel. Appl."],"published-print":{"date-parts":[[2009,9]]},"abstract":"<jats:p> Recombination in Genetic Algorithms (GA) is supposed to extract the component characteristics from two parents and reassemble them in different combinations, hopefully producing an offspring that has the good characteristics of both parents, and this requires explicit chromosome and recombination, operator by design. This paper presents a novel evolutionary approach based on symbiogenesis which uses symbiotic combination instead of sexual recombination, and by using this operator, it requires no domain knowledge for chromosome or combination operator design. The algorithm is benchmarked on three problem sets: combinatorial optimization category, deceptive problems, and fully deceptive problems. The results, compared with that of standard genetic algorithm and symbiotic evolutionary adaptation model, show higher success rates and faster results. <\/jats:p>","DOI":"10.1142\/s1469026809002606","type":"journal-article","created":{"date-parts":[[2009,8,26]],"date-time":"2009-08-26T11:55:25Z","timestamp":1251287725000},"page":"237-252","source":"Crossref","is-referenced-by-count":1,"title":["SYMBIOTIC EVOLUTIONARY ALGORITHM, A REMEDY FOR LINKAGE PROBLEM"],"prefix":"10.1142","volume":"08","author":[{"given":"RAMIN","family":"HALAVATI","sequence":"first","affiliation":[{"name":"Sharif University of Technology, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SAEED BAGHERI","family":"SHOURAKI","sequence":"additional","affiliation":[{"name":"Sharif University of Technology, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","volume-title":"Adaptation in Natural and Artificial Systems","author":"Holland J. H.","year":"1975"},{"key":"rf5","doi-asserted-by":"crossref","unstructured":"S.\u00a0Forrest and M.\u00a0Mitchell, Foundations of Genetic Algorithms 2, ed. L. D.\u00a0Whitley (Morgan Kaufmann, San Mateo, CA, 1993)\u00a0pp. 109\u2013126.","DOI":"10.1016\/B978-0-08-094832-4.50013-1"},{"key":"rf7","first-page":"493","volume":"3","author":"Goldberg D. E.","journal-title":"Comput. Syst."},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1539-5"},{"key":"rf14","volume-title":"On Extended Compact Genetic Algorithm","author":"Sastry K.","year":"2000"},{"key":"rf15","first-page":"19","volume":"7","author":"M\u00fchlenbein H.","journal-title":"J. Comput. Informat. Technol."},{"key":"rf18","volume-title":"The Major Transitions in Evolution","author":"Maynard Smith J.","year":"1995"},{"key":"rf19","first-page":"126","volume":"6","author":"Battiti R.","journal-title":"J. Comput."},{"key":"rf20","author":"De Werra D.","journal-title":"OR Spektrum"},{"key":"rf21","first-page":"190","volume":"1","author":"Glover F.","journal-title":"J. Comput."},{"key":"rf22","first-page":"4","volume":"2","author":"Glover F.","journal-title":"J. Comput."},{"key":"rf25","doi-asserted-by":"crossref","unstructured":"A. E.\u00a0Eiben, P. E.\u00a0Rau\u00e9 and Z.\u00a0Ruttkay, GA-Easy and GA-Hard Constraint Satisfaction Problems, Constraint Processing (Springer-Verlag, Berlin, 1995)\u00a0pp. 267\u2013283.","DOI":"10.1007\/3-540-59479-5_30"},{"key":"rf26","unstructured":"S.\u00a0Russle and P.\u00a0Norvig, Artificial Intelligence: A Modern Approach, 2nd edn. (Prentice-Hall, USA, 2002)\u00a0pp. 111\u2013112."},{"key":"rf27","volume":"13","author":"Forrest S.","journal-title":"Machine Learning"}],"container-title":["International Journal of Computational Intelligence and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1469026809002606","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:17:39Z","timestamp":1565137059000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1469026809002606"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":14,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2009,9]]}},"alternative-id":["10.1142\/S1469026809002606"],"URL":"https:\/\/doi.org\/10.1142\/s1469026809002606","relation":{},"ISSN":["1469-0268","1757-5885"],"issn-type":[{"value":"1469-0268","type":"print"},{"value":"1757-5885","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9]]}}}