1 #ifndef SHARK_ALGORITHMS_DIRECT_SEARCH_OPERATORS_RECOMBINATION_PARTIALLYMAPPEDCROSSOVER_H 2 #define SHARK_ALGORITHMS_DIRECT_SEARCH_OPERATORS_RECOMBINATION_PARTIALLYMAPPEDCROSSOVER_H 19 template<
class Rng,
typename Indiv
idualType>
27 std::size_t n = t1.size();
28 unsigned int unset =
static_cast<unsigned int>(n + 1);
35 PointType r1(n, unset), r2(n, unset);
36 PointType p1(n, unset), p2(n, unset);
40 for( std::size_t i = cuttingPoint1; i <= cuttingPoint2; i++ ) {
48 for( std::size_t i = 0; i < t1.size(); i++) {
49 if ((i >= cuttingPoint1) && (i <= cuttingPoint2))
continue;
51 std::size_t n1 = t1[i] ;
52 std::size_t m1 = r1[n1] ;
54 std::size_t n2 = t2[i] ;
55 std::size_t m2 = r2[n2] ;
75 template<
typename Archive>