• 대한전기학회논문지:시스템및제어부문D
• /
• 제53권7호
• /
• pp.531-535
• /
• 2004

A new method is presented to construct a classifier. This was accomplished by combining a generalized regression neural network (GRNN) and a genetic algorithm (GA). The classifier constructed in this way is referred to as a GA-GRNN. The GA played a role of controlling training factors simultaneously. The GA-GRNN was applied to classify 4 different Promoter sequences. The training and test data were composed of 115 and 58 sequence patterns, respectively. The classifier performance was investigated in terms of the classification sensitivity and prediction accuracy. Compared to conventional GRNN, GA-GRNN significantly improved the total classification sensitivity as well as the total prediction accuracy. As a result, the proposed GA-GRNN demonstrated improved classification sensitivity and prediction accuracy over the convention GRNN.

• 대한전기학회논문지:전력기술부문A
• /
• 제50권2호
• /
• pp.58-66
• /
• 2001

This paper presents an application of a newly designed Adaptive Genetic Algorithm (AGA) to solve the Optimal Feeder Routing (OFR) problem for distribution system planning. The main objective of the OFR problem usually is to minimize the total cost that is the sum of investment costs and system operation costs. We propose a properly designed AGA, in this paper, which can handle the horizon-year expansion planning problem of power distribution network in which the location of substation candidates, the location and amount of forecasted demands are given. In the proposed AGA, we applied adaptive operators using specially designed adaptive probabilities. we also a Simplified Load Flow (SLF) technique for radial networks to improve a searching efficiency of AGA. The proposed algorithm has been evaluated with the practical 32, 69 bus test system to show favorable performance. It is also shown that the proposed method for the OFR can also be used for the network reconfiguration problem in distribution system.

• 한국자원식물학회지
• /
• 제19권3호
• /
• pp.381-384
• /
• 2006

This study was conducted to selected Korean black raspberry (Rubus coreanus Miq.) for high productivity. The eight major agronomic traits were investigated from 198 clones of the clone bank established in Korea Forest Research Institute, Suwon, Korea. The selection levels based on number of fruit per fructify lateral (NFFL) over 20, and fruit weight (FW) over 1.3g, and yield of individual per fructify lateral (YIFL) over 25g, were applied on 198 clones, resulted in 17 clones selected. The selected superior trees, 17 clones, appeared regional differences for amount of fruiting among 4 different test sites. When number of fruit per fruit petiole (NRFP), fruit weight (FW), yield of individual (YI) and sugar content were satisfied over 20, 1.4g, 6kg and 9.5 brix, respectively, as a select condition, 5 clones were reselected as the superior trees among 17 clones. for 3 years.

• 산업경영시스템학회지
• /
• 제29권1호
• /
• pp.63-71
• /
• 2006

In this paper, we consider a planning problem arising from printed circuit board manufacturing industries. Given a set of several types of PCBs, component feeders and surface mounting machines in series in a PCB assembly line, the problem is to define the feeder allocation and job sequence with the objective of minimizing the total operation time of the line. We formulate the problem as a mathematical model. And, the problem is proven to be NP-hard, so a genetic algorithm is developed. Finally, we give test results to evaluate the performance of the genetic algorithm.

• 한국CDE학회지
• /
• 제21권2호
• /
• pp.39-49
• /
• 2015

This paper presents the single objective design optimization of plate-fin heat sink equipped with fan cooling system using Genetic Algorithm. The proper heat sink and fan model are selected based on the previous studies. And the thermal resistance of heat sinks and fan efficiency during operation are calculated according to specific design parameters. The objective function is combination of thermal resistance and fan efficiency which have been taken to measure the performance of the heat sink. And Decision making procedure is suggested considering life time of semiconductor and Fan Operating cost. And also Analytical Model used for optimization is validated by Fluent, Ansys 13.0 and this model give a quite reasonable and reliable design.

• 한국시뮬레이션학회논문지
• /
• 제9권3호
• /
• pp.91-102
• /
• 2000

The distribution routing problem is one of the important problems in distribution and supply center management. This research is concerned with an integrated distribution routing problem for multi-supply centers based on improved genetic algorithm and GUI-type programming. In this research, we used a three-step approach; in step 1 a sector clustering model is developed to transfer the multi-supply center problem to single supply center problems which are more easy to be solved, in step 2 we developed a vehicle routing model with time and vehicle capacity constraints and in step 3, we developed a GA-TSP model which can improve the vehicle routing schedules by simulation. For the computational purpose, we developed a GUI-type computer program according to the proposed methods and the sample outputs show that the proposed method is very effective on a set of standard test problems, and it could be potentially useful in solving the distribution routing problems in multi-supply center problem.

• 산업경영시스템학회지
• /
• 제26권4호
• /
• pp.31-41
• /
• 2003

This paper deals with a cell formation problem for a set of m-machines and n-processing parts. Generally, a cell formation problem is known as NP-completeness. Hence the cell formation problem with multiple objectives is more difficult than single objective problem. The paper considers multiple objectives; minimize number of intercell movements, minimize intracell workload variation and minimize intercell workload variation. We propose a multiple objective genetic algorithms(MOGA) resolving the mentioned three objectives. The MOGA procedure adopted Pareto optimal solution for selection method for next generation and the concept of Euclidean distance from the ideal and negative ideal solution for fitness test of a individual. As we consider several weights, decision maker will be reflected his consideration by adjusting high weights for important objective. A numerical example is given for a comparative analysis with the results of other research.

• 산업공학
• /
• 제8권1호
• /
• pp.23-30
• /
• 1995

Optimization in the engineering design is to select the best of many possible design alternatives in a complex design space. One major problem of local minimization algorithm is that they often result in local optima. In this paper, a hybrid method was developed by coupling the genetic algorithm and a traditional direct search method. The proposed method first finds a region for possible global optimum using the genetic algorithm and then searchs for a global optimum using the direct search method. To evaluate the performance of the hybrid method, it was applied to three test problems and a problem of designing corrugate bulkhead of a ship.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1995년도 하계학술대회 논문집 B
• /
• pp.485-487
• /
• 1995

This paper proposes a GAs-applied method for power system planning using series capacitors in order to control the flow of power as desired and utilize the existing transmission facilities to its transfer capacity limits. The control strategy problem is formulated as optimization problem. Also, in employing genetic algorithms to solve the optimization problems, real variable-based genetic algorithm is presented to save the coding processing time and obtain more accurate value of the variable. An application to IEEE 57-bus test system proves that the proposed method is effective for improvement of power system transfer capacity.

• 대한안전경영과학회지
• /
• 제13권1호
• /
• pp.133-142
• /
• 2011

Overhead facility design problem(OFDP) is one of the shortest rectilinear flow network problem(SRFNP)[4]. Genetic algorithm(GA), artificial immune system(AIS), population management genetic algorithm (PM) and greedy randomized adaptive search procedures (GRASP) were introduced to solve OFDP. A path matrix formed individual was designed to represent rectilinear path between each facility. An exchange crossover operator and an exchange mutation operator were introduced for OFDP. Computer programs for each algorithm were constructed to evaluate the performance of algorithms. Computation experiments were performed on the quality of solution and calculations time by using randomly generated test problems. The average object value of PM was the best of among four algorithms. The quality of solutions of AIS for the big sized problem were better than those of GA and GRASP. The solution quality of GRASP was the worst among four algorithms. Experimental results showed that the calculations time of GRASP was faster than any other algorithm. GA and PM had shown similar performance on calculation time and the calculation time of AIS was the worst.