[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"doc-detail-134318-en":3,"doc-seo-134318-105":29,"detail-sidebar-cat-0-en-105":91},{"code":4,"msg":5,"data":6},0,"success",{"doc_id":7,"user_id":8,"nickname":9,"user_avatar":10,"doc_module":4,"category_id":11,"category_name":12,"doc_title":13,"doc_description":14,"doc_content":15,"file_id":16,"file_url":17,"file_type":18,"file_size":19,"view_count":20,"is_deleted":4,"is_public":20,"is_downloadable":20,"audit_status":20,"page_count":11,"language":21,"language_code":22,"site_id":23,"html_lang":22,"table_of_contents":24,"faqs":25,"seo_title":26,"seo_description":14,"update_tm":27,"read_time":28},134318,687208528416,"Cipher","https://ap-avatar.wpscdn.com/davatar_9964176cb1d06d4a9deccf72a44ae3dc",6,"Technology","Fitness Landscapes - Royal Road Functions","Research on genetic algorithms (GAs) aims to identify which optimization problems GAs are best suited for, including when they outperform alternatives such as gradient methods. This work introduces a class of fitness landscapes, the “Royal Road” functions, designed to isolate landscape features relevant to GA performance. The study constructs these functions to analyze how particular features shape GA search behavior and to enable systematic comparisons between GAs and other search methods.","B.2.7.5: Fitness Landscapes: Royal Road Functions  \nMelanie Mitchell  \nSanta Fe Institute 1399 Hyde Park Road Santa Fe, NM 87501  \n[mm@santafe](mm@santafe. edu)[.](mm@santafe. edu)[ edu](mm@santafe. edu)  \nStephanie Forrest Dept. of Computer Science University of New Mexico  \nAlbuquerque, NM 87131  \n[forrest@cs](forrest@cs. unm. edu)[.](forrest@cs. unm. edu)[ unm](forrest@cs. unm. edu)[.](forrest@cs. unm. edu)[ edu](forrest@cs. unm. edu)  \nTo appear in Bck, T. , Fogel, D. , and Michalewicz, Z. (Eds. ), Handbook of Evolutionary  \nComputation. Oxford: Oxford University Press.  \nAn important goal of research on genetic algorithms (GAs) is to understand the class of problems for which GAs are most suited, and in particular, the class of problems on which they will outperform other search algorithms such as gradient methods. We have developed a class of 􀀌tness landscapes|the \\Royal Road\" functions (Mitchell, Forrest, and Holland 1992; Forrest and Mitchell 1993)|that isolate some of the features of 􀀌tness landscapes thought to be most relevant to the performance of GAs. Our goal in constructing these landscapes is to understand in detail how such features a􀀋ect the search behavior of GAs and to carry out systematic comparisons between GAs and other search methods.  \nIt has been hypothesized that GA's work by discovering, emphasizing, and recombining high-quality building blocks of solutions in a highly parallel manner (Holland 1975; Goldberg 1989) . These ideas are formalized by the \\Schema Theorem\" and \\Building-Block Hypothesis\" (see section B2 . 5, this volume) . The GA evaluates populations of strings explicitly, and at the same time, it is argued, it implicitly estimates, reinforces, and recombines short, high-􀀌tness schemas|building blocks encoded as templates, such as 11****** (a template representing all 8-bit strings beginning with two 1s) .  \nA simple Royal Road function, R1 , is shown in Figure 1 . R1 consists of a list of partially speci􀀌ed bit strings (schemas) si in which ` 􀀃 ' denotes a wild card (i. e. , allowed to be either 0 or 1) . A bit string x is said to be an instance of a schema s, x 2 s, if x matches s in the de􀀌ned (i. e. , non- ` 􀀃 ') positions. The 􀀌tness R1 ( x) of a bit string x is de􀀌ned as follows:  \n8  \nR1 (x) = X Æi (x)o(si ) ;  \ni=1  \nwhere  \nÆi ( x) = (  \n1 if x 2 si  \n0 otherwise,  \nand where o(si ), the order of si , is the number of de􀀌ned bits in si . For example, if x is an instance of exactly two of the order-8 schemas, R1 ( x) = 16 . Likewise, R1 (111 : : : 1) = 64 . R1 is meant to capture one landscape feature of particular relevance to GAs: the presence of 􀀌t low-order building blocks that recombine to produce 􀀌tter, higher-order building blocks. (Adi􀀋erent class of functions, also called \\Royal Road functions\", was developed by Holland and is described in Jones, 1995.)  \nThe Building-Block Hypothesis implies that such a landscape should lay out a \\royal road\" for the GA to reach strings of increasingly higher 􀀌tnesses. One might also expect  \nthat simple hill-climbing schemes would perform poorly because a large number of bit positions must be optimized simultaneously in order to move from an instance of a low-order schema (e. g. , 11111111** . . . *) to an instance of a higher-order intermediate schema (e. g. , 11111111********11111111** . . . *) . However, the results of our experiments ran counter to both these expectations (Forrest and Mitchell 1993) . In these experiments, a simple GA (using 􀀌tness-proportionate selection with sigma scaling, single-point crossover, and point mutation|see sections C2 and C3, this volume) optimized R1 quite slowly, at least in part  \nbecause of \\hitchhiking\": once an instance of a higher-order schema was discovered, its high  \n􀀌tness allowed the schema to spread quickly in the population, with 0s in other positions in the string hitchhiking along with the 1s in the schema's de􀀌ned positions. This slowed down the discovery of schemas in the other posit","cbCaifEXVXYX5EZ5","https://ap.wps.com/l/cbCaifEXVXYX5EZ5","pdf",111911,1,"English","en",105,"# Fitness Landscapes: Royal Road Functions\n## Goal and motivation for studying GA performance\n## Royal Road functions (definition and example R1)\n## Building-block hypothesis and implications for search\n## Experimental outcomes vs expectations\n## Comparison with hill-climbing methods (SAHC, NAHC, RMHC)","[{\"question\":\"What problem do the Royal Road functions address in genetic algorithm research?\",\"answer\":\"They isolate key features of fitness landscapes to clarify which problem classes GAs are most suited for and to study why they may outperform other search methods.\"},{\"question\":\"How is a simple Royal Road function R1 defined?\",\"answer\":\"R1 is based on partially specified bit-string schemas with wildcards; a string’s fitness sums contributions from schemas it matches, weighted by the order of each schema.\"},{\"question\":\"Why did the genetic algorithm underperform or slow down hill-climbing expectations on R1?\",\"answer\":\"The GA exhibited “hitchhiking,” where high-fitness higher-order schemas spread quickly and delay discovering improvements in other nearby positions.\"}]","Fitness Landscapes - Royal Road Functions | PDF",1787248174,15,{"code":4,"msg":30,"data":31},"ok",{"site_id":23,"language":22,"slug":32,"title":13,"keywords":33,"description":14,"schema_data":34,"social_meta":86,"head_meta":88,"extra_data":90,"updated_unix":27},"fitness-landscapes-royal-road-functions","",{"@graph":35,"@context":85},[36,53,68],{"@type":37,"itemListElement":38},"BreadcrumbList",[39,43,47,50],{"item":40,"name":41,"@type":42,"position":20},"https://docshare.wps.com","Home","ListItem",{"item":44,"name":45,"@type":42,"position":46},"https://docshare.wps.com/document/","Document",2,{"item":48,"name":12,"@type":42,"position":49},"https://docshare.wps.com/document/technology/",3,{"item":51,"name":13,"@type":42,"position":52},"https://docshare.wps.com/document/fitness-landscapes-royal-road-functions/134318/",4,{"url":51,"name":13,"@type":54,"author":55,"headline":13,"publisher":57,"fileFormat":60,"inLanguage":22,"description":14,"dateModified":61,"datePublished":62,"encodingFormat":60,"isAccessibleForFree":63,"interactionStatistic":64},"DigitalDocument",{"name":9,"@type":56},"Person",{"url":40,"name":58,"@type":59},"DocShare","Organization","application/pdf","2026-08-24","2026-08-20",true,{"@type":65,"interactionType":66,"userInteractionCount":20},"InteractionCounter",{"@type":67},"ViewAction",{"@type":69,"mainEntity":70},"FAQPage",[71,77,81],{"name":72,"@type":73,"acceptedAnswer":74},"What problem do the Royal Road functions address in genetic algorithm research?","Question",{"text":75,"@type":76},"They isolate key features of fitness landscapes to clarify which problem classes GAs are most suited for and to study why they may outperform other search methods.","Answer",{"name":78,"@type":73,"acceptedAnswer":79},"How is a simple Royal Road function R1 defined?",{"text":80,"@type":76},"R1 is based on partially specified bit-string schemas with wildcards; a string’s fitness sums contributions from schemas it matches, weighted by the order of each schema.",{"name":82,"@type":73,"acceptedAnswer":83},"Why did the genetic algorithm underperform or slow down hill-climbing expectations on R1?",{"text":84,"@type":76},"The GA exhibited “hitchhiking,” where high-fitness higher-order schemas spread quickly and delay discovering improvements in other nearby positions.","https://schema.org",{"og:url":51,"og:type":87,"og:title":13,"og:site_name":58,"og:description":14},"article",{"robots":89,"canonical":51},"index,follow",{"doc_id":7,"site_id":23},{"code":4,"msg":5,"data":92},[93,97,101,105,110,113,118,123,128,131,135],{"id":20,"doc_module":4,"doc_module_name":45,"category_name":94,"show_sort_weight":95,"slug":96},"Story & Novel",90,"story-novel",{"id":46,"doc_module":4,"doc_module_name":45,"category_name":98,"show_sort_weight":99,"slug":100},"Literature",80,"literature",{"id":52,"doc_module":4,"doc_module_name":45,"category_name":102,"show_sort_weight":103,"slug":104},"Exam",70,"exam",{"id":106,"doc_module":4,"doc_module_name":45,"category_name":107,"show_sort_weight":108,"slug":109},5,"Comic",60,"comic",{"id":11,"doc_module":4,"doc_module_name":45,"category_name":12,"show_sort_weight":111,"slug":112},50,"technology",{"id":114,"doc_module":4,"doc_module_name":45,"category_name":115,"show_sort_weight":116,"slug":117},7,"Healthcare",40,"healthcare",{"id":119,"doc_module":4,"doc_module_name":45,"category_name":120,"show_sort_weight":121,"slug":122},8,"Research & Report",30,"research-report",{"id":124,"doc_module":4,"doc_module_name":45,"category_name":125,"show_sort_weight":126,"slug":127},9,"Religion & Spirituality",20,"religion-spirituality",{"id":126,"doc_module":4,"doc_module_name":45,"category_name":129,"show_sort_weight":126,"slug":130},"World Cup","world-cup",{"id":132,"doc_module":4,"doc_module_name":45,"category_name":133,"show_sort_weight":132,"slug":134},10,"Lifestyle","lifestyle",{"id":136,"doc_module":4,"doc_module_name":45,"category_name":137,"show_sort_weight":106,"slug":138},19,"General","general"]