需求：求解函數(shù) f(x) = x + 10*sin(5*x) + 7*cos(4*x) 在區(qū)間[0,9]的最大值。

1 <?php 2 /* 3 需求：求解函數(shù) f(x) = x + 10*sin(5*x) + 7*cos(4*x) 在區(qū)間[0,9]的最大值。 4 5 6 以我們的目標(biāo)函數(shù) f(x) = x + 10sin(5x) + 7cos(4x), x∈[0,9] 為例。 7 假如設(shè)定求解的精度為小數(shù)點(diǎn)后4位，可以將x的解空間劃分為 (9-0)×(1e+4)=90000個等分。 8 2^16<90000<2^17，需要17位二進(jìn)制數(shù)來表示這些解。換句話說，一個解的編碼就是一個17位的二進(jìn)制串。 9 一開始，這些二進(jìn)制串是隨機(jī)生成的。 10 一個這樣的二進(jìn)制串代表一條染色體串，這里染色體串的長度為17。 11 對于任何一條這樣的染色體chromosome，如何將它復(fù)原(解碼)到[0,9]這個區(qū)間中的數(shù)值呢？ 12 13 對于本問題，我們可以采用以下公式來解碼：x = 0 + decimal(chromosome)×(9-0)/(2^17-1) 14 15 */ 16 header("Content-Type:text/html;CharSet=UTF-8"); 17 //初始化參數(shù) 18 $elitism = true; //是否精英選擇 19 $population_size = 100; //種群大小 20 $chromosome_size = 17; //染色體長度 21 $generation_size = 200; //最大迭代次數(shù) 22 $cross_rate = 0.6; //交叉概率 23 $mutate_rate = 0.01; //變異概率 24 25 26 //初始化對象，執(zhí)行算法 27 $ga_object = new GAEngine($population_size, $chromosome_size, $generation_size, $cross_rate, $mutate_rate, $elitism); 28 29 $res = $ga_object->run(); 30 31 32 //打印結(jié)果 33 echo "迭代{$generation_size}代，最佳個體如下<br>"; 34 35 echo "染色體：{$res['m']}<br>"; 36 echo "對應(yīng)的X：{$res['q']}<br>"; 37 echo "結(jié)果：{$res['n']}<br>"; 38 echo "最佳個體出現(xiàn)的代：【{$res['p']}】<br>"; 39 40 41 42 43 44 //遺傳算法主要部分 45 class GAEngine 46 { 47 //初始化參數(shù) 48 public $elitism; //是否精英選擇 49 public $population_size; //種群大小 50 public $chromosome_size; //染色體長度 51 public $generation_size; //最大迭代次數(shù) 52 public $cross_rate; //交叉概率 53 public $mutate_rate; //變異概率 54 55 //全局參數(shù) 56 public $G; //當(dāng)前迭代次數(shù) 57 public $fitness_value; //當(dāng)前代適應(yīng)度矩陣 58 public $best_fitness; //歷代最佳適應(yīng)值 59 public $fitness_sum; //前i個個體的適應(yīng)度之和 60 public $fitness_average; //歷代平均適應(yīng)值矩陣 61 public $best_individual; //歷代最佳個體 62 public $best_generation; //最佳個體出現(xiàn)代 63 public $upper_bound = 9; //自變量的區(qū)間上限 64 public $lower_bound = 0; //自變量的區(qū)間下限 65 66 //對象 67 public $population_obj; //種群對象 68 69 70 public $populations; //種群數(shù)組 71 72 73 //初始化 74 public function __construct($population_size, $chromosome_size, $generation_size, $cross_rate, $mutate_rate, $elitism) 75 { 76 $this->elitism = $elitism; 77 $this->population_size = $population_size; 78 $this->chromosome_size = $chromosome_size; 79 $this->generation_size = $generation_size; 80 $this->cross_rate = $cross_rate; 81 $this->mutate_rate = $mutate_rate; 82 83 //初始化種群 84 $this->population_obj = new Populations($population_size, $chromosome_size); 85 86 } 87 88 //【執(zhí)行,返回結(jié)果】 89 public function run(){ 90 //初始化種群 91 $this->populations = $this->population_obj->initPop(); 92 93 //開始迭代 94 for($i = 1; $i < $this->generation_size; $i ++){ 95 $this->G = $i; 96 $this->fitness(); //計算適應(yīng)度 97 $this->rank(); //對個體按適應(yīng)度大小進(jìn)行排序 98 $this->selection();//選擇操作 99 $this->crossover(); //交叉操作 100 $this->mutation(); //變異操作 101 } 102 103 104 //最后，求出二進(jìn)制基因?qū)?yīng)的實(shí)數(shù)x，以及求出實(shí)數(shù)對應(yīng)的結(jié)果 105 $x = $this->upper_bound - bindec($this->best_individual)*($this->upper_bound - $this->lower_bound)/(pow(2, $this->chromosome_size) - 1); 106 107 return [ 108 'm' => $this->best_individual, //最佳個體 109 'n' => $this->best_fitness, //最佳適應(yīng)度 110 'p' => $this->best_generation, //最佳個體出現(xiàn)的代 111 'q' => $x //最佳個體基因?qū)?yīng)的實(shí)數(shù) 112 ]; 113 114 } 115 116 //【計算適應(yīng)度】 117 public function fitness(){ 118 //所有個體適應(yīng)度初始化為0 119 //遍歷每個個體的基因，求出對應(yīng)的實(shí)數(shù)，然后再計算出結(jié)果，即適應(yīng)度 120 for($i = 0; $i < $this->population_size; $i ++){ 121 // $gens = strrev($this->populations[$i]['gens']);//染色體字符串與實(shí)際的自變量x二進(jìn)制串順序是相反的 122 $x = $this->upper_bound - bindec($this->populations[$i]['gens'])*($this->upper_bound - $this->lower_bound)/(pow(2, $this->chromosome_size) - 1); 123 124 $fx = $x + 10*sin(5*$x) + 7*cos(4*$x);//函數(shù)值 125 126 $this->fitness_value[$i] = $fx; 127 128 } 129 } 130 131 //【排序】 132 //對個體按適應(yīng)度的大小進(jìn)行排序,并且保存最佳個體 133 public function rank(){ 134 //$this->fitness_value[] 保存適應(yīng)度的數(shù)組，根據(jù)此數(shù)組進(jìn)行排序，還要修改對應(yīng)個體的位置 135 //冒泡，從小到大排序 136 for($i = 0; $i < $this->population_size -1; $i ++){ 137 for($j = $i + 1; $j < $this->population_size; $j ++){ 138 if($this->fitness_value[$i] > $this->fitness_value[$j]){ 139 //交換適應(yīng)度 140 $tmp = $this->fitness_value[$i]; 141 $this->fitness_value[$i] = $this->fitness_value[$j]; 142 $this->fitness_value[$j] = $tmp; 143 144 //交換種群個體位置 145 $tmp = $this->populations[$i]; 146 $this->populations[$i] = $this->populations[$j]; 147 $this->populations[$j] = $tmp; 148 } 149 } 150 } 151 152 //計算前i個給個體的適應(yīng)度之和 153 $fitness_sum[0] = $this->fitness_value[0]; 154 for($i = 1; $i < $this->population_size; $i ++){ 155 $fitness_sum[$i] = $fitness_sum[$i - 1] +$this->fitness_value[$i]; 156 } 157 $this->fitness_sum = $fitness_sum; 158 159 //第G代迭代， 個體的平均適應(yīng)度 160 $this->fitness_average[$this->G] = ($fitness_sum[$this->population_size - 1] / $this->population_size); 161 162 //更新最大適應(yīng)度和對應(yīng)的迭代次數(shù)，保存最佳個體（最佳個體適應(yīng)度最大） 163 if($this->fitness_value[$this->population_size - 1] > $this->best_fitness){ 164 $this->best_fitness = $this->fitness_value[$this->population_size - 1]; 165 $this->best_generation = $this->G; 166 $this->best_individual = $this->populations[$this->population_size -1]['gens']; 167 } 168 169 } 170 171 //【選擇】 172 public function selection(){ 173 $population_new = [];//保存被選中的個體 174 175 //二分查找實(shí)現(xiàn)輪盤賭功能 176 for($i = 0; $i < $this->population_size; $i ++){ 177 $r = (rand(0,10)/10 ) * $this->fitness_sum[$this->population_size - 1];//生成一個隨機(jī)數(shù)，在[0,總適應(yīng)度] 之間 178 $first = 1; 179 $last = $this->population_size; 180 $mid = round( ($last + $first) / 2 ); 181 $idx = -1; 182 183 184 //排中法選擇個體 185 while(($first <= $last) && ($idx == -1)){ 186 if($r > $this->fitness_sum[$mid]){ 187 $first = $mid; 188 }elseif ( $r < $this->fitness_sum[$mid]){ 189 $last = $mid; 190 }else{ 191 $idx = $mid; 192 break; 193 } 194 $mid = round( ($last + $first) / 2 ); 195 if(($last - $first) == 1){ 196 $idx = $last; 197 break; 198 } 199 200 } 201 202 //產(chǎn)生新的個體 203 //echo $idx.'='; 204 $population_new[$i]['gens'] = $this->populations[$idx]['gens']; 205 } 206 207 //是否精英選擇 208 if($this->elitism){ 209 $p = $this->population_size - 1; 210 }else{ 211 $p = $this->population_size; 212 } 213 214 for($i = 0; $i < $p; $i ++){ 215 if(isset($population_new[$i])) 216 $this->populations[$i] = $population_new[$i]; 217 } 218 219 } 220 221 //【交叉】 222 public function crossover(){ 223 //步長為2, 遍歷種群 224 for($i = 0; $i < $this->population_size; $i+=2){ 225 //rand < 交叉概率，對2個個體的染色體進(jìn)行交叉操作 226 $r = $this->randFloat();//產(chǎn)生0~1的隨機(jī)數(shù) 227 if($r < $this->cross_rate){ 228 // $r =$this->randFloat(); 229 // $cross_pos = round($r * $this->chromosome_size); 230 $cross_pos = rand(0, $this->chromosome_size); 231 if($cross_pos ==0 || $cross_pos == $this->chromosome_size) 232 continue; 233 //對 cross_pos及之后的二進(jìn)制串進(jìn)行交換 234 $x = $this->populations[$i]['gens']; 235 $y = $this->populations[$i+1]['gens']; 236 $tmp1 = substr($x,0, $cross_pos).substr($y,$cross_pos); 237 $tmp2 = substr($y,0,$cross_pos).substr($x, $cross_pos); 238 239 $this->populations[$i]['gens'] = $tmp1; 240 $this->populations[$i+1]['gens'] = $tmp2; 241 } 242 } 243 } 244 245 //【變異】 246 public function mutation(){ 247 for($i =0; $i < $this->population_size; $i ++){ 248 if($this->randFloat() < $this->mutate_rate){ 249 $mutate_pos = rand(0,$this->chromosome_size -1); 250 $this->populations[$i]['gens'][$mutate_pos] = 1 - $this->populations[$i]['gens'][$mutate_pos]; 251 } 252 253 } 254 } 255 256 257 258 public function show($data){ 259 echo '<pre>'; 260 var_dump($data); 261 echo '<hr>'; 262 } 263 264 //隨機(jī)產(chǎn)生0-1的小數(shù) 265 function randFloat($min=0, $max=1){ 266 return $min + mt_rand()/mt_getrandmax() * ($max-$min); 267 } 268 269 } 270 271 //種群 272 class Populations 273 { 274 public $population_size;//種群大小 275 public $chromosome_size;//染色體長度 276 277 //初始化參數(shù) 278 public function __construct($population_size, $chromosome_size) 279 { 280 $this->population_size = $population_size; 281 $this->chromosome_size = $chromosome_size; 282 } 283 284 //初始化種群 285 public function initPop(){ 286 $pop = []; 287 for($i = 0; $i < $this->population_size; $i ++){ 288 for($j = 0; $j < $this->chromosome_size; $j ++){ 289 $pop[$i]['gens'] .= rand(0, 10) % 2;//產(chǎn)生1-0隨機(jī)數(shù) 290 } 291 } 292 293 return $pop; 294 } 295 296 }

?

參考：

　　知乎：https://www.zhihu.com/question/23293449

　　MATLAB的實(shí)現(xiàn)GitHub地址：https://github.com/yanshengjia/artificial-intelligence/tree/master/genetic-algorithm-for-functional-maximum-problem

?

附錄：把個體單獨(dú)抽出來放到一個類中

1 <?php 2 /* 3 需求：求解函數(shù) f(x) = x + 10*sin(5*x) + 7*cos(4*x) 在區(qū)間[0,9]的最大值。 4 5 6 以我們的目標(biāo)函數(shù) f(x) = x + 10sin(5x) + 7cos(4x), x∈[0,9] 為例。 7 假如設(shè)定求解的精度為小數(shù)點(diǎn)后4位，可以將x的解空間劃分為 (9-0)×(1e+4)=90000個等分。 8 2^16<90000<2^17，需要17位二進(jìn)制數(shù)來表示這些解。換句話說，一個解的編碼就是一個17位的二進(jìn)制串。 9 一開始，這些二進(jìn)制串是隨機(jī)生成的。 10 一個這樣的二進(jìn)制串代表一條染色體串，這里染色體串的長度為17。 11 對于任何一條這樣的染色體chromosome，如何將它復(fù)原(解碼)到[0,9]這個區(qū)間中的數(shù)值呢？ 12 13 對于本問題，我們可以采用以下公式來解碼：x = 0 + decimal(chromosome)×(9-0)/(2^17-1) 14 15 */ 16 header("Content-Type:text/html;CharSet=UTF-8"); 17 //初始化參數(shù) 18 $elitism = true; //是否精英選擇 19 $population_size = 100; //種群大小 20 $chromosome_size = 17; //染色體長度 21 $generation_size = 200; //最大迭代次數(shù) 22 $cross_rate = 0.6; //交叉概率 23 $mutate_rate = 0.01; //變異概率 24 25 26 //初始化對象，執(zhí)行算法 27 $ga_object = new GAEngine($population_size, $chromosome_size, $generation_size, $cross_rate, $mutate_rate, $elitism); 28 29 $res = $ga_object->run(); 30 31 32 //打印結(jié)果 33 echo "迭代{$generation_size}代，最佳個體如下<br>"; 34 35 echo "染色體：{$res['m']}<br>"; 36 echo "對應(yīng)的X：{$res['q']}<br>"; 37 echo "結(jié)果：{$res['n']}<br>"; 38 echo "最佳個體出現(xiàn)的代：【{$res['p']}】<br>"; 39 40 41 42 43 44 //遺傳算法主要部分 45 class GAEngine 46 { 47 //初始化參數(shù) 48 public $elitism; //是否精英選擇 49 public $population_size; //種群大小 50 public $chromosome_size; //染色體長度 51 public $generation_size; //最大迭代次數(shù) 52 public $cross_rate; //交叉概率 53 public $mutate_rate; //變異概率 54 55 //全局參數(shù) 56 public $G; //當(dāng)前迭代次數(shù) 57 public $fitness_value; //當(dāng)前代適應(yīng)度矩陣 58 public $best_fitness; //歷代最佳適應(yīng)值 59 public $fitness_sum; //前i個個體的適應(yīng)度之和 60 public $fitness_average; //歷代平均適應(yīng)值矩陣 61 public $best_individual; //歷代最佳個體 62 public $best_generation; //最佳個體出現(xiàn)代 63 public $upper_bound = 9; //自變量的區(qū)間上限 64 public $lower_bound = 0; //自變量的區(qū)間下限 65 66 //對象 67 public $population_obj; //種群對象 68 69 70 public $populations; //種群數(shù)組 71 72 73 //初始化 74 public function __construct($population_size, $chromosome_size, $generation_size, $cross_rate, $mutate_rate, $elitism) 75 { 76 $this->elitism = $elitism; 77 $this->population_size = $population_size; 78 $this->chromosome_size = $chromosome_size; 79 $this->generation_size = $generation_size; 80 $this->cross_rate = $cross_rate; 81 $this->mutate_rate = $mutate_rate; 82 83 //初始化種群 84 $this->population_obj = new Populations($population_size, $chromosome_size); 85 86 } 87 88 //【執(zhí)行,返回結(jié)果】 89 public function run(){ 90 //初始化種群 91 $this->populations = $this->population_obj->initPop(); 92 93 //開始迭代 94 for($i = 1; $i <= $this->generation_size; $i ++){ 95 $this->G = $i; 96 $this->fitness(); //計算適應(yīng)度 97 $this->rank(); //對個體按適應(yīng)度大小進(jìn)行排序 98 $this->selection();//選擇操作 99 $this->crossover(); //交叉操作 100 $this->mutation(); //變異操作 101 } 102 103 104 //最后，求出二進(jìn)制基因?qū)?yīng)的實(shí)數(shù)x，以及求出實(shí)數(shù)對應(yīng)的結(jié)果 105 $x = $this->upper_bound - bindec($this->best_individual)*($this->upper_bound - $this->lower_bound)/(pow(2, $this->chromosome_size) - 1); 106 107 return [ 108 'm' => $this->best_individual, //最佳個體 109 'n' => $this->best_fitness, //最佳適應(yīng)度 110 'p' => $this->best_generation, //最佳個體出現(xiàn)的代 111 'q' => $x //最佳個體基因?qū)?yīng)的實(shí)數(shù) 112 ]; 113 114 } 115 116 //【計算適應(yīng)度】 117 public function fitness(){ 118 //所有個體適應(yīng)度初始化為0 119 //遍歷每個個體的基因，求出對應(yīng)的實(shí)數(shù)，然后再計算出結(jié)果，即適應(yīng)度 120 for($i = 0; $i < $this->population_size; $i ++){ 121 // $gens = strrev($this->populations[$i]['gens']);//染色體字符串與實(shí)際的自變量x二進(jìn)制串順序是相反的 122 $x = $this->upper_bound - bindec($this->populations[$i]->chromosomes)*($this->upper_bound - $this->lower_bound)/(pow(2, $this->chromosome_size) - 1); 123 124 $fx = $x + 10*sin(5*$x) + 7*cos(4*$x);//函數(shù)值 125 126 // $this->fitness_value[$i] = $fx; 127 $this->populations[$i]->fitness = $fx; 128 129 } 130 } 131 132 //【排序】 133 //對個體按適應(yīng)度的大小進(jìn)行排序,并且保存最佳個體 134 public function rank(){ 135 //冒泡，從小到大排序 136 for($i = 0; $i < $this->population_size -1; $i ++){ 137 for($j = $i + 1; $j < $this->population_size; $j ++){ 138 if($this->populations[$i]->fitness > $this->populations[$j]->fitness){ 139 //交換個體 140 $tmp = $this->populations[$i]; 141 $this->populations[$i] = $this->populations[$j]; 142 $this->populations[$j] = $tmp; 143 } 144 } 145 } 146 147 //計算前i個給個體的適應(yīng)度之和 148 $fitness_sum[0] = $this->populations[0]->fitness; 149 for($i = 1; $i < $this->population_size; $i ++){ 150 $fitness_sum[$i] = $fitness_sum[$i - 1] + $this->populations[$i]->fitness; 151 } 152 $this->fitness_sum = $fitness_sum; 153 154 //第G代迭代， 個體的平均適應(yīng)度 155 $this->fitness_average[$this->G] = ($fitness_sum[$this->population_size - 1] / $this->population_size); 156 157 //更新最大適應(yīng)度和對應(yīng)的迭代次數(shù)，保存最佳個體（最佳個體適應(yīng)度最大） 158 if($this->populations[$this->population_size - 1]->fitness > $this->best_fitness){ 159 $this->best_fitness = $this->populations[$this->population_size - 1]->fitness; 160 $this->best_generation = $this->G; 161 $this->best_individual = $this->populations[$this->population_size -1]->chromosomes; 162 } 163 164 } 165 166 //【選擇】 167 public function selection(){ 168 $population_new = [];//保存被選中的個體 169 170 //二分查找實(shí)現(xiàn)輪盤賭功能 171 for($i = 0; $i < $this->population_size; $i ++){ 172 $r = (rand(0,10)/10 ) * $this->fitness_sum[$this->population_size - 1];//生成一個隨機(jī)數(shù)，在[0,總適應(yīng)度] 之間 173 $first = 1; 174 $last = $this->population_size; 175 $mid = round( ($last + $first) / 2 ); 176 $idx = -1; 177 178 179 //排中法選擇個體 180 while(($first <= $last) && ($idx == -1)){ 181 if($r > $this->fitness_sum[$mid]){ 182 $first = $mid; 183 }elseif ( $r < $this->fitness_sum[$mid]){ 184 $last = $mid; 185 }else{ 186 $idx = $mid; 187 break; 188 } 189 $mid = round( ($last + $first) / 2 ); 190 if(($last - $first) == 1){ 191 $idx = $last; 192 break; 193 } 194 195 } 196 197 //產(chǎn)生新的個體 198 //echo $idx.'='; 199 $population_new[$i] = $this->populations[$idx]; 200 } 201 202 //是否精英選擇 203 if($this->elitism){ 204 $p = $this->population_size - 1; 205 }else{ 206 $p = $this->population_size; 207 } 208 209 for($i = 0; $i < $p; $i ++){ 210 if(isset($population_new[$i])) 211 $this->populations[$i] = $population_new[$i]; 212 } 213 214 } 215 216 //【交叉】 217 public function crossover(){ 218 //步長為2, 遍歷種群 219 for($i = 0; $i < $this->population_size; $i+=2){ 220 //rand < 交叉概率，對2個個體的染色體進(jìn)行交叉操作 221 $r = $this->randFloat();//產(chǎn)生0~1的隨機(jī)數(shù) 222 if($r < $this->cross_rate){ 223 // $r =$this->randFloat(); 224 // $cross_pos = round($r * $this->chromosome_size); 225 $cross_pos = rand(0, $this->chromosome_size); 226 if($cross_pos ==0 || $cross_pos == $this->chromosome_size) 227 continue; 228 //對 cross_pos及之后的二進(jìn)制串進(jìn)行交換 229 $x = $this->populations[$i]->chromosomes; 230 $y = $this->populations[$i+1]->chromosomes; 231 $tmp1 = substr($x,0, $cross_pos).substr($y,$cross_pos); 232 $tmp2 = substr($y,0,$cross_pos).substr($x, $cross_pos); 233 234 $this->populations[$i]->chromosomes = $tmp1; 235 $this->populations[$i+1]->chromosomes = $tmp2; 236 } 237 } 238 } 239 240 //【變異】 241 public function mutation(){ 242 for($i =0; $i < $this->population_size; $i ++){ 243 if($this->randFloat() < $this->mutate_rate){ 244 $mutate_pos = rand(0,$this->chromosome_size -1); 245 $this->populations[$i]->chromosomes[$mutate_pos] = 1 - $this->populations[$i]->chromosomes[$mutate_pos]; 246 } 247 248 } 249 } 250 251 252 253 public function show($data){ 254 echo '<pre>'; 255 var_dump($data); 256 echo '<hr>'; 257 } 258 259 //隨機(jī)產(chǎn)生0-1的小數(shù) 260 function randFloat($min=0, $max=1){ 261 return $min + mt_rand()/mt_getrandmax() * ($max-$min); 262 } 263 264 } 265 266 //種群 267 class Populations 268 { 269 public $population_size;//種群大小 270 public $chromosome_size;//染色體長度 271 272 //初始化參數(shù) 273 public function __construct($population_size, $chromosome_size) 274 { 275 $this->population_size = $population_size; 276 $this->chromosome_size = $chromosome_size; 277 } 278 279 //初始化種群 280 public function initPop(){ 281 $pop = []; 282 for($i = 0; $i < $this->population_size; $i ++){ 283 $pop[] = new Individuals($this->chromosome_size); 284 } 285 286 return $pop; 287 } 288 } 289 290 //個體 291 class Individuals 292 { 293 public $chromosomes; //染色體 294 public $fitness; //適應(yīng)度 295 public $value; //實(shí)數(shù) 296 297 public $chromosome_size; 298 299 public function __construct($chromosome_size) 300 { 301 $this->chromosome_size = $chromosome_size; 302 303 for($j = 0; $j < $this->chromosome_size; $j ++){ 304 $this->chromosomes .= rand(0, 10) % 2;//產(chǎn)生1-0隨機(jī)數(shù) 305 } 306 } 307 308 309 }

?

轉(zhuǎn)載于:https://www.cnblogs.com/reader/p/8432499.html

總結(jié)

以上是生活随笔為你收集整理的[PHP] 遗传算法求函数最大值一般实现的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。