• IE interfaces
• /
• v.17 no.spc
• /
• pp.28-36
• /
• 2004

The main purpose of this study is to find out the optimal solution of the vehicle routing problem considering heterogeneous vehicle(s), double-trips, and multi depots. This study suggests a mathematical programming model with new numerical formula which considers the amount of delivery and sub-tour elimination and gives optimal solution by using OPL-STUDIO(ILOG). This study also suggests modified genetic algorithm which considers the improvement of the creation method for initial solution, application of demanding point, individual and last learning method in order to find excellent solution, survival probability of infeasible solution for allowance, and floating mutation rate for escaping from local solution. The suggested modified genetic algorithm is compared with optimal solution of the existing problems. We found the better solution rather than the existing genetic algorithm. The suggested modified genetic algorithm is tested by Eilon and Fisher data(Eilon 22, Eilon 23, Eilon 30, Eilon 33, and Fisher 10), respectively.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.6
• /
• pp.442-447
• /
• 2003

This paper demonstrates that a modified hybrid neural-genetic multimodel parameter estimation algorithm can be applied to structured system identification of an electro-hydraulic servo system. This algorithm is consists of a recurrent incremental credit assignment(ICRA) neural network and a genetic algorithm. The ICRA neural network evaluates each member of a generation of model and genetic algorithm produces new generation of model. The modified hybrid neural-genetic multimodel parameter estimation algorithm is applied to an electro-hydraulic servo system the task to find the parameter values such as mass, damping coefficient, bulk modulus, spring coefficient and disturbance, which minimizes the total square error.

• Journal of Ocean Engineering and Technology
• /
• v.18 no.2
• /
• pp.77-82
• /
• 2004

The purpose of this study is to develop a nesting algorithm, using a genetic algorithm to optimize nesting order, and modified No Fit Polygon(NFP) methodology to place parts with the order generated from the previous genetic algorithm. Various genetic algorithm techniques, which have thus far been applied to the Travelling Salesman Problem, were tested. The partially mapped crossover method, the inversion method for mutation, the elitist strategy, and the linear scaling method of fitness value were selected to optimize the nesting order. A modified NFP methodology, with improved searching capability for non-convex polygon, was applied repeatedly to the placement of parts according to the order generated from previous genetic algorithm. Modified NFP, combined with the genetic algorithms that have been proven in TSP, were applied to the nesting problem. For two example cases, the combined nesting algorithm, proposed in this study, shows better results than that from previous studies.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.1
• /
• pp.36-43
• /
• 1999

This paper proposes a new hybrid genetic algorithm for auto-tuning fuzzy controllers improving the performance. In general, fuzzy controllers use pre-determined moderate membership functions, fuzzy rules, and scaling factors, by trial and error. The presented algorithm estimates automatically the optimal values of membership functions, fuzzy rules, and scaling factors for fuzzy controllers, using a hybrid genetic algorithm. The object of the proposed algorithm is to promote search efficiency by the hybrid optimization technique. The proposed hybrid genetic algorithm is based on both the standard genetic algorithm and a modified gradient method. If a maximum point is not be changed around an optimal value at the end of performance during given generation, the hybrid genetic algorithm searches for an optimal value using the the initial value which has maximum point by converting the genetic algorithms into the MGM(Modified Gradient Method) algorithms that reduced the number of variables. Using this algorithm is not only that the computing time is faster than genetic algorithm as reducing the number of variables, but also that can overcome the disadvantage of genetic algoritms. Simulation results verify the validity of the presented method.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.3
• /
• pp.247-256
• /
• 1999

In this paper, a methodology for optimal design of PID controller using the modified genetic algorithm has been proposed to improve the transient stability at system fault in HVDC transmission system, mathematical model preparation for stability analysis, and supplementary signal control by an optimal PID controller using the modified genetic algorithm(MGA). The propriety was verified through computer simulations regarding transient stability. It means that the application of MGA-PID controller in HVDC transmission system can contribute the propriety to the improvement of the transient stability in HVDC transmission system and the design of MGA-PID controller has been proved indispensible when applied to HVDC transmission system.

• Proceedings of the KIEE Conference
• /
• 1998.07b
• /
• pp.515-518
• /
• 1998

This paper proposes a new hybrid algorithm for auto-tuning fuzzy controllers improving the performance. The presented algorithm estimates automatically the optimal values of membership functions, fuzzy rules, and scaling factors for fuzzy controllers, using a genetic-MGM algorithm. The object of the proposed algorithm is to promote search efficiency by a genetic and modified gradient optimization techniques. The proposed genetic and MGM algorithm is based on both the standard genetic algorithm and a gradient method. If a maximum point don't be changed around an optimal value at the end of performance during given generation, the genetic-MGM algorithm searches for an optimal value using the initial value which has maximum point by converting the genetic algorithms into the MGM(Modified Gradient Method) algorithms that reduced the number of variables. Using this algorithm is not only that the computing time is faster than genetic algorithm as reducing the number of variables, but also that can overcome the disadvantage of genetic algorithms. Simulation results verify the validity of the presented method.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.6 s.38
• /
• pp.85-92
• /
• 2005

In this Paper, we develope an effective web-based learning contents using interactive genetic algorithms with modified mutation operation. In the interactive genetic algorithm, reciprocal exchange mutation is used. But. we modify the mutation operator to improve the learning effects. The new web-based learning contents using interactive genetic algorithm provide the dynamic learning contents providing and real-time test system. Especially, learners can execute the interactive genetic algorithm according to the learners' characters and interests to select the efficient learning environments and contents sequences.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.27 no.4
• /
• pp.231-238
• /
• 2014

In the buildings, the systems of structures are influenced by the gravity load changes due to room alteration or construction stage. This paper proposes a system identification method establishing mass as well as stiffness to parameters in model updating process considering mass change in the buildings. In this proposed method, modified genetic algorithm, which is optimization technique, is applied to search those parameters while minimizing the difference of dynamic characteristics between measurement and FE model. To search more global solution, the proposed modified genetic algorithm searches in the wider search space. It is verified that the proposed method identifies the system of structure appropriately through the analytical study on a steel beam structure in the building. The comparison for performance of modified genetic algorithm and existing simple genetic algorithm is carried out. Furthermore, the existing model updating method neglecting mass change is performed to compare with the proposed method.

• Proceedings of the IEEK Conference
• /
• 2000.11c
• /
• pp.9-12
• /
• 2000

Genetic algorithm is a searching method which based on the law of the survival of the fittest. Multi-population Genetic Algorithm is a modified form of Genetic Algorithm, which was devised for covering the defect of general genetic algorithm. The core of multi-population genetic algorithm is said to be the migration schemes. The fitness-based migration scheme and the random migration scheme are currently used. In this paper, a new migration scheme, ‘the migration scheme between groups’, is suggested, and compared to the general two migration schemes.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.3
• /
• pp.289-295
• /
• 2000

The triangulation problem is to make triangles using the given points on the space. The Minimum Weight Triangulation(MWT) is the problem of finding a set of triangles with the minimum weight among possible set of the triangles. In this paper, a modified genetic algorithm(GA) based on an existing genetic algorithm and multispace smoothing technique is proposed. Through the computational results, we can find the tendency that the proposed GA finds good solutions though it needs longer time than the existing GA does as the problem size increases.