• 제어로봇시스템학회논문지
• /
• 제6권5호
• /
• pp.376-382
• /
• 2000

A problem of relevant interest to some industries is that of the optimum two-dimensional layout. In this problem, one is given a number of rectangular sheets and an order for a specified number of each of certain types of two-dimensional regular and irregular shapes. The aim is to cut the shapes out of the sheets in such a way as to minimize the amount of waste produced. In this paper, we propose a genetic algorithms using rotation parameters by which the best pattern of layout is found.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2000년도 춘계학술대회논문집 - 한국공작기계학회
• /
• pp.147-152
• /
• 2000

In this paper we propose a Genetic Algorithm for the path planning of an autonomous mobile robot. Genetic Algorithms(GAs) have advantages of the adaptivity such as GAs work even if an environment is time-varying or unknown. Therefore, we propose the path planning algorithms using the GAs-based approach and show more adaptive and optimal performance by simulation.

• 한국경영과학회지
• /
• 제17권3호
• /
• pp.1-12
• /
• 1992

Parallel Genetic Algorithms (GAs) are developed to solve a single machine n-job scheduling problem which is to minimize the sum of absolute deviations of completion times from a common due date. (0, 1) binary scheme is employed to represent the n-job schedule. Two selection methods, best individual selection and simple selection are examined. The effect of crossover operator, due date adjustment mutation and due date adjustment reordering are discussed. The performance of the parallel genetic algorithm is illustrated with some example problems.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.418-418
• /
• 2000

This paper proposes a path planning algorithm for mobile robot. To generate an optimal path and minimum time path for a mobile robot, we use the Genetic Algorithm(GA) and Visibility Graph. After finding a minimum-distance between start and goal point, the path is revised to find the minimum time path by path-smoothing algorithm. Simulation results show that the proposed algorithms are more effective.

• Journal of information and communication convergence engineering
• /
• 제8권4호
• /
• pp.370-376
• /
• 2010

Ensemble learning is a method for improving the performance of classification and prediction algorithms. However, its performance can be degraded due to multicollinearity problem where multiple classifiers of an ensemble are highly correlated with. This paper proposes genetic algorithm-based optimization techniques of SVM ensemble to solve multicollinearity problem. Empirical results with bankruptcy prediction on Korea firms indicate that the proposed optimization techniques can improve the performance of SVM ensemble.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 G
• /
• pp.2318-2320
• /
• 1998

A genetic algorithm for global and local path planning and collision avoidance of mobil robot in unstructured workspace is proposed. The genetic algorithm searches for a path in the entire and continuous free space and unifies global path planning and local path planning. The simulation shows the proposed method is an efficient and effective method when compared with the traditional collision avoidance algorithms.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 G
• /
• pp.2953-2955
• /
• 1999

In this paper, the concept of evolvable hardware and evolutionary robotics are introduced and constructing the mobile robot controller without human operator is suggested. The robot controller is evolved to avoid obstacles by genetic learning which determines the weights between sensor inputs and motor outputs. Genetic algorithms which is executed in a computer(PC) searches the best weights by interacting with robot performance under it's environment. The experiment is done by real mobile robot Khepera and a simple GA.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• pp.1353-1355
• /
• 2003

Genetic algorithms (GA) is a well known technique that is capable of handling multiobjective functions and discrete constraints in the process of numerical optimization. Together with the Pareto ranking scheme, more than one possible solution can be obtained despite the imposed constraints and multi-criteria design functions. In view of this unique capability, the design of the log-periodic dipole antenna array (LPDA) using this special feature is proposed in this paper. This method also provides gain, front-back level and S parameter design tradeoff for the LPDA design in broadband application at no extra computational cost.

• 한국추진공학회:학술대회논문집
• /
• 한국추진공학회 2005년도 제25회 추계학술대회논문집
• /
• pp.299-303
• /
• 2005

본 연구에서는 축척방법에 의한 구성품 성능선도의 부정확성을 개선하기 위해 실험을 통하여 획득한 데이터를 유전자 알고리즘(Genetic Algorithms)으로 압축기 성능전도를 생성하는 방법을 제안하였고, 유전자 알고리즘만 이용할 경우 압축기 성능선도 생성시 서지점들과 쵸크점들을 예측하는데 불분명한 단점이 있어 기존의 구성품 성능선도 생성에 널리 사용하는 스케일링 기법을 보완적으로 이용하여 보다 정확한 구성품 성능선도의 예측을 시도하였다.

• BMB Reports
• /
• 제46권1호
• /
• pp.41-46
• /
• 2013

Identifying genes indispensable for an organism's life and their characteristics is one of the central questions in current biological research, and hence it would be helpful to develop computational approaches towards the prediction of essential genes. The performance of a predictor is usually measured by the area under the receiver operating characteristic curve (AUC). We propose a novel method by implementing genetic algorithms to maximize the partial AUC that is restricted to a specific interval of lower false positive rate (FPR), the region relevant to follow-up experimental validation. Our predictor uses various features based on sequence information, protein-protein interaction network topology, and gene expression profiles. A feature selection wrapper was developed to alleviate the over-fitting problem and to weigh each feature's relevance to prediction. We evaluated our method using the proteome of budding yeast. Our implementation of genetic algorithms maximizing the partial AUC below 0.05 or 0.10 of FPR outperformed other popular classification methods.