{"id":"https://openalex.org/W4236443773","doi":"https://doi.org/10.1162/106365603766646825","title":"General Schema Theory for Genetic Programming with Subtree-Swapping Crossover: Part II","display_name":"General Schema Theory for Genetic Programming with Subtree-Swapping Crossover: Part II","publication_year":2003,"publication_date":"2003-06-01","ids":{"openalex":"https://openalex.org/W4236443773","doi":"https://doi.org/10.1162/106365603766646825"},"language":"en","primary_location":{"id":"doi:10.1162/106365603766646825","is_oa":false,"landing_page_url":"https://doi.org/10.1162/106365603766646825","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101670626","display_name":"Riccardo Poli","orcid":"https://orcid.org/0000-0003-4612-0780"},"institutions":[{"id":"https://openalex.org/I110002522","display_name":"University of Essex","ror":"https://ror.org/02nkf1q06","country_code":"GB","type":"education","lineage":["https://openalex.org/I110002522"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Riccardo Poli","raw_affiliation_strings":["Department Computer Science, University of Essex, Colchester, CO4 3SQ, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department Computer Science, University of Essex, Colchester, CO4 3SQ, UK","institution_ids":["https://openalex.org/I110002522"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007077416","display_name":"Nicholas Freitag McPhee","orcid":null},"institutions":[{"id":"https://openalex.org/I4210162301","display_name":"University of Minnesota Morris","ror":"https://ror.org/05vzqzh92","country_code":"US","type":"education","lineage":["https://openalex.org/I4210162301"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nicholas Freitag McPhee","raw_affiliation_strings":["Division of Science and Mathematics, University of Minnesota, Morris, Morris, MN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Division of Science and Mathematics, University of Minnesota, Morris, Morris, MN, USA","institution_ids":["https://openalex.org/I4210162301"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007077416","https://openalex.org/A5101670626"],"corresponding_institution_ids":["https://openalex.org/I110002522","https://openalex.org/I4210162301"],"apc_list":null,"apc_paid":null,"fwci":3.2513,"has_fulltext":false,"cited_by_count":74,"citation_normalized_percentile":{"value":0.9284806,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"11","issue":"2","first_page":"169","last_page":"206"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11764","display_name":"Evolution and Genetic Dynamics","score":0.9825999736785889,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.9630476236343384},{"id":"https://openalex.org/keywords/schema","display_name":"Schema (genetic algorithms)","score":0.6710380911827087},{"id":"https://openalex.org/keywords/genetic-programming","display_name":"Genetic programming","score":0.5502139329910278},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5179409384727478},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.417856901884079},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37033790349960327},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35207366943359375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3302825689315796},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17911845445632935},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.10278809070587158}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.9630476236343384},{"id":"https://openalex.org/C52146309","wikidata":"https://www.wikidata.org/wiki/Q7431116","display_name":"Schema (genetic algorithms)","level":2,"score":0.6710380911827087},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.5502139329910278},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5179409384727478},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.417856901884079},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37033790349960327},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35207366943359375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3302825689315796},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17911845445632935},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.10278809070587158}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1162/106365603766646825","is_oa":false,"landing_page_url":"https://doi.org/10.1162/106365603766646825","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.61.274","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cswww.essex.ac.uk/staff/rpoli/papers/ecj2003partII.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1561626171","https://openalex.org/W1980465669","https://openalex.org/W1992379990","https://openalex.org/W1997073453","https://openalex.org/W2027649639","https://openalex.org/W2047094503","https://openalex.org/W2047101856","https://openalex.org/W2049816819","https://openalex.org/W2078213402","https://openalex.org/W2094954730","https://openalex.org/W2108928796","https://openalex.org/W2137565093","https://openalex.org/W2143069503","https://openalex.org/W2155582960","https://openalex.org/W2296218809"],"related_works":["https://openalex.org/W2082776239","https://openalex.org/W2142324575","https://openalex.org/W2051028534","https://openalex.org/W2164305954","https://openalex.org/W1501730763","https://openalex.org/W2046401452","https://openalex.org/W1772786136","https://openalex.org/W1963986408","https://openalex.org/W235718540","https://openalex.org/W1593354505"],"abstract_inverted_index":{"This":[0],"paper":[1,9,200],"is":[2,62,113,139,172],"the":[3,36,48,57,76,98,129,134,151,179,188,193,199,207],"second":[4],"part":[5],"of":[6,51,53,78,88,100,150,181,234],"a":[7,12,44,54,65,79,89,103,106,120,126,238],"two-part":[8],"which":[10,84,118,178],"introduces":[11],"general":[13,227],"schema":[14,33,55,108],"theory":[15,34,37,61,92,208],"for":[16,47,241],"genetic":[17],"programming":[18],"(GP)":[19],"with":[20,125,145,243],"subtree-swapping":[21,244],"crossover":[22,116,144,152,165,175,185,214],"(Part":[23],"I":[24],"(Poli":[25],"and":[26,74,105,146,166,196,216,237],"McPhee,":[27],"2003)).":[28],"Like":[29],"other":[30,130,226],"recent":[31],"GP":[32,101,143,162,242],"results,":[35],"gives":[38],"an":[39,231],"exact":[40,232],"formulation":[41],"(rather":[42],"than":[43],"lower":[45],"bound)":[46],"expected":[49],"number":[50],"instances":[52],"at":[56],"next":[58],"generation.":[59],"The":[60,91,110,169],"based":[63],"on":[64,75,192],"Cartesian":[66],"node":[67],"reference":[68],"system,":[69],"introduced":[70,82],"in":[71,122,177,187],"Part":[72],"I,":[73],"notion":[77],"variable-arity":[80],"hyperschema,":[81],"here,":[83],"generalises":[85],"previous":[86],"definitions":[87],"schema.":[90],"includes":[93],"two":[94,184],"main":[95],"theorems":[96],"describing":[97],"propagation":[99],"schemata:":[102],"microscopic":[104,111],"macroscopic":[107,170],"theorem.":[109],"version":[112,171],"applicable":[114,140,173],"to":[115,132,141,174,212,224],"operators":[117,176,215],"replace":[119],"subtree":[121,127],"one":[123],"parent":[124,131],"from":[128],"produce":[133],"offspring.":[135],"Therefore,":[136],"this":[137],"theorem":[138],"Koza's":[142],"without":[147],"uniform":[148],"selection":[149],"points,":[153],"as":[154,156],"well":[155],"one-point":[157],"crossover,":[158,160,163],"size-fair":[159],"strongly-typed":[161],"context-preserving":[164],"many":[167],"others.":[168],"probability":[180],"selecting":[182],"any":[183],"points":[186],"parents":[189],"depends":[190],"only":[191],"parents'":[194],"size":[195],"shape.":[197],"In":[198],"we":[201,204,217],"provide":[202],"examples,":[203],"show":[205],"how":[206,219],"can":[209,221],"be":[210,222],"specialised":[211],"specific":[213],"illustrate":[218],"it":[220],"used":[223],"derive":[225],"results.":[228],"These":[229],"include":[230],"definition":[233],"effective":[235],"fitness":[236],"size-evolution":[239],"equation":[240],"crossover.":[245]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":4}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}