• International Journal of Precision Engineering and Manufacturing
• /
• v.1 no.1
• /
• pp.62-70
• /
• 2000

The design of gear train is a kind of mixed problems which have to determine various types of design variables; i,e., continuous, discrete, and integer variables. Therefore, the most common practice of optimum design using the derivative of objective function has difficulty in solving those kinds of problems and the optimum solution also depends on initial guess because there are many sophisticated constrains. In this study, the Genetic Algorithm is introduced for the optimum design of gear trains to solve such problems and we propose a genetic algorithm based gear design system. This system is applied for the geometrical volume(size) minimization problem of the two-stage gear train and the simple planetary gear train to show that genetic algorithm is better than the conventional algorithm solving the problems that have continuous, discrete, and integer variables. In this system, each design factor such as strength, durability, interference, contact ratio, etc. is considered on the basis of AGMA standards to satisfy the required design specification and the performance with minimizing the geometrical volume(size) of gear trains

• Journal of the military operations research society of Korea
• /
• v.25 no.2
• /
• pp.117-129
• /
• 1999

We consider a Location-Allocation Problem with the Cost of Land(LAPCL). LAPCL has extremely huge size of problem and complex characteristic of location and allocation problem. Heuristics and decomposition approaches on simple Location-Allocation Problem were well developed in last three decades. Currently, genetic algorithm(GA) is used widely at combinatorics and NLP fields. A lot of research show that GA has efficiency for finding good solution. Our main motive of this research is developing of a GA in LAPCL. We found that LAPCL could be reduced to trivial problem, if locations were given. In this case, we can calculate fitness function by simple technique. We propose fourth alternative genetic algorithm. Computational experiments are carried out to find a best algorithm.

• Proceedings of the KSME Conference
• /
• 2001.06b
• /
• pp.584-589
• /
• 2001

This paper presents the dynamic parameter design optimization of a suspension seat system using the genetic algorithm. At first, an equivalent 1-D.O.F. mass-spring-damper model of a suspension seat system was constructed for the purpose of its vibration analysis. Vertical vibration response and transmissibility of the equivalent model due to base excitations, which are defined in the ISO's seat vibration test codes, were computed. Furthermore, seat vibration test, that is ISO's damping test, was carried out in order to investigate the validity of the equivalent suspension seat model. Both analytical and experimental results showed good agreement each other. For the design optimization, the acceleration transmissibility of the suspension seat model was adopted as an object function. A simple genetic algorithm was used to search the optimum values of the design variables, suspension stiffness and damping coefficient. Finally, vibration ride performance test results showed that the optimum suspension parameters gives the lowest vibration transmissibility. Accordingly the genetic algorithm and the equivalent suspension seat modelling can be successfully adopted in the vibration ride quality optimization of a suspension seat system.

• The KIPS Transactions:PartB
• /
• v.12B no.4 s.100
• /
• pp.429-436
• /
• 2005

A simple stereo matching algorithm using population-based incremental learning(PBIL) is proposed in this paper to decrease the general problem of genetic algorithms, such as memory consumption and inefficiency of search. PBIL is a variation of genetic algorithms using stochastic search and competitive teaming based on a probability vector. The structure of PBIL is simpler than that of other genetic algorithm families, such as serial and parallel ones, due to the use of a probability vector. The PBIL strategy is simplified and adapted for stereo matching circumstances. Thus, gene pool, chromosome crossover, and gene mutation we removed, while the evolution rule, that fitter chromosomes should have higher survival probabilities, is preserved. As a result, memory space is decreased, matching rules are simplified and computation cost is reduced. In addition, a scheme controlling the distance of neighbors for disparity smoothness is inserted to obtain a wide-area consistency of disparities, like a result of coarse-to-fine matchers. Because of this scheme, the proposed algorithm can produce a stable disparity map with a small fixed-size window. Finally, an alterative version of the proposed algorithm without using probability vector is also presented for simpler set-ups.

• Asian Pacific Journal of Cancer Prevention
• /
• v.17 no.7
• /
• pp.3651-3658
• /
• 2016

