Liang, YongYongLiangProf. LEUNG Kwong SakLee, Kin-HongKin-HongLee2023-03-242023-03-2420062006 IEEE Congress on Evolutionary Computation, CEC 2006, pp. 536 - 543, 2006 , Article number 16883560780394879978-078039487-2http://hdl.handle.net/20.500.11861/7577Based on the theoretical guidance and existing recommendations for designing efficient genetic representations, we investigate a novel genetic representation -a splicing/decomposable (S/D) binary encoding in this paper. The S/D binary representation can be spliced and decomposed to describe potential solutions of the problem with different precisions by different number of uniform-salient building blocks (BBs). According to the characteristics of the S/D binary representation, genetic and evolutionary algorithms (GEAs) can be applied from the high scaled to the low scaled BBs sequentially to avoid genetic drift and improve GEAs' performance. Our theoretical and empirical investigations reveal that the S/D binary representation is more proper than other existing binary encodings for GEAs searching. © 2006 IEEE.enEvolutionary AlgorithmsBuilding BlocksGenetic DriftTheoretical GuidanceEfficient RepresentationBinary EncodingPopulation SizeLower OrderSmall Population SizeDimensional ProblemsLarge Population SizeConvergence TimeBinary StringMutation ProbabilityProblem In OrderNumber Of PhenotypesString LengthGenetic OperatorsProblem DifficultyDirect CoordinationPerformance Of Genetic AlgorithmRun DurationGenotype-phenotype MapLot Of NoisePhenotypic SpaceEasy ProblemAverage FitnessTheoretical AnalysisConference Paper10.1109/CEC.2006.1688356