where P00 ij is the final update of Pij.The search procedure of RPBIL for single objective optimisation is shown in Algorithm 1 . Starting with an initial probability matrix Pij =1/nI , a real code population is then created . The best solution among the members of the population is found and the probability matrix is updated in such away that, in the next generation , design solutions related to the position of the current best design vector will have more chance of being generated. The process... where P00 ij is the final update of Pij.The search procedure of RPBIL for single objective optimisation is shown in Algorithm 1 . Starting with an initial probability matrix Pij =1/nI , a real code population is then created . The best solution among the members of the population is found and the probability matrix is updated in such away that, in the next generation , design solutions related to the position of the current best design vector will have more chance of being generated. The process is repeated until atermination condition is met( normally when the maximum number of generations,NG ,is reached ) . More details of RPBIL for single objective problems can be found in [6,7].
Xem thêm.
0 · 07/12/15 08:10:12
04/12/15 02:12:25where P00 ij is the final update of Pij.The search procedure of RPBIL for single objective optimisation is shown in Algorithm 1 . Starting with an initial probability matrix Pij =1/nI , a real code population is then created . The best solution among the members of the population is found and the probability matrix is updated in such away that, in the next generation , design solutions related to the position of the current best design vector will have more chance of being generated. The process... Xem thêm.
0 · 03/12/15 02:19:15
0 · 03/12/15 09:25:41