{"id":"https://openalex.org/W1995923295","doi":"https://doi.org/10.1145/1143997.1144190","title":"A splicing/decomposable encoding and its novel operators for genetic algorithms","display_name":"A splicing/decomposable encoding and its novel operators for genetic algorithms","publication_year":2006,"publication_date":"2006-07-08","ids":{"openalex":"https://openalex.org/W1995923295","doi":"https://doi.org/10.1145/1143997.1144190","mag":"1995923295"},"language":"en","primary_location":{"id":"doi:10.1145/1143997.1144190","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1143997.1144190","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-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/A5083841358","display_name":"Yong Liang","orcid":"https://orcid.org/0000-0002-2858-2810"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yong Liang","raw_affiliation_strings":["The Chinese University of Hong Kong, Shatin, N.T., HK, China"],"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Shatin, N.T., HK, China","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043752498","display_name":"Kwong-Sak Lueng","orcid":null},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kwong-Sak Lueng","raw_affiliation_strings":["The Chinese University of Hong Kong, Shatin, N.T., HK, China"],"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Shatin, N.T., HK, China","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109898714","display_name":"Kin-Hong Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kin-Hong Lee","raw_affiliation_strings":["The Chinese University of Hong Kong, Shatin, N.T., HK, China"],"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Shatin, N.T., HK, China","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083841358"],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":0.4657,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.73230876,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1225","last_page":"1232"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9987999796867371,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6186532974243164},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.6115233302116394},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.6031479835510254},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.6021177768707275},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5531522035598755},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5239325165748596},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5042585134506226},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.49522915482521057},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4818238317966461},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4595142900943756},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4412415027618408},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4193727374076843},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4180072546005249},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.311600923538208},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23665818572044373},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15436166524887085},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.09210905432701111}],"concepts":[{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6186532974243164},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.6115233302116394},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.6031479835510254},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.6021177768707275},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5531522035598755},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5239325165748596},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5042585134506226},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.49522915482521057},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4818238317966461},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4595142900943756},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4412415027618408},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4193727374076843},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4180072546005249},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.311600923538208},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23665818572044373},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15436166524887085},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.09210905432701111},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1143997.1144190","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1143997.1144190","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.153.1474","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.1474","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bham.ac.uk/~wbl/biblio/gecco2006/docs/p1225.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W130515148","https://openalex.org/W1497256448","https://openalex.org/W1572982068","https://openalex.org/W1574175429","https://openalex.org/W1585335425","https://openalex.org/W1587100796","https://openalex.org/W1639032689","https://openalex.org/W1967093065","https://openalex.org/W1967974225","https://openalex.org/W1992339380","https://openalex.org/W2061690532","https://openalex.org/W2115053914","https://openalex.org/W2312844687","https://openalex.org/W2911740249"],"related_works":["https://openalex.org/W2389073067","https://openalex.org/W2928982795","https://openalex.org/W4297094710","https://openalex.org/W776182271","https://openalex.org/W1560148280","https://openalex.org/W2378837046","https://openalex.org/W2020672972","https://openalex.org/W1520454833","https://openalex.org/W2065680248","https://openalex.org/W4226029649"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,57],"introduce":[4],"a":[5,10,59],"new":[6,60,85],"genetic":[7,29,53],"representation":[8,41],"---":[9],"splicing/decomposable":[11],"(S/D)":[12],"binary":[13,40,48,66,120],"encoding,":[14],"which":[15,68],"was":[16],"proposed":[17],"based":[18],"on":[19,63,75,83,102,117],"some":[20],"theoretical":[21,32],"guidance":[22],"and":[23,33,91,98],"existing":[24,47],"recommendations":[25],"for":[26,50,106],"designing":[27],"efficient":[28],"representations.":[30],"Our":[31],"empirical":[34],"investigations":[35],"reveal":[36],"that":[37],"the":[38,64,72,76,84,99,103,118],"S/D":[39,65,119],"is":[42,69],"more":[43],"proper":[44],"than":[45],"other":[46],"encodings":[49],"searching":[51],"of":[52,95,110],"algorithms":[54],"(GAs).":[55],"Moreover,":[56],"define":[58],"genotypic":[61,86],"distance":[62,74,105],"space,":[67],"equivalent":[70],"to":[71],"Euclidean":[73,104],"real-valued":[77],"space":[78],"during":[79],"GAs":[80,88],"convergence.":[81],"Based":[82],"distance,":[87],"can":[89,113],"reliably":[90],"predictably":[92],"solve":[93],"problems":[94,112],"bounded":[96],"complexity":[97],"methods":[100],"depended":[101],"solving":[107],"different":[108],"kinds":[109],"optimization":[111],"be":[114],"directly":[115],"used":[116],"space.":[121]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}