• Title/Summary/Keyword: Genetic algorithm optimization

Search Result 1,869, Processing Time 0.036 seconds

Application of Genetic and Local Optimization Algorithms for Object Clustering Problem with Similarity Coefficients (유사성 계수를 이용한 군집화 문제에서 유전자와 국부 최적화 알고리듬의 적용)

  • Yim, Dong-Soon;Oh, Hyun-Seung
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.29 no.1
    • /
    • pp.90-99
    • /
    • 2003
  • Object clustering, which makes classification for a set of objects into a number of groups such that objects included in a group have similar characteristic and objects in different groups have dissimilar characteristic each other, has been exploited in diverse area such as information retrieval, data mining, group technology, etc. In this study, an object-clustering problem with similarity coefficients between objects is considered. At first, an evaluation function for the optimization problem is defined. Then, a genetic algorithm and local optimization technique based on heuristic method are proposed and used in order to obtain near optimal solutions. Solutions from the genetic algorithm are improved by local optimization techniques based on object relocation and cluster merging. Throughout extensive experiments, the validity and effectiveness of the proposed algorithms are tested.

A Study on Optimal Design of Rocker Arm Shaft using Genetic Algorithm (유전자 알고리즘을 이용한 로커암 축의 최적설계에 관한 연구)

  • 안용수;이수진;이동우;홍순혁;조석수;주원식
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2004.10a
    • /
    • pp.198-202
    • /
    • 2004
  • This study proposes a new optimization algorithm which is combined with genetic algorithm and ANOM. This improved genetic algorithm is not only faster than the simple genetic algorithm, but also gives a more accurate solution. The optimizing ability and convergence rate of a new optimization algorithm is identified by using a test function which have several local optimum and an optimum design of rocker arm shaft. The calculation results are compared with the simple genetic algorithm.

  • PDF

A Study on Optimal Design of Rocker Arm Shaft Using Improved Genetic Algorithm (개선된 유전자 알고리즘을 이용한 로커암 축의 최적설계에 관한 연구)

  • Lee Soo Jin;An Yong Su;Lee Dong Woo;Cho Seok Swoo;Joo Won Sik
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.29 no.6 s.237
    • /
    • pp.835-841
    • /
    • 2005
  • This study proposes a new optimization algorithm which is combined with genetic algorithm and ANOM. This improved genetic algorithm is not only faster than the simple genetic algorithm, but also gives a more accurate solution. The optimizing ability and convergence rate of a new optimization algorithm is identified by using a evaluation function which have several local optimum and an optimum design of rocker arm shaft. The calculation results are compared with the simple genetic algorithm.

Micro Genetic Algorithms in Structural Optimization and Their Applications (마이크로 유전알고리즘을 이용한 구조최적설계 및 응용에 관한 연구)

  • 김종헌;이종수;이형주;구본홍
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2002.04a
    • /
    • pp.225-232
    • /
    • 2002
  • Simple genetic algorithm(SGA) has been used to optimize a lot of structural optimization problems because it can optimize non-linear problems and obtain the global solution. But, because of large evolving populations during many generations, it takes a long time to calculate fitness. Therefore this paper applied micro-genetic algorithm(μ -GA) to structural optimization and compared results of μ -GA with results of SGA. Additionally, the Paper applied μ -GA to gate optimization problem for injection molds by using simulation program CAPA.

  • PDF

Performance Evaluation and Parametric Study of MGA in the Solution of Mathematical Optimization Problems (수학적 최적화 문제를 이용한 MGA의 성능평가 및 매개변수 연구)

  • Cho, Hyun-Man;Lee, Hyun-Jin;Ryu, Yeon-Sun;Kim, Jeong-Tae;Na, Won-Bae;Lim, Dong-Joo
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2008.04a
    • /
    • pp.416-421
    • /
    • 2008
  • A Metropolis genetic algorithm (MGA) is a newly-developed hybrid algorithm combining simple genetic algorithm (SGA) and simulated annealing (SA). In the algorithm, favorable features of Metropolis criterion of SA are incorporated in the reproduction operations of SGA. This way, MGA alleviates the disadvantages of finding imprecise solution in SGA and time-consuming computation in SA. It has been successfully applied and the efficiency has been verified for the practical structural design optimization. However, applicability of MGA for the wider range of problems should be rigorously proved through the solution of mathematical optimization problems. Thus, performances of MGA for the typical mathematical problems are investigated and compared with those of conventional algorithms such as SGA, micro genetic algorithm (${\mu}GA$), and SA. And, for better application of MGA, the effects of acceptance level are also presented. From numerical Study, it is again verified that MGA is more efficient and robust than SA, SGA and ${\mu}GA$ in the solution of mathematical optimization problems having various features.

  • PDF

Multimodal Optimization Based on Global and Local Mutation Operators

  • Jo, Yong-Gun;Lee, Hong-Gi;Sim, Kwee-Bo;Kang, Hoon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1283-1286
    • /
    • 2005
  • Multimodal optimization is one of the most interesting topics in evolutionary computational discipline. Simple genetic algorithm, a basic and good-performance genetic algorithm, shows bad performance on multimodal problems, taking long generation time to obtain the optimum, converging on the local extrema in early generation. In this paper, we propose a new genetic algorithm with two new genetic mutational operators, i.e. global and local mutation operators, and no genetic crossover. The proposed algorithm is similar to Simple GA and the two genetic operators are as simple as the conventional mutation. They just mutate the genes from left or right end of a chromosome till the randomly selected gene is replaced. In fact, two operators are identical with each other except for the direction where they are applied. Their roles of shaking the population (global searching) and fine tuning (local searching) make the diversity of the individuals being maintained through the entire generation. The proposed algorithm is, therefore, robust and powerful.

  • PDF

Optimization of Fuzzy Car Controller Using Genetic Algorithm

  • Kim, Bong-Gi;Song, Jin-Kook;Shin, Chang-Doon
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.2
    • /
    • pp.222-227
    • /
    • 2008
  • The important problem in designing a Fuzzy Logic Controller(FLC) is generation of fuzzy control rules and it is usually the case that they are given by human experts of the problem domain. However, it is difficult to find an well-trained expert to any given problem. In this paper, I describes an application of genetic algorithm, a well-known global search algorithm to automatic generation of fuzzy control rules for FLC design. Fuzzy rules are automatically generated by evolving initially given fuzzy rules and membership functions associated fuzzy linguistic terms. Using genetic algorithm efficient fuzzy rules can be generated without any prior knowledge about the domain problem. In addition expert knowledge can be easily incorporated into rule generation for performance enhancement. We experimented genetic algorithm with a non-trivial vehicle controling problem. Our experimental results showed that genetic algorithm is efficient for designing any complex control system and the resulting system is robust.