• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.3
• /
• pp.281-287
• /
• 1999

In this paper, a design method based on evolutionary programming for feedforward neural networks which have a single hidden layer is presented. By using an evolutionary programming, the network parameters such as the network structure, weight, slope of sigmoid functions and bias of nodes can be acquired simultaneously. To check the effectiveness of the suggested method, two numerical examples are examined. The performance of the identified network is demonstrated.

• 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.

• Korean Journal of Cognitive Science
• /
• v.16 no.4
• /
• pp.351-368
• /
• 2005

The manual construction of the knowledge-base takes much time and effort, and it is hard to adjust intelligence systems to dynamic and flexible environment. Thus mental development in those systems has been investigated in recent years. Autonomous mental development is a new paradigm for developing autonomous machines, which are adaptive and flexible to the environment. Learning conversation, a kind of mental development, is an important aspect of conversational agents. In this paper, we propose a learning conversation method for conversational agents which uses several promising techniques; speech-act templates and genetic programming. Knowledge acquisition of conversational agents is implemented by finite state machines and templates, and dynamic sentence generation is implemented by genetic programming Several illustrations and usability tests how 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.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.1
• /
• pp.43-48
• /
• 2014

Usually, image deconvolution is applied as a preprocessing step in surveillance systems to reduce the effect of motion or out-of-focus blur problem. In this paper, we propose a blind-image deconvolution filtering approach based on genetic programming (GP). A numerical expression is developed using GP process for image restoration which optimally combines and exploits dependencies among features of the blurred image. In order to develop such function, first, a set of feature vectors is formed by considering a small neighborhood around each pixel. At second stage, the estimator is trained and developed through GP process that automatically selects and combines the useful feature information under a fitness criterion. The developed function is then applied to estimate the image pixel intensity of the degraded image. The performance of developed function is estimated using various degraded image sequences. Our comparative analysis highlights the effectiveness of the proposed filter.

• Journal of the military operations research society of Korea
• /
• v.33 no.2
• /
• pp.31-47
• /
• 2007

The main purpose of this study is to find out the best solution of the vehicle routing problem with hard time window by using both genetic algorithm and heuristic. A mathematical programming model was also suggested in the study. The suggested mathematical programming model gives an optimal solution by using ILOG-CPLEX. This study also suggests a hybrid genetic algorithm which considers the improvement of generation for an initial solution by savings heuristic and two heuristic processes. Two heuristic processes consists of 2-opt and Or-opt. Hybrid genetic algorithm is also compared with existing problems suggested by Solomon. We found better solutions rather than the existing genetic algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.4
• /
• pp.317-322
• /
• 2002

The major operations of Evolutionary Computation include crossover, mutation, competition and selection. Although selection does not create new individuals like crossover or mutation, a poor selection mechanism may lead to problems such as taking a long time to reach an optimal solution or even not finding it at all. In view of this, this paper proposes a hybrid Evolutionary Programming (EP) algorithm that exhibits a strong capability to move toward the global optimum even when stuck at a local minimum using a synergistic combination of the following three basic ideas. First, a "local selection" technique is used in conjunction with the normal tournament selection to help escape from a local minimum. Second, the mutation step has been improved with respect to the Fast Evolutionary Programming technique previously developed in our research group. Finally, the crossover and mutation operations of the Genetic Algorithm have been added as a parallel independent branch of the search operation of an EP to enhance search diversity.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.11
• /
• pp.4726-4731
• /
• 2011

This paper proposed the algorithm to select optimal grinding condition for plunge grinding in the batch production unit. In order to apply to the proposed algorithm, the state variable for plunge grinding process was defined and the optimal grinding condition for each cycle in batch production was decided by genetic algorithm. Based on the optimized grinding condition in each cycle, the optimal grinding condition for whole batch production was selected by dynamic programming. The proposed algorithm was evaluated by computer simulation.

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 2003.09a
• /
• pp.497-504
• /
• 2003

An optimal design method for hybrid structural control system of building structures subject to earthquake excitation is presented in this paper. Designing a hybrid structural control system nay be defined as a process that optimizes the capacities and configuration of passive and active control systems as well as structural members. The optimal design proceeds by formulating the optimization problem via a multi-stage goal programming technique and, then, by finding reasonable solution to the optimization problem by means of a goal-updating genetic algorithm. The process of the integrated optimization design is illustrated by a numerical simulation of a nine-story building structure subject to earthquake excitation. The effectiveness of the proposed method is demonstrated by comparing the optimally designed results with those of a hybrid structural control system where structural members, passive and active control systems are uniformly distributed.

• Structural Engineering and Mechanics
• /
• v.83 no.5
• /
• pp.577-591
• /
• 2022

This paper develops a comparatively time-efficient methodology for performing seismic fragility analysis of the reinforced concrete (RC) buildings in the presence of uncertainty sources. It aims to appraise the effectiveness of any variation in the material's mechanical properties as epistemic uncertainty, and the record-to-record variation as aleatory uncertainty in structural response. In this respect, the fuzzy set theory, a well-known 𝛼-cut approach, and the Genetic Algorithm (GA) assess the median of collapse fragility curves as a fuzzy response. GA is requisite for searching the maxima and minima of the objective function (median fragility herein) in each membership degree, 𝛼. As this is a complicated and time-consuming process, the authors propose utilizing the Gene Expression Programming-based (GEP-based) equation for reducing the computational analysis time of the case study building significantly. The results indicate that the proposed structural analysis algorithm on the derived GEP model is able to compute the fuzzy median fragility about 33.3% faster, with errors less than 1%.