Optimal recombination in genetic algorithms for combinatorial optimization problems: Part I

This paper surveys results on complexity of the optimal recombination problem (ORP), which consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions. We consider efficient reductions of the ORPs, allowing to es...

Full description

Bibliographic Details
Main Authors: Eremeev Anton V., Kovalenko Julia V.
Format: Article
Language:English
Published: University of Belgrade 2014-01-01
Series:Yugoslav Journal of Operations Research
Subjects:
Online Access:http://www.doiserbia.nb.rs/img/doi/0354-0243/2014/0354-02431300040E.pdf