Computer-aided diagnosis of breast cancer is an important medical approach. In this research paper, we focus on combining two major methodologies, namely fuzzy base systems and the evolutionary genetic algorithms and on applying them to the Saudi Arabian breast cancer diagnosis database, to aid physicians in obtaining an early-computerized diagnosis and hence prevent the development of cancer through identification and removal or treatment of premalignant abnormalities; early detection can also improve survival and decrease mortality by detecting cancer at an early stage when treatment is more effective. Our hybrid algorithm, the genetic-fuzzy algorithm, has produced optimized systems that attain high classification performance, with simple and readily interpreted rules and with a good degree of confidence.

• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.131-138
• /
• 2022

A Mobile Ad-hoc Network (MANET) is a collection of moving nodes that communicate and collaborate without relying on a pre-existing infrastructure. In this type of network, nodes can freely move in any direction. Routing in this sort of network has always been problematic because of the mobility of nodes. Most existing protocols use simple routing algorithms and criteria, while another important criterion is path selection. The existing protocols should be optimized to resolve these deficiencies. 'Particle Swarm Optimization (PSO)' is an influenced method as it resembles the social behavior of a flock of birds. Genetic algorithms (GA) are search algorithms that use natural selection and genetic principles. This paper applies these optimization models to the OLSR routing protocol and compares their performances across different metrics and varying node sizes. The experimental analysis shows that the Genetic Algorithm is better compared to PSO. The comparison was carried out with the help of the simulation tool NS2, NAM (Network Animator), and xgraph, which was used to create the graphs from the trace files.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.3
• /
• pp.432-436
• /
• 2009

We have developed a new optimization algorithm termed simple bacteria cooperative optimization (sBCO) based on bacteria behavior patterns [1]. In [1], we have introduced the algorithm with basic operations and showed its feasibility with some function optimization problems. Since the sBCO was the first version with only basic operations, its performance was not so good. In this paper, we adopt a new operation, rank replacement, to the sBCO for improving its performance and compare its results to those of the simple genetic algorithm (sGA) which has been well known and widely used as an optimization algorithm. It was found from the experiments with four function optimization problems that the sBCO with rank replacement was superior to the sGA. This shows that our algorithm can be a good optimization algorithm.

• KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
• /
• v.5B no.3
• /
• pp.258-261
• /
• 2005

The Preisach model needs a distribution function or Everett function to simulate the hysteresis phenomena. To obtain these functions, many experimental data obtained from the first order transition curves are usually required. In this paper, a simple procedure to determine the Preisach density function using the Gaussian distribution function and genetic algorithm is proposed. The Preisach density function for the interaction field axis is known to have Gaussian distribution. To determine the density and distribution, genetic algorithm is adopted to decide the Gaussian parameters. With this method, just basic data like the initial magnetization curve or saturation curves are enough to get the agreeable density function. The results are compared with experimental data and we got good agreements comparing the simulation results with the experiment ones.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 1999.10a
• /
• pp.323-335
• /
• 1999

In this paper, we propose a new hybrid model of artificial neural networks(ANNs) and genetic algorithm (GA) to optimal feature transformation and feature weighting. Previous research proposed several variants of hybrid ANNs and GA models including feature weighting, feature subset selection and network structure optimization. Among the vast majority of these studies, however, ANNs did not learn the patterns of data well, because they employed GA for simple use. In this study, we incorporate GA in a simultaneous manner to improve the learning and generalization ability of ANNs. In this study, GA plays role to optimize feature weighting and feature transformation simultaneously. Globally optimized feature weighting overcome the well-known limitations of gradient descent algorithm and globally optimized feature transformation also reduce the dimensionality of the feature space and eliminate irrelevant factors in modeling ANNs. By this procedure, we can improve the performance and enhance the generalisability of ANNs.

• The KIPS Transactions:PartB
• /
• v.15B no.6
• /
• pp.609-612
• /
• 2008

Let G = (V, E) be a simple undirected graph. The Minimum Vertex Cover (MVC) problem is to find a minimum subset C of V such that for every edge, at least one of its endpoints should be included in C. Like many other graph theoretic problems this problem is also known to be NP-hard. In this paper, we propose a genetic algorithm called LeafGA for MVC problem and show the performance of the proposed algorithm by applying it to several published benchmark graphs.