The Parametric Design Based on Organizational Evolutionary Algorithm

  • Cao Chunhong
  • Zhang Bin
  • Wang Limin
  • Li Wenhui
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4099)

Abstract

Geometric constraint problem is equivalent to the problem of solving a set of nonlinear equations substantially. In this paper we propose a new optimization algorithm—organizational evolutionary algorithm (OEA) and apply it into the geometric constraint solving. In OEA the colony is composed of the organizations. Three organizational evolutionary operators–split operator, merging operator and coordinating operator can lead the colony to evolve. These three kinds of operators have different functions in the algorithm. Split operator limits the scale of the organization, and makes sure a part of organization come into next generation directly, which maintains the variety of the generation. Merging operator makes use of the leader’s information fully and acts as a local searching function. Cooperating operator increases the degree of adaptability between the two organizations by the interactions. The experiment shows that OEA has good capability in the geometric constraint solving.

Keywords

parametric design geometric constraint solving organizational evolutionary algorithm split operator merging operator coordinating operator 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Leung, Y.W., Wang, Y.: An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Transactions on Evolutionary Computation 5(1), 41–53 (2001)CrossRefGoogle Scholar
  2. 2.
    Kazarlis, S.A., Papadakis, S.E., Theocharis, J.B., Petridis, V.: Microgenetic algorithm as generalized hill-climbing operators for GA optimization. IEEE Transaction on Evolutionary Computation 5(3), 204–217 (2001)CrossRefGoogle Scholar
  3. 3.
    Lei, W., Jin, P., Li-Cheng, J.: The immune programming. Chinese Journal of Computer 23(8), 806–812 (2000)Google Scholar
  4. 4.
    Rui, J., Yu-Pin, L., Dong-Cheng, H., Kwok-Yip, S.: A genetic algorithm by coordinating exploration and exploitation—convergence properties and performance analysis. Chinese Journal of Computers 24(12), 1233–1241 (2001)MathSciNetGoogle Scholar
  5. 5.
    Ling, Z., Bo, Z.: Good point set based genetic algorithm. Chinese Journal of Computers 24(9), 917–922 (2001)MathSciNetGoogle Scholar
  6. 6.
    Wilcox, J.R.: Organizational learning within a learning classifier system [Master dissertation]. University of Illinois, Illinois, USA (1995)Google Scholar
  7. 7.
    Jing, L., Wei-Cai, Z., Fang, L., Li-Cheng, J.: Classification based on organizational coevolutionary algorithm. Chinese Journal of Computers 26(40), 446–453 (2003)Google Scholar
  8. 8.
    Shengli, L., Min, T., Jinxiang, D.: Geometric Constraint Satisfaction Using Genetic Simulated Annealing Algorithm. Journal of Image and Graphics 8(8), 938–945 (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Cao Chunhong
    • 1
  • Zhang Bin
    • 1
  • Wang Limin
    • 2
  • Li Wenhui
    • 2
  1. 1.College of Information Science and EngineeringNortheastern UniversityShenyangP.R. China
  2. 2.College of Computer Science and TechnologyJilin UniversityChangchunP.R. China

Personalised recommendations