The genetic chromodynamics metaheuristic

  • Authors:
  • D. Dumitrescu;Catalin Stoean

  • Affiliations:
  • Department of Computer Science, Babes-Bolyai University of Cluj-Napoca, Cluj-Napoca, Romania;Department of Computer Science, University of Craiova, Craiova, Romania

  • Venue:
  • TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

An evolutionary metaheuristic called genetic chromodynamics and its applications to optimization, clustering and classification are presented in current paper. Genetic chromodynamics aims at maintaining population diversity and detecting multiple optima. All algorithms derived from genetic chromodynamics use a variable-sized population of solutions and a local interaction principle as selection for reproduction. Subpopulation formation is achieved through the interaction between individuals, without any modification of the objective function. Sub-populations evolve and eventually converge to several optima. Very close individuals are merged and thus population size may be decreased with each generation. At convergence, each final subpopulation contains a single individual which corresponds to one optimum (solution of the problem). The model can be successfully applied to various optimization issues in telecommunication.