• Proceeding of KASS Symposium
• /
• 2008.05a
• /
• pp.101-106
• /
• 2008

This paper describes a comparative study of genetic algorithm and mathematical programming technique applied in the design optimization of geodesic dome. In particular, the genetic algorithm adopted in this study uses the so-called re-birthing technique together with the standard GA operations such as fitness, selection, crossover and mutation to accelerate the searching process. The finite difference method is used to calculate the design sensitivity required in mathematical programming techniques and three different techniques such as sequential linear programming (SLP), sequential quadratic programming(SQP) and modified feasible direction method(MFDM) are consistently used in the design optimization of geodesic dome. The optimum member sizes of geodesic dome against several external loads is evaluated by the codes $ISADO-GA{\alpha}$ and ISADO-OPT. From a numerical example, we found that both optimization techniques such as GA and mathematical programming technique are very effective to calculate the optimum member sizes of three dimensional discrete structures and it can provide a very useful information on the existing structural system and it also has a great potential to produce new structural system for large spatial structures.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.277-279
• /
• 2005

DNA 마이크로어레이 기술의 발전으로 유전자 발현에 대한 많은 양의 정보가 쏟아지게 되었고, 이러한 정보들을 이용하여 유전자 조절 네트워크를 수학적으로 모델링하는 것이 시스템 생물학의 중요 관심사로 떠오르고 있다. 본 논문에서는 실험에서 얻어낸 데이터를 유전 프로그래밍을 이용한 기호 회귀를 통해 데이터 지점을 조정하고 유전 프로그래밍의 결과 함수를 이용해 각 지점에서의 미분값을 얻어내었다. 그 뒤, 불리안 네트워크를 표현하는 이진 배열과 S-시스템을 표현하는 실수 배열을 결합한 해를 사용하는 유전 알고리즘으로 앞에서 얻은 데이터를 이용해 원하는 S-시스템의 구조와 매개변수를 구해내었다.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2003.10a
• /
• pp.163-166
• /
• 2003

Hull form designers have to design a ship with satisfying an economical, technical and environmental demand. When it is concerned by a technical and environmental demand, there will be a economical demand left to criticize optimization. In this case, there were used to be requirements which needs to meet only a best performance not concerning about input of Human resource. Life cycle's cost contains building cost and operation cost so that now we need to check Man Hour cost in building a ship. This research shows a correlation between hull form information, i.e. curvature, length, breadth and thickness of surface and Man Hour of the Shell plating manufacture with using Artificial Neural Network and Gentic Programming. This study will support to classify initial work, to have a high assumption possible through predicting a Man Hour and to provide a guide book to infer a building cost and a economical optimization hull form.

• Journal of the Society of Naval Architects of Korea
• /
• v.52 no.1
• /
• pp.1-7
• /
• 2015

The weight estimation of floating offshore structures such as FPSO, TLP, semi-Submersibles, Floating Offshore Wind Turbines etc. in the preliminary design, is one of direct measures of both construction cost and basic performance. Through both literature investigation and internet search, the weight data of floating offshore structures such as FPSO and TLP was collected. In this study, the weight estimation model with the genetic programming was suggested for FPSO. The weight estimation model using genetic programming was established by fixing the independent variables based on this data. In addition, the correlation analysis was performed to make up for the weak points of genetic programming; it is apt to induce over-fitting when the number of data is relatively smaller than that of independent variables. That is, by reducing the number of variables through the analysis of the correlation between the independent variables, the increasing effect in the number of weight data can be expected. The reliability of the developed weight estimation model was within 2% of error rate.

• Journal of Information Technology Application
• /
• v.3 no.3
• /
• pp.25-40
• /
• 2001

This paper deals with the problem of generating optimal polynomials using Genetic Programming(GP). The polynomial should approximate nonlinear response surfaces. Also, there should be a consideration regarding the size of the polynomial, It is not desirable if the polynomial is too large. To build small or medium size of polynomials that enable to model nonlinear response surfaces, we use the low order Tailor series in the function set of GP, and put the constrain on generating GP tree during the evolving process in order to prevent GP trees from becoming too large size of polynomials. Also, GAGPT(Group of Additive Genetic Programming Trees) is adopted to help achieving such purpose. Two examples are given to demonstrate our method.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.571-574
• /
• 2003

서열 정렬(sequence alignment)은 새로운 서열의 기능적, 구조적, 진화적 분석을 용이하게 하기 때문에 분자 생물학(molecular biology) 등에서 널리 사용된다. 지금까지 서열 정렬 알고리즘들에 대한 연구는 활발히 진행되어 왔다. 특히, 생물학 데이터양의 기하급수적인 증가와 전체 유전체 서열의 분석이 이루어진 종(species)들이 증가하면서, 보다 빠르고 정확하게 서열 정력을 수행하는 알고리즘이 필요하게 되었다. 본 논문에서는 동적 프로그래밍 방식에서부터 전체 유전체 서열 알고리즘에 이르기까지 서열 정렬 알고리즘의 연구 동향을 분석하고자 한다.

• Smart Media Journal
• /
• v.9 no.3
• /
• pp.31-40
• /
• 2020

Currently, black-box-based machine learning algorithms are used to analyze big data in manufacturing. This algorithm has the advantage of having high analytical consistency, but has the disadvantage that it is difficult to interpret the analysis results. However, in the manufacturing industry, it is important to verify the basis of the results and the validity of deriving the analysis algorithms through analysis based on the manufacturing process principle. To overcome the limitation of explanatory power as a result of this machine learning algorithm, we propose a manufacturing big data analysis method using genetic programming. This algorithm is one of well-known evolutionary algorithms, which repeats evolutionary operators such as selection, crossover, mutation that mimic biological evolution to find the optimal solution. Then, the solution is expressed as a relationship between variables using mathematical symbols, and the solution with the highest explanatory power is finally selected. Through this, input and output variable relations are derived to formulate the results, so it is possible to interpret the intuitive manufacturing mechanism, and it is also possible to derive manufacturing principles that cannot be interpreted based on the relationship between variables represented by formulas. The proposed technique showed equal or superior performance as a result of comparing and analyzing performance with a typical machine learning algorithm. In the future, the possibility of using various manufacturing fields was verified through the technique.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.924-927
• /
• 2014

최근 주요 홈서비스 로봇 중 하나인 청소 로봇에 대한 수요가 증가하면서 주어진 공간을 효율적으로 처리하기 위한 높은 커버리지 성능이 주목받고 있다. 이에 따라 로봇의 커버리지 성능을 높이기 위하여 청소 로봇의 자율적인 운행을 통해 지도를 작성하고 이를 활용한 경로를 생성하여 로봇의 운행에 반영하였다. 하지만, 저가형 청소 로봇은 낮은 성능의 처리 성능을 가지고 있기 때문에 불가능하다. 이에 본 논문에서는 단순한 운행 기능만을 가지고 있는 청소 로봇의 이동 패턴을 유전 프로그래밍을 이용하여 최적의 운행 계획을 설계하는 기법을 제안한다. 또한 실험을 통해 제안 기법을 통해 생성된 이동 패턴이 기존 기법에 비해 높은 운행 효율성을 보장함을 확인 하였다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.2
• /
• pp.119-128
• /
• 2006

As dialogue systems are widely required, the research on natural language generation in dialogue has raised attention. Contrary to conventional dialogue systems that reply to the user with a set of predefined answers, a newly developed dialogue system generates them dynamically and trains the answers to support more flexible and customized dialogues with humans. This paper proposes an evolutionary method for generating sentences using interactive genetic programming. Sentence plan trees, which stand for the sentence structures, are adopted as the representation of genetic programming. With interactive evolution process with the user, a set of customized sentence structures is obtained. The proposed method applies to a dialogue-based train booking agent and the usability test demonstrates the usefulness of the proposed method.

• Journal of KIISE:Software and Applications
• /
• v.32 no.12
• /
• pp.1229-1237
• /
• 2005

Combining multiple classifiers has been actively exploited to improve classification performance. It is required to construct a pool of accurate and diverse base classifier for obtaining a good ensemble classifier. Conventionally ensemble learning techniques such as bagging and boosting have been used and the diversify of base classifiers for the training set has been estimated, but there are some limitations in classifying gene expression profiles since only a few training samples are available. This paper proposes an ensemble technique that analyzes the diversity of classification rules obtained by genetic programming. Genetic programming generates interpretable rules, and a sample is classified by combining the most diverse set of rules. We have applied the proposed method to cancer classification with gene expression profiles. Experiments on lymphoma cancer dataset, prostate cancer dataset and ovarian cancer dataset have illustrated the usefulness of the proposed method. h higher classification accuracy has been obtained with the proposed method than without considering diversity. It has been also confirmed that the diversity increases classification performance.