Details
Evolutionary Computation with Biogeography-based Optimization
1. Aufl.
|
139,99 € |
|
| Verlag: | Wiley |
| Format: | EPUB |
| Veröffentl.: | 18.01.2017 |
| ISBN/EAN: | 9781119136514 |
| Sprache: | englisch |
| Anzahl Seiten: | 352 |
DRM-geschütztes eBook, Sie benötigen z.B. Adobe Digital Editions und eine Adobe ID zum Lesen.
Beschreibungen
<p>Evolutionary computation algorithms are employed to minimize functions with large number of variables. Biogeography-based optimization (BBO) is an optimization algorithm that is based on the science of biogeography, which researches the migration patterns of species. These migration paradigms provide the main logic behind BBO. Due to the cross-disciplinary nature of the optimization problems, there is a need to develop multiple approaches to tackle them and to study the theoretical reasoning behind their performance. This book explains the mathematical model of BBO algorithm and its variants created to cope with continuous domain problems (with and without constraints) and combinatorial problems.</p>
<p><b>Chapter 1. The Science of Biogeography 1</b></p> <p>1.1. Introduction 1</p> <p>1.2. Island biogeography 3</p> <p>1.3. Influence factors for biogeography 6</p> <p><b>Chapter 2. Biogeography and Biological Optimization 11</b></p> <p>2.1. A mathematical model of biogeography 11</p> <p>2.2. Biogeography as an optimization process 16</p> <p>2.3. Biological optimization 19</p> <p>2.3.1. Genetic algorithms 19</p> <p>2.3.2. Evolution strategies 20</p> <p>2.3.3. Particle swarm optimization 21</p> <p>2.3.4. Artificial bee colony algorithm 22</p> <p>2.4. Conclusion 23</p> <p><b>Chapter 3. A Basic BBO Algorithm 25</b></p> <p>3.1. BBO definitions and algorithm 25</p> <p>3.1.1. Migration 26</p> <p>3.1.2. Mutation 27</p> <p>3.1.3. BBO implementation 27</p> <p>3.2. Differences between BBO and other optimization algorithms 35</p> <p>3.2.1. BBO and genetic algorithms 35</p> <p>3.2.2. BBO and other algorithms 36</p> <p>3.3. Simulations 37</p> <p>3.4. Conclusion 44</p> <p><b>Chapter 4. BBO Extensions 45</b></p> <p>4.1. Migration curves 45</p> <p>4.2. Blended migration 49</p> <p>4.3. Other approaches to BBO 51</p> <p>4.4. Applications 56</p> <p>4.5. Conclusion 59</p> <p><b>Chapter 5. BBO as a Markov Process 61</b></p> <p>5.1. Markov definitions and notations 61</p> <p>5.2. Markov model of BBO 72</p> <p>5.3. BBO convergence 79</p> <p>5.4. Markov models of BBO extensions 90</p> <p>5.5. Conclusions 99</p> <p><b>Chapter 6. Dynamic System Models of BBO 103</b></p> <p>6.1. Basic notation 103</p> <p>6.2. Dynamic system models of BBO 105</p> <p>6.3. Applications to benchmark problems 119</p> <p>6.4. Conclusions 122</p> <p><b>Chapter 7. Statistical Mechanics Approximations of BBO 123</b></p> <p>7.1. Preliminary foundation 123</p> <p>7.2. Statistical mechanics model of BBO 128</p> <p>7.2.1. Migration 128</p> <p>7.2.2. Mutation 134</p> <p>7.3. Further discussion 141</p> <p>7.3.1. Finite population effects 141</p> <p>7.3.2. Separable fitness functions 142</p> <p>7.4. Conclusions 143</p> <p><b>Chapter 8. BBO for Combinatorial Optimization 145</b></p> <p>8.1. Traveling salesman problem 147</p> <p>8.2. BBO for the TSP 148</p> <p>8.2.1. Population initialization 148</p> <p>8.2.2. Migration in the TSP 150</p> <p>8.2.3. Mutation in the TSP 157</p> <p>8.2.4. Implementation framework 159</p> <p>8.3. Graph coloring 163</p> <p>8.4. Knapsack problem 165</p> <p>8.5. Conclusion 167</p> <p><b>Chapter 9. Constrained BBO 169</b></p> <p>9.1. Constrained optimization 170</p> <p>9.2. Constraint-handling methods 172</p> <p>9.2.1. Static penalty methods 172</p> <p>9.2.2. Superiority of feasible points 173</p> <p>9.2.3. The eclectic evolutionary algorithm 174</p> <p>9.2.4. Dynamic penalty methods 174</p> <p>9.2.5. Adaptive penalty methods 176</p> <p>9.2.6. The niched-penalty approach 177</p> <p>9.2.7. Stochastic ranking 178</p> <p>9.2.8. ε-level comparisons 178</p> <p>9.3. BBO for constrained optimization 179</p> <p>9.4. Conclusion 185</p> <p><b>Chapter 10. BBO in Noisy Environments 187</b></p> <p>10.1. Noisy fitness functions 188</p> <p>10.2. Influence of noise on BBO 190</p> <p>10.3. BBO with re-sampling 193</p> <p>10.4. The Kalman BBO 196</p> <p>10.5. Experimental results 199</p> <p>10.6. Conclusion 201</p> <p><b>Chapter 11. Multi-objective BBO 203</b></p> <p>11.1. Multi-objective optimization problems 204</p> <p>11.2. Multi-objective BBO 211</p> <p>11.2.1. Vector evaluated BBO 211</p> <p>11.2.2. Non-dominated sorting BBO 213</p> <p>11.2.3. Niched Pareto BBO 216</p> <p>11.2.4. Strength Pareto BBO 218</p> <p>11.3. Real-world applications 223</p> <p>11.3.1. Warehouse scheduling model 223</p> <p>11.3.2. Optimization of warehouse scheduling 229</p> <p>11.4. Conclusion 231</p> <p><b>Chapter 12. Hybrid BBO Algorithms 233</b></p> <p>12.1. Opposition-based BBO 234</p> <p>12.1.1. Opposition definitions and concepts 234</p> <p>12.1.2. Oppositional BBO 236</p> <p>12.1.3. Experimental results 238</p> <p>12.2. BBO with local search 240</p> <p>12.2.1. Local search methods 240</p> <p>12.2.2. Simulation results 245</p> <p>12.3. BBO with other EAs 247</p> <p>12.3.1. Iteration-level hybridization 247</p> <p>12.3.2. Algorithm-level hybridization 250</p> <p>12.3.3. Experimental results 254</p> <p>12.4. Conclusion 256</p> <p>Appendices 259</p> <p>Appendix A. Unconstrained Benchmark Functions 261</p> <p>Appendix B. Constrained Benchmark Functions 265</p> <p>Appendix C. Multi-objective Benchmark Functions 289</p> <p>Bibliography 309</p> <p>Index 325</p>
<strong>Haiping Ma</strong>, Shangai University, China. <p><strong>Dan Simon</strong>, Professor, Cleveland State University, USA.
Diese Produkte könnten Sie auch interessieren:
