Fine-grained Tournament Selection Operator in Genetic Algorithms

@article{Filipovic2003FinegrainedTS,
  title={Fine-grained Tournament Selection Operator in Genetic Algorithms},
  author={Vladimir Filipovic},
  journal={Computers and Artificial Intelligence},
  year={2003},
  volume={22},
  pages={143-161}
}
Tournament selection is one of the most popular selection operators in Genetic Algorithms. Recently, its popularity is increasing because this operator is well suited for Parallel Genetic Algorithms applications. In this paper, new selection operator is proposed. The new operator, which should be an improvement of the tournament selection, is named “Fine-grained Tournament Selection” (FGTS). It is shown that classical tournament selection is a special case of the FGTS and that new operator… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
26 Citations
33 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 26 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 33 references

A Genetic Algorithm for the Uncapacitated Network Design Problem

  • Kratica, J.—Tosic, D.—Filipovic, I.V.—Ljubic
  • Soft Computing in Industry — Recent Applications…
  • 2002

Experimental Results in Applying of Fine-grained Tournament Selection

  • Filipovic, V.—Tosic, J.D.—Kratica
  • Proceedings of the 10th Congress of Yugoslav…
  • 2001

Genetic Algorithm for Designing a Spread-Spectrum Radar Polyphase Code

  • Kratica, J.—Tosic, D.—Filipovic, I.V.—Ljubic
  • Proceedings of the 5th Online World Conference on…
  • 2000

Improvement of Simple Genetic Algorithm for Solving the Uncapacitated Warehouse Location Problem

  • J. Kratica
  • Advances in Soft Computing — Engineering Design…
  • 1999

Similar Papers

Loading similar papers…