| 摘要 |
PURPOSE: A method for arranging binary tree using genetic algorithm is provided to offer a visual result to a user by displaying a result of a certain data process as a coordinate having a balanced arrangement visually in an application program for indicating the result of the certain data process as a binary tree shape. CONSTITUTION: An initial group is generated(201). A binary tree provided as a problem is expressed as a chromosome, and a coordinate is initialized as a voluntary value. A selection, a cross operation, a mutation operation, and a goodness of fit estimation of a genetic assembly newly generated as a result of the operation are repeatedly performed to a generation to a point in which a solution is converged according to a problem(202-206). A chromosome having a maximum goodness of fit among chromosomes is selected as a solution(207).
|
