Segregative Genetic Algorithms (SEGA): A hybrid superstructure upwards compatible to genetic algorithms for retarding premature convergence

@article{Affenzeller2001SegregativeGA,
  title={Segregative Genetic Algorithms (SEGA): A hybrid superstructure upwards compatible to genetic algorithms for retarding premature convergence},
  author={Michael Affenzeller},
  journal={Int. J. Comput. Syst. Signal},
  year={2001},
  volume={2},
  pages={16-30}
}
Many problems of combinatorial optimization belong to the class of NP-complete problems and can be solved efficiently only by heuristics. Both, Genetic Algorithms and Evolution Strategies have a number of drawbacks that reduce their applicability to that kind of problems. During the last decades plenty of work has been investigated in order to introduce new coding standards and operators especially for Genetic Algorithms. All these approaches have one thing in common: They are very problem… CONTINUE READING

Similar Papers

Loading similar papers…