• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11A
• /
• pp.1095-1104
• /
• 2008

In multiuser OFDM systems, subcarrier and bit allocation plays an important role for the efficient resource use. However, in multiuser adaptive allocation as a non-linear problem, it is impractical to compute all to get the best solution because of the complexity. We set the goal of minimizing the transmit power while satisfying the BER and minimum bits required to transmit through the highest fitness combination of subcarriers and users. The proposed improved genetic algorithm employs the diversity of adaptive allocation more than existing genetic algorithm. Therefore, from the numerical simulation results, we find that the proposed heuristic algorithm has more performance than the existing algorithms.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.1
• /
• pp.61-66
• /
• 2002

A position control algorithm for a flexible manipulator is studied. The proposed algorithm is based on a fuzzy theory with a Steady State Genetic Algorithm(SSGA) and an Adaptive Genetic Algorithms(AGA). The proposed controller for a flexible manipulator have decreased 90.8%, 31.8%, 31.3% in error when compared with a conventional fuzzy controller, fuzzy controller using neural network, fuzzy controller using evolution strategies, respectively when the weight and the velocity of end-point are 0.8k9 and 1m/s, respectively.

• International Journal of Computer Science & Network Security
• /
• v.24 no.3
• /
• pp.12-22
• /
• 2024

The travelling salesman problem is very famous and very difficult combinatorial optimization problem that has several applications in operations research, computer science and industrial engineering. As the problem is difficult, finding its optimal solution is computationally very difficult. Thus, several researchers have developed heuristic/metaheuristic algorithms for finding heuristic solutions to the problem instances. In this present study, a new hybrid genetic algorithm (HGA) is suggested to find heuristic solution to the problem. In our HGA we used comprehensive sequential constructive crossover, adaptive mutation, 2-opt search and a new local search algorithm along with a replacement method, then executed our HGA on some standard TSPLIB problem instances, and finally, we compared our HGA with simple genetic algorithm and an existing state-of-the-art method. The experimental studies show the effectiveness of our proposed HGA for the problem.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2714-2716
• /
• 2005

In this paper, we designed the adaptive fuzzy logic controller for crane system using neural network and real-coding genetic algorithm. The proposed algorithm show a good performance on convergence velocity and diversity of population among evolutionary computations. The weights of neural network is adaptively changed to tune the input/output gain of fuzzy logic controller. And the genetic algorithm was used to leam the feedforward neural network. As a result of computer simulation, the proposed adaptive fuzzy logic controller is superior to conventional controllers in moving and modifying the destination point.

• Journal of Computing Science and Engineering
• /
• v.8 no.4
• /
• pp.199-206
• /
• 2014

The ant colony optimization (ACO) algorithm is a new heuristic algorithm that offers good robustness and searching ability. With in-depth exploration, the ACO algorithm exhibits slow convergence speed, and yields local optimization solutions. Based on analysis of the ACO algorithm and the genetic algorithm, we propose a novel hybrid genetic ant colony optimization (NHGAO) algorithm that integrates multi-population strategy, collaborative strategy, genetic strategy, and ant colony strategy, to avoid the premature phenomenon, dynamically balance the global search ability and local search ability, and accelerate the convergence speed. We select the traveling salesman problem to demonstrate the validity and feasibility of the NHGAO algorithm for solving complex optimization problems. The simulation experiment results show that the proposed NHGAO algorithm can obtain the global optimal solution, achieve self-adaptive control parameters, and avoid the phenomena of stagnation and prematurity.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.26 no.8
• /
• pp.758-764
• /
• 2015

This paper describes the pattern synthesis of array antenna which conforms to a metallic curved surface formed by the rotation of a quadratic function by using EAGA(Enhanced Adaptive Genetic Algorithm). Three rotated-type conformal surfaces are realized by changing the coefficient of the quadratic function and the pattern of each conformal array antenna is synthesized. In order to reduce the overall time of pattern synthesis, the transformed active element pattern obtained by the active element pattern of the 2-dimensional planar array using Euler angles rotation is utilized instead of the active element pattern of the 3-dimensional conformal array antenna itself. To verify validity of the proposed synthesis procedure, the synthesized patterns using EAGA are compared with those obtained by MWS.

• Industrial Engineering and Management Systems
• /
• v.10 no.4
• /
• pp.247-254
• /
• 2011

In this paper, we study a single-machine scheduling problem with deteriorating processing time of jobs and multiple rate-modifying activities which reset deteriorated processing time to the original processing time. In this situation, the objective function is to minimize total completion time. First, we formulate an integer programming model. Since the model is difficult to solve as the size of real problem being very large, we design an improved genetic algorithm called adaptive genetic algorithm (AGA) with spontaneously adjusting crossover and mutation rate depending upon the status of current population. Finally, we conduct some computational experiments to evaluate the performance of AGA with the conventional GAs with various combinations of crossover and mutation rates.

• Proceedings of the KIEE Conference
• /
• 1999.11c
• /
• pp.530-532
• /
• 1999

In adaptive fuzzy control, system designer develops an adaptive law for the output of the unknown plant to track a given signal. The adaptation gains of the adaptive law are critical elements in the overall system, however, they were used to be selected by the designer's experience or intuition. In this paper, genetic algorithm is used to search an optimal adaptation gain and simulation results will be presented to show the improved tracking responses.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.8
• /
• pp.92-103
• /
• 1997

This paper proposes a new gray-level image segmentation method using GA(genetic algorithm) and an ACA(adaptive clustering algorithm). The solution in the general GA can be moving because of stochastic reinsertion, and suffer from the premature convergence problem owing to deficiency of individuals before finding the optimal solution. To cope with these problems and to reduce processing time, we propose the new GBR algorithm and the technique that resolves the premature convergence problem. GBR selects the individual in the child pool that has the fitness value superior to that of the individual in the parents pool. We resolvethe premature convergence problem with producing the mutation in the parents population, and propose the new method that removes the small regions in the segmented results. The experimental results show that the proposed segmentation algorithm gives better perfodrmance than the ACA ones in Gaussian noise environments.

• International Journal of Contents
• /
• v.2 no.1
• /
• pp.39-44
• /
• 2006

Load sharing is a critical resource in computer system. In sender-initiated load sharing algorithms, the sender continues to send unnecessary request messages for load transfer until a receiver is found while the system load is heavy. Meanwhile, in the receiver initiated load sharing algorithms, the receiver continues to send an unnecessary request message for load acquisition until a sender is found while the system load is light. These unnecessary request messages result in inefficient communications, low CPU utilization, and low system throughput in distributed systems. To solve these problems, we propose a genetic algorithm based approach for improved sender-initiated and receiver-initiated load sharing in distributed systems. And we expand this algorithm to an adaptive load sharing algorithm. Compared with the conventional sender-initiated and receiver-initiated algorithms, the proposed algorithm decreases the response time and task processing time.