• International Journal of Control, Automation, and Systems
• /
• v.1 no.3
• /
• pp.289-300
• /
• 2003

In this paper, we introduce an identification method in Fuzzy Relation-based Fuzzy Neural Networks (FRFNN) through a hybrid identification algorithm. The proposed FRFNN modeling implement system structure and parameter identification in the efficient form of "If...., then... " statements, and exploit the theory of system optimization and fuzzy rules. The FRFNN modeling and identification environment realizes parameter identification through a synergistic usage of genetic optimization and complex search method. The hybrid identification algorithm is carried out by combining both genetic optimization and the improved complex method in order to guarantee both global optimization and local convergence. An aggregate objective function with a weighting factor is introduced to achieve a sound balance between approximation and generalization of the model. The proposed model is experimented with using two nonlinear data. The obtained experimental results reveal that the proposed networks exhibit high accuracy and generalization capabilities in comparison to other models.er models.

• Journal of Advanced Navigation Technology
• /
• v.18 no.2
• /
• pp.170-177
• /
• 2014

Genetic Algorithms are robust search and optimization techniques but have some problems such as premature convergence and convergence to local extremum. As population diversity converges to low value, the search ability decreases and converges to local extremum but population diversity converges to high value, then the search ability increases and converges to global optimum or genetic algorithm may diverge. To guarantee that genetic algorithms converge to the global optima, the genetic operators should be chosen properly. In this paper, we propose the genetic operators with the hybrid function of the average Hamming distance and the fitness value to maintain the diversity of the GA's population for escaping from the premature convergence. Results of simulation studies verified the effects of the mutation operator for maintaining diversity and the other operators for improving convergence properties as well as the feasibility of using proposed genetic operators on convergence properties to avoid premature convergence and convergence to local extremum.

• Journal of the Korea Safety Management & Science
• /
• v.13 no.3
• /
• pp.107-114
• /
• 2011

Traveling salesman problem is to minimize the total cost for a traveling salesman who wants to make a tour given finite number of cities along with the cost of travel between each pair them, visiting each cities exactly once before returning home. Traveling salesman problem is known to be NP-hard, and it needs a lot of computing time to get the optimal solution, so that heuristics are more frequently developed than optimal algorithms. This study suggests a hybrid parallel genetic algorithm(HPGA) for traveling salesman problem The suggested algorithm combines parallel genetic algorithm, nearest neighbor search, and 2-opt. The suggested algorithm has been tested on 7 problems in TSPLIB and compared the results of existing methods(heuristics, meta-heuristics, hybrid, and parallel). Experimental results shows that HPGA could obtain good solution in total travel distance minimization.

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

• International Journal of Computer Science & Network Security
• /
• v.23 no.6
• /
• pp.193-201
• /
• 2023

In this paper, we consider the maximum scatter traveling salesman problem (MSTSP), a travelling salesman problem (TSP) variant. The problem aims to maximize the minimum length edge in a salesman's tour that travels each city only once in a network. It is a very complicated NP-hard problem, and hence, exact solutions can be found for small sized problems only. For large-sized problems, heuristic algorithms must be applied, and genetic algorithms (GAs) are found to be very successfully to deal with such problems. So, this paper develops a hybrid GA (HGA) for solving the problem. Our proposed HGA uses sequential sampling algorithm along with 2-opt search for initial population generation, sequential constructive crossover, adaptive mutation, randomly selected one of three local search approaches, and the partially mapped crossover along with swap mutation for perturbation procedure to find better quality solution to the MSTSP. Finally, the suggested HGA is compared with a state-of-art algorithm by solving some TSPLIB symmetric instances of many sizes. Our computational experience reveals that the suggested HGA is better. Further, we provide solutions to some asymmetric TSPLIB instances of many sizes.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.2 no.3
• /
• pp.58-67
• /
• 1992

This paper presents a method on applying Genetric Algorithms(GA), which is a well-know high performance optimizing algorithm, to construct the self-organizing fuzzy logic controller. Fuzzy logic controller considered in this paper utilized Sugeno's hybrid inference method. which has an advantage of simple defuzzification process in the inference engine. Genetic algorithm is used to find the iptimal parameters in the FLC. The proposed approach will be demonstrated using 2 d. o. f robot manipulator to verify its effectiveness.

• Steel and Composite Structures
• /
• v.8 no.6
• /
• pp.475-490
• /
• 2008

A hybrid tabu-simulated annealing algorithm is proposed for the optimum design of steel frames. The special character of the hybrid algorithm is that it exploits both tabu search and simulated annealing algorithms simultaneously to obtain near optimum. The objective of optimum design problem is to minimize the weight of steel frames under the actual design constraints of AISC-LRFD specification. The performance and reliability of the hybrid algorithm were compared with other algorithms such as tabu search, simulated annealing and genetic algorithm using benchmark examples. The comparisons showed that the hybrid algorithm results in lighter structures for the presented examples.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.67 no.3
• /
• pp.143-148
• /
• 2018

In this paper, the optimal fuzzy logic controller(FLC) for a hybrid renewable energy system(HRES) is proposed. Generally, hybrid renewable energy systems can consist of wind power, solar power, fuel cells and storage devices. The proposed FLC can effectively control the entire HRES by determining the output power of the fuel cell or the absorption power of the electrolyzer. In general, fuzzy logic controllers can be optimized by classical optimization algorithms such as genetic algorithms(GA) or particle swarm optimization(PSO). However, these FLC have a disadvantage in that their performance varies greatly depending on the control parameters of the optimization algorithms. Therefore, we propose a method to optimize the fuzzy logic controller using the teaching-learning based optimization(TLBO) algorithm which does not have the control parameters of the algorithm. The TLBO algorithm is an optimization algorithm that mimics the knowledge transfer mechanism in a class. To verify the performance of the proposed algorithm, we modeled the hybrid system using Matlab Tool and compare and analyze the performance with other classical optimization algorithms. The simulation results show that the proposed method shows better performance than the other methods.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.16 no.4
• /
• pp.407-417
• /
• 2003

Enen though several GA-based optimization algorithms have been successfully applied to complex optimization problems in various engineering fields, GA-based optimization methods are computationally too expensive for practical use in the field of structural optimization, particularly for large- scale problems. Furthermore, a successful implementation of GA-based optimization algorithm requires a cumbersome and trial-and-error routine related to setting of parameters dependent on a optimization problem. Therefore, to overcome these disadvantages, a high-performance GA is developed in the form of distributed hybrid genetic algorithm for structural optimization on a cluster of personal computers. The distributed hybrid genetic algorithm proposed in this paper consist of a simple GA running on a master computer and multiple μ-GAs running on slave computers. The algorithm is implemented on a PC cluster and applied to the minimum weight design of steel structures. The results show that the computational time required for structural optimization process can be drastically reduced and the dependency on the parameters can be avoided.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1080-1085
• /
• 2005

A hybrid control scheme is proposed for the stabilization of backward movement along simple paths for a vehicle composed of a truck and six trailers. The hybrid comprises the combination of a linear quadratic regulator (LQR) and a neurocontroller (NC) that is trained by a genetic algorithm (GA). Acting singly, either the NC or the LQR are unable to perform satisfactorily over the entire range of the operation required, but the proposed hybrid is shown to be capable of providing good overall system performance. The evaluation function of the NC in the hybrid design has been modified from the conventional type to incorporate both the squared errors and the running steps errors. The reverse movement of the trailer-truck system can be modeled as an unstable nonlinear system, with the control problem focusing on the steering angle. Achieving good backward movement is difficult because of the restraints of physical angular limitations. Due to these constraints the system is impossible to globally stabilize with standard smooth control techniques, since some initial states necessarily lead to jack-knife locks. This paper demonstrates that a hybrid of neural networks and LQR can be used effectively for the control of nonlinear dynamical systems. Results from simulated trials are reported.