27 #ifndef SHARK_ALGORITHMS_DIRECTSEARCH_OPERATORS_POPULATION_BASED_STEP_SIZE_ADAPTATION_H 28 #define SHARK_ALGORITHMS_DIRECTSEARCH_OPERATORS_POPULATION_BASED_STEP_SIZE_ADAPTATION_H 88 void init(
double initialStepSize){
98 template<
class Population>
100 std::size_t
lambda = offspring.size();
103 std::size_t indexOld = 0;
104 std::size_t indexNew = 0;
105 std::size_t rank = 1;
107 while(indexOld < lambda && indexNew < lambda){
108 if (offspring[indexNew].penalizedFitness() <=
m_prevFitness[indexOld]){
119 while(indexNew < lambda){
125 while(indexOld< lambda){
138 for(std::size_t i = 0; i !=
lambda; ++i)