• Journal of Intelligence and Information Systems
• /
• v.19 no.4
• /
• pp.55-79
• /
• 2013

In this paper, we propose a hybrid genetic algorithm (HGA) approach to effectively solve the reverse logistics network with centralized centers (RLNCC). For the proposed HGA approach, genetic algorithm (GA) is used as a main algorithm. For implementing GA, a new bit-string representation scheme using 0 and 1 values is suggested, which can easily make initial population of GA. As genetic operators, the elitist strategy in enlarged sampling space developed by Gen and Chang (1997), a new two-point crossover operator, and a new random mutation operator are used for selection, crossover and mutation, respectively. For hybrid concept of GA, an iterative hill climbing method (IHCM) developed by Michalewicz (1994) is inserted into HGA search loop. The IHCM is one of local search techniques and precisely explores the space converged by GA search. The RLNCC is composed of collection centers, remanufacturing centers, redistribution centers, and secondary markets in reverse logistics networks. Of the centers and secondary markets, only one collection center, remanufacturing center, redistribution center, and secondary market should be opened in reverse logistics networks. Some assumptions are considered for effectively implementing the RLNCC The RLNCC is represented by a mixed integer programming (MIP) model using indexes, parameters and decision variables. The objective function of the MIP model is to minimize the total cost which is consisted of transportation cost, fixed cost, and handling cost. The transportation cost is obtained by transporting the returned products between each centers and secondary markets. The fixed cost is calculated by opening or closing decision at each center and secondary markets. That is, if there are three collection centers (the opening costs of collection center 1 2, and 3 are 10.5, 12.1, 8.9, respectively), and the collection center 1 is opened and the remainders are all closed, then the fixed cost is 10.5. The handling cost means the cost of treating the products returned from customers at each center and secondary markets which are opened at each RLNCC stage. The RLNCC is solved by the proposed HGA approach. In numerical experiment, the proposed HGA and a conventional competing approach is compared with each other using various measures of performance. For the conventional competing approach, the GA approach by Yun (2013) is used. The GA approach has not any local search technique such as the IHCM proposed the HGA approach. As measures of performance, CPU time, optimal solution, and optimal setting are used. Two types of the RLNCC with different numbers of customers, collection centers, remanufacturing centers, redistribution centers and secondary markets are presented for comparing the performances of the HGA and GA approaches. The MIP models using the two types of the RLNCC are programmed by Visual Basic Version 6.0, and the computer implementing environment is the IBM compatible PC with 3.06Ghz CPU speed and 1GB RAM on Windows XP. The parameters used in the HGA and GA approaches are that the total number of generations is 10,000, population size 20, crossover rate 0.5, mutation rate 0.1, and the search range for the IHCM is 2.0. Total 20 iterations are made for eliminating the randomness of the searches of the HGA and GA approaches. With performance comparisons, network representations by opening/closing decision, and convergence processes using two types of the RLNCCs, the experimental result shows that the HGA has significantly better performance in terms of the optimal solution than the GA, though the GA is slightly quicker than the HGA in terms of the CPU time. Finally, it has been proved that the proposed HGA approach is more efficient than conventional GA approach in two types of the RLNCC since the former has a GA search process as well as a local search process for additional search scheme, while the latter has a GA search process alone. For a future study, much more large-sized RLNCCs will be tested for robustness of our approach.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.2
• /
• pp.406-414
• /
• 2002

A new approach, referred to as a successive zooming genetic algorithm (SZGA), is Proposed for identifying a global solution for continuous optimization problems. In order to improve the local fine-tuning capability of GA, we introduced a new method whereby the search space is zoomed around the design point with the best fitness per 100 generation. Furthermore, the reliability of the optimized solution is determined based on the theory of probability. To demonstrate the superiority of the proposed algorithm, a simple genetic algorithm, micro genetic algorithm, and the proposed algorithm were tested as regards for the minimization of a multiminima function as well as simple functions. The results confirmed that the proposed SZGA significantly improved the ability of the algorithm to identify a precise global minimum. As an example of structural optimization, the SZGA was applied to the optimal location of support points for weight minimization in the radial gate of a dam structure. The proposed algorithm identified a more exact optimum value than the standard genetic algorithms.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.22 no.1
• /
• pp.61-73
• /
• 2012

The paper presents the novel approach to solve some problems occurred in application of the genetic algorithm to the determination of the optimal tire pattern sequence in order to reduce the tire air-pumping noise which is generated by the repeated compression and expansion of the air cavity between tire pattern and road surface. The genetic algorithm has been used to find the optimal tire pattern sequence having a low level of tire air-pumping noise using the image based air-pumping model. In the genetic algorithm used in the previous researches, there are some problems in the encoding structure and the selection of objective function. The paper proposed single encoding element with five integers, divergent objective function based on evolutionary process and the optimal evolutionary rate based on Shannon entropy to solve the problems. The results of the proposed genetic algorithm with evolutionary process are compared with those of the randomized algorithm without evolutionary process on the two-dimensional normal distribution. It is confirmed that the genetic algorithm is more effective to reduce the peak value of the predicted tire air-pumping noise and the consistency and cohesion of the obtained simulation results are also improved in terms of probability.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.1 s.94
• /
• pp.49-60
• /
• 1999

This paper addresses a welding task sequencing for robot arc welding process planning. Although welding task sequencing is an essential step in the welding process planning, it has not been considered through a systematic approach, but it depends rather on empirical knowledge. Thus, an effective task sequencing for robot arc welding is required. Welding perations can be classified by the number of welding robots. Genetic algorithms are applied to tackle those welding task sequencing problems. A genetic algorithm for traveling salesman problem (TSP) is utilized to determine welding task sequencing for a MultiWeldline-SingleLayer problem. Further, welding task sequencing for multiWeldline-MultiLayer welding is investigated and appropriate genetic algorithms are introduced. A random key genetic algorithm is also proposed to solve multi-robot welding sequencing : MultiWeldline with multi robots. Finally, the genetic algorithm are implemented for the welding task sequencing of three dimensional weld plate assemblies. Robot welding operations conforming to the algorithms are simulated in graphic detail using a robot simulation software IGRIP.

• Asian-Australasian Journal of Animal Sciences
• /
• v.16 no.9
• /
• pp.1247-1253
• /
• 2003

Selection for increased milk production in dairy cows has often resulted in a higher incidence of disease and thus incurred a greater health costs. Considerable interests have been shown in breeding dairy cattle for disease resistance in recent years. This paper discusses the limitations of breeding dairy cattle for genetic resistance in six parts: 1) complexity of disease resistance, 2) difficulty in estimating genetic parameters for planning breeding programs against disease, 3) undesirable relationship between production traits and disease, 4) disease as affected by recessive genes, 5) new mutation of the pathogens, and 6) variable environmental factors. The hidden problems of estimating genetic and phenotypic parameters involving disease incidence were examined in terms of categorical nature, non-independence, heterogeneity of error variance, non-randomness, and automatic relationship between disease and production traits. In light of these limitations, the prospect for increasing genetic resistance by conventional breeding methods would not be so bright as we like. Since the phenomenon of disease is the result of a joint interaction among host genotype, pathogen genotype and environment, it becomes essential to adopt an integrated approach of increasing genetic resistance of the host animals, manipulating the pathogen genotypes, developing effective vaccines and drugs, and improving the environmental conditions. The advances in DNA-based technology show considerable promise in directly manipulating host and pathogen genomes for genetic resistance and producing vaccines and drugs for prevention and medication to promote the wellbeing of the animals.

• BMB Reports
• /
• v.46 no.8
• /
• pp.416-421
• /
• 2013

Genome-wide association studies (GWAS) have become popular as an approach for the identification of large numbers of phenotype-associated variants. However, differences in genetic architecture and environmental factors mean that the effect of variants can vary across populations. Understanding population genetic diversity is valuable for the investigation of possible population specific and independent effects of variants. EvoSNP-DB aims to provide information regarding genetic diversity among East Asian populations, including Chinese, Japanese, and Korean. Non-redundant SNPs (1.6 million) were genotyped in 54 Korean trios (162 samples) and were compared with 4 million SNPs from HapMap phase II populations. EvoSNP-DB provides two user interfaces for data query and visualization, and integrates scores of genetic diversity (Fst and VarLD) at the level of SNPs, genes, and chromosome regions. EvoSNP-DB is a web-based application that allows users to navigate and visualize measurements of population genetic differences in an interactive manner, and is available online at [http://biomi.cdc.go.kr/EvoSNP/].

• Genomics & Informatics
• /
• v.21 no.2
• /
• pp.26.1-26.9
• /
• 2023

Stevens-Johnson syndrome (SJS) produces a severe hypersensitivity reaction caused by Herpes simplex virus or mycoplasma infection, vaccination, systemic disease, or other agents. Several studies have investigated the genetic susceptibility involved in SJS. To provide further genetic insights into the pathogenesis of SJS, this study prioritized high-impact, SJS-associated pathogenic variants through integrating bioinformatic and population genetic data. First, we identified SJS-associated single nucleotide polymorphisms from the genome-wide association studies catalog, followed by genome annotation with HaploReg and variant validation with Ensembl. Subsequently, expression quantitative trait locus (eQTL) from GTEx identified human genetic variants with differential gene expression across human tissues. Our results indicate that two variants, namely rs2074494 and rs5010528, which are encoded by the HLA-C (human leukocyte antigen C) gene, were found to be differentially expressed in skin. The allele frequencies for rs2074494 and rs5010528 also appear to significantly differ across continents. We highlight the utility of these population-specific HLA-C genetic variants for genetic association studies, and aid in early prognosis and disease treatment of SJS.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.4
• /
• pp.583-595
• /
• 2008

In this paper, we introduce a fuzzy nonlinear feedback approach to the control of a class of chaotic dynamical systems. The fuzzy Parallel Distributed Compensation with Reduced Rule Base approach (PDC_RRB) is proposed. The design procedure is conceptually simple and considered to a nonlinear optimal and robust control problem due to the nonlinear nature of the Takagi-Sugeno (TS) fuzzy system. Simulation results are provided to show the effictiveness of the proposed methodology.

• Journal of Navigation and Port Research
• /
• v.32 no.5
• /
• pp.355-361
• /
• 2008

Stereo matching is one of the most active research areas in computer vision. In this paper, we propose a stereo matching scheme using genetic algorithm for object depth recognition. The proposed approach considers the matching environment as an optimization problem and finds the optimal solution by using an evolutionary strategy. Accordingly, genetic operators are adapted for the circumstances of stereo matching. An individual is a disparity set. Horizontal pixel line of image is considered as a chromosome. A cost function is composed of certain constraints which are commonly used in stereo matching. Since the cost function consists of intensity, similarity and disparity smoothness, the matching process is considered at the same time in each generation. The LoG(Laplacian of Gaussian) edge is extracted and used in the determination of the chromosome. We validate our approach with experimental results on stereo images.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.20 no.7
• /
• pp.81-91
• /
• 2006

Recently, G.A studies have studied and demonstrated that artificial intelligence like G.A networks, G.A PI controller. The design techniques of PI controller using G.A with the newly proposed teaming algorithm was presented, and the designed controller with AC servo motor system. The goal of this paper is to design the AC servo motor using genetic algorithm and to control drive robot. And in this paper, we propose a genetic algorithms approach to find an optimal or near optimal input variables for genetic algorithm PI controller. Our experimental results show that this approach increases overall classification accuracy rate significantly. Finally, we executed for the implementation of high performance speed control system. It is used a 16-bit DSP, IMS320LF2407, which is capable of the high speed and floating point calculation.