• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2C
• /
• pp.217-225
• /
• 2009

Tone injection scheme has been known as one of peak to average power ratio (PAPR) reduction methods deployable to multi-carrier system like orthogonal frequency division multiplexing (OFDM). The basic idea in tone injection scheme is to enforce the constellation size larger so that each of original constellation points is mapped into the preassigned distinct locations. According to the tone injection scheme, it increases symbol power highly induced inherently by expanding constellation to get optimal PAPR reduction. In the other hand, to get optimal power increase, the PAPR would be reduced insufficiently with limited tone injection signal. To withstand these problems, this paper consider the reduction of the PAPR and power increase problem simultaneously, Toward this, the tone injection scheme accomplished by employing the weighted sum genetic algorithm which has been utilized to solve multi-objective optimization problem (MOOP). The simulation results verifies that the proposed scheme can control the effective PAPR performance and alleviation of power increase flexibly by the weight value at the expense of relatively low complexity.

• Journal of Electrical Engineering and Technology
• /
• v.5 no.4
• /
• pp.597-605
• /
• 2010

This paper presents a contribution to parameter identification of a non-linear system using a new strategy to improve the genetic algorithm (GA) method. Since cost function plays an important role in GA-based parameter identification, we propose to improve the simple version of GA, where weights of the cost function are not taken as constant values, but varying along the procedure of parameter identification. This modified version of GA is applied to the induction motor (IM) as an example of nonlinear system. The GA cost function is the weighted sum of stator current and rotor speed errors between the plant and the model of induction motor. Simulation results show that the identification method based on improved GA is feasible and gives high precision.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.11
• /
• pp.938-943
• /
• 2013

In this paper, we propose a transmission parameter optimization scheme based on genetic algorithm for dynamic spectrum access systems. Specifically, we represent a multiple objective fitness function as a weighted sum of single objective fitness functions to optimize transmission parameters, and then, obtain optimized transmission parameters based on genetic algorithm for given transmission scenarios. From numerical results, we confirm that the transmission parameters are well optimized by using the proposed optimization scheme.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.2 s.314
• /
• pp.108-115
• /
• 2007

This paper proposes a new optimization algorithm prescribed by GBNSGA(Goal-Pareto Based Non-dominated Sorting Genetic Algorithm) whose result satisfies the user's needs and goals to enhance the performance of optimization. Typically, lots of real-world engineering problems encounter simultaneous optimization subject to satisfying prescribed multiple objectives. Unfortunately, since these objectives might be mutually competitive, it is hardly to find a unique solution satisfying every objectives. Instead, many researches have been investigated in order to obtain an optimal solution with sacrificing more than one objectives. This paper introduces a novel optimization scheme named by GBNSGA obeying both goals as well as objectives as possible as it can via allocating candidated solutions on Pareto front, which enhances the performance of Pareto based optimization. The performance of the proposed GBNSGA will be compared with that of the conventional NSGA and weighted-sum approach.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.6
• /
• pp.197-208
• /
• 1999

This paper presents an operation sequence-based approach for determining machine cell layout in a cellular manufacturing environment. The proposed model considers the sequence of operations in evaluating the intercell and intracell movements. In this paper, design of cellular layout has an objective of minimization of total material flow among facilities, where the total material flow is defined as a weighted sum of both intercell and intracell part movements. The proposed algorithm is developed by using genetic algorithm and can be used to design an optimal cellular layout which can cope with changes of shop floor situation by considering constraints such as the number of machine cells and the number of machines in a machine cell.

• Journal of the Korea Society for Simulation
• /
• v.6 no.1
• /
• pp.71-84
• /
• 1997

For many optimization problems where some of the system components are stochastic, the objective functions cannot be represented analytically. Therefore, modeling by computer simulation is one of the most effective means of studying such complex systems. Many, if not most, simulation optimization problems have multiple aspects. Historically, multiple aspects have been combined ad hoc to form a scalar objective function, usually through a linear combination (weighted sum) of the multiple attributes, or by turning objectives into constraints. The genetic algorithm (GA), however, is readily modified to deal with multiple aspects. In this paper we propose a MAGA (Multiple Aspects-based Genetic Algorithm) as an algorithm for finding the Pareto optimal set. We demonstrate its ability to find and maintain a diverse "Pareto optimal population" on two problems.

• Journal of the Korean Society for Precision Engineering
• /
• v.13 no.4
• /
• pp.143-151
• /
• 1996

The concept of cellular manufacturing is to decompose a manufacturing system into subsystems, which are easier to manage than the entire manufacturing system. The objective of cellular manufacturing is to group parts with similar processing requirements into part families and machines into cells which meet the processing needs of part families assigned to them. This paper presents a methodology for cell formation based on genetic algorithm which produces improved cell formation in terms of total moves, which is a weighted sum of both intercell moves and intracell moves. A sample problem is solved for two, three and four cells with an approach based on genetic algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3C
• /
• pp.314-322
• /
• 2007

This paper proposes a new optimization algorithm named by GBNSGA(Goal-Pareto Based Non-dominated Sorting Genetic Algorithm) which determines the best configuration for CR(Cognitive Radio) communication systems. Conventionally, in order to select the proper radio configuration, genetic algorithm has been introduced so as to alleviate computational burden along the execution of the cognition cycle proposed by Mitola. This paper proposes a novel optimization algorithm designated as GBNSGA for cognitive engine which can be described as a hybrid algorithm combining well-known Pareto-based NSGA(Non-dominated Sorting Genetic Algorithm) as well as GP(Goal Programming). By conducting computer simulations, it will be verified that the proposed method not only satisfies the user's service requirements in the form of goals. It reveals the fast optimization capability and more various solutions rather than conventional NSGA or weighted-sum approach.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.5
• /
• pp.188-202
• /
• 2004

This research was designed to investigate biomechanical aspects of the evolution based on the hypothesis of dynamic cooperative interactions between the locomotion pattern and the body shape in the evolution of human bipedal walking The musculoskeletal model used in the computer simulation consisted of 12 rigid segments and 26 muscles. The nervous system was represented by 18 rhythmic pattern generators. The genetic algorithm was employed based on the natural selection theory to represent the evolutionary mechanism. Evolutionary strategy was assumed to minimize the cost function that is weighted sum of the energy consumption, the muscular fatigue and the load on the skeletal system. The simulation results showed that repeated manipulations of the genetic algorithm resulted in the change of body shape and locomotion pattern from those of chimpanzee to those of human. It was suggested that improving locomotive efficiency and the load on the musculoskeletal system are feasible factors driving the evolution of the human body shape and the bipedal locomotion pattern. The hypothetical evolution method employed in this study can be a new powerful tool for investigation of the evolution process.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.2
• /
• pp.1-6
• /
• 2009

One of the most important problems in bioinformatics is how to extract the useful information from a huge amount of data, and make a decision in diagnosis, prognosis, and medical treatment applications. This paper proposes a weighted kernel function for support vector machine and its learning method with a fast convergence and a good classification performance. We defined the weighted kernel function as the weighted sum of a set of different types of basis kernel functions such as neural, radial, and polynomial kernels, which are trained by a learning method based on genetic algorithm. The weights of basis kernel functions in proposed kernel are determined in learning phase and used as the parameters in the decision model in classification phase. The experiments on several clinical datasets such as colon cancer indicate that our weighted kernel function results in higher and more stable classification performance than other kernel functions.