Geodesic
Optimal Recombination in Genetic Algorithms for Combinatorial Optimiyation Problems Part II
Yugoslav journal of operations research, Tome 24 (2014) no. 2, p. 165 Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Voir la notice de l'article

Abstract: This paper surveys results on complexity of the optimal recombination problem (ORP), which consists in nding the best possible o spring as a result of a recombination operator in a genetic algorithm, given two parent solutions. In Part II, we consider the computational complexity of ORPs arising in genetic algorithms for problems on permutations: the Travelling Salesman Problem, the Short- est Hamilton Path Problem and the Makespan Minimization on Single Machine and some other related problems. The analysis indicates that the corresponding ORPs are NP-hard, but solvable by faster algorithms, compared to the problems they are derived from.
Classification : 90C59, 90C10.
Keywords: Keywords: Genetic Algorithm, Optimal Recombination Problem, complexity, 
@article{YJOR_2014_24_2_a0,
     author = {Anton V. Eremeev and Julia V. Kovalenko},
     title = {Optimal {Recombination} in {Genetic} {Algorithms} for {Combinatorial} {Optimiyation} {Problems} {Part} {II}},
     journal = {Yugoslav journal of operations research},
     pages = {165 },
     year = {2014},
     volume = {24},
     number = {2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_2014_24_2_a0/}
}
TY  - JOUR
AU  - Anton V. Eremeev
AU  - Julia V. Kovalenko
TI  - Optimal Recombination in Genetic Algorithms for Combinatorial Optimiyation Problems Part II
JO  - Yugoslav journal of operations research
PY  - 2014
SP  - 165 
VL  - 24
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/YJOR_2014_24_2_a0/
LA  - en
ID  - YJOR_2014_24_2_a0
ER  - 
%0 Journal Article
%A Anton V. Eremeev
%A Julia V. Kovalenko
%T Optimal Recombination in Genetic Algorithms for Combinatorial Optimiyation Problems Part II
%J Yugoslav journal of operations research
%D 2014
%P 165 
%V 24
%N 2
%U http://geodesic.mathdoc.fr/item/YJOR_2014_24_2_a0/
%G en
%F YJOR_2014_24_2_a0
Anton V. Eremeev; Julia V. Kovalenko. Optimal Recombination in Genetic Algorithms for Combinatorial Optimiyation Problems Part II. Yugoslav journal of operations research, Tome 24 (2014) no. 2, p. 165 . http://geodesic.mathdoc.fr/item/YJOR_2014_24_2_a0/