Evolutionary Algorithms for Solving Multi-Objective ProblemsSpringer Science & Business Media, 2002 - 576 páginas The solving of multi-objective problems (MOPs) has been a continuing effort by humans in many diverse areas, including computer science, engineering, economics, finance, industry, physics, chemistry, and ecology, among others. Many powerful and deterministic and stochastic techniques for solving these large dimensional optimization problems have risen out of operations research, decision science, engineering, computer science and other related disciplines. The explosion in computing power continues to arouse extraordinary interest in stochastic search algorithms that require high computational speed and very large memories. A generic stochastic approach is that of evolutionary algorithms (EA). Such algorithms have been demonstrated to be very powerful and generally applicable for solving different single objective problems. Their fundamental algorithmic structures can also be applied to solving many multi-objective problems. In this book, the various features of multi-objective evolutionary algorithms (MOEAs) are presented in an innovative and unique fashion, with detailed customized forms suggested for a variety of applications. Also, extensive MOEA discussion questions and possible research directions are presented at the end of each chapter. For additional information and supplementary teaching materials, please visit the authors' website at http://www.cs.cinvestav.mx/~EVOCINV/bookinfo.html. |
Contenido
BASIC CONCEPTS | 1 |
2 Definitions | 3 |
22 The Multiobjective Optimization Problem | 4 |
223 Commensurable vs NonCommensurable | 5 |
225 General MOP | 6 |
226 Types of MOPs | 7 |
227 Ideal Vector | 9 |
2210 Pareto Optimally | 10 |
27 Transport Engineering | 244 |
28 Aeronautical Engineering | 247 |
3 Scientific Applications | 253 |
31 Geography | 254 |
32 Chemlstry | 255 |
33 Physics | 256 |
34 Medicine | 257 |
35 Ecology | 259 |
2211 Pareto Dominance and Pareto Optimal Set | 11 |
2213 Weak and Strong Nondominance | 14 |
2214 KuhnTucker Conditions | 15 |
3 An Example | 16 |
4 General Optimization Algorithm Overview | 17 |
5 EA Basics | 21 |
6 Origins of Multiobjective Optimization | 26 |
61 Mathematical Foundations | 28 |
62 Early Applications | 29 |
71 A priori Preference Articulation | 30 |
712 Goal Programming | 32 |
713 GoalAttainment Method | 34 |
714 Lexicographic Method | 36 |
715 MinMax Optimization | 37 |
716 Multiattribute Utility Theory | 38 |
717 Surrogate Worth TradeOff | 40 |
718 ELECTRE | 41 |
719 PROMETHEE | 43 |
72 A Posteriori Preference Articulation | 45 |
73 Progressive Preference Articulation | 46 |
732 STEP Method | 47 |
733 Sequential Multiobjective Problem Solving Method | 48 |
8 Using Evolutionary Algorithms | 50 |
81 Pareto Notation | 52 |
82 MOEA Classification | 53 |
9 Summary | 54 |
10 Discussion Questions | 55 |
EVOLUTIONARY ALGORITHM MOP APPROACHES | 59 |
2 MOEA Research Quantitative Analysis | 60 |
22 A priori Techniques | 62 |
221 Lexicographic Ordering | 63 |
223 Linear Aggregating Functions | 64 |
224 Criticism of Linear Aggregating Functions | 65 |
226 Criticism of Nonlinear Aggregating Functions | 66 |
24 Progressive Techniques | 67 |
252 Independent Sampling Techniques | 68 |
255 Criticism of Criterion Selection Techniques | 70 |
258 Pareto Sampling | 71 |
259 Criticism of Pareto Sampling Techniques | 85 |
2510 Criticism of A posteriori Techniques | 87 |
3 MOEA Research Qualitative Analysis | 91 |
4 ConstraintHandling | 93 |
5 MOEA Overview Discussion | 94 |
6 Summary | 95 |
7 Possible Research Ideas | 96 |
8 Discussion Questions | 97 |
MOEA TEST SUITES | 101 |
2 MOEA Test Function Suite Issues | 102 |
3 MOP Domain Feature Classification | 105 |
31 Unconstrained Numeric MOEA Test Functions | 109 |
32 SideConstrained Numeric MOEA Test Functions | 114 |
33 MOP Test Function Generators | 120 |
331 Numerical ConsiderationsGenerated MOPs | 122 |
332 Two Objective Generated MOPs | 124 |
333 Scalable Generated MOPs | 127 |
34 Combinatorial MOEA Test Functions | 130 |
35 RealWorld MOEA Test Functions | 133 |
4 Summary | 139 |
6 Discussion Questions | 140 |
MOEA TESTING AND ANALYSIS | 141 |
Motivation and Objectives | 142 |
3 Experimental Methodology | 143 |
311 MOEA Test Algorithms | 145 |
32 Key Algorithmic Parameters | 150 |
4 MOEA Statistical Testing Approaches | 154 |
41 MOEA Experimental Metrics | 155 |
42 Statistical Testing Techniques | 162 |
43 Methods for Presentation of MOEA Results | 164 |
52 SideConstrained Numerical Test Functions | 167 |
53 MOEA Performance for 3 Objective Function MOPs | 171 |
54 NPComplete Test Problems | 173 |
55 Application Test Problems | 174 |
6 Summary | 176 |
MOEA THEORY AND ISSUES | 179 |
2 ParetoRelated Theoretical Contributions | 180 |
211 Pareto Optimal Set Minimal Cardinality | 181 |
22 MOEA Convergence | 184 |
3 MOEA Theoretical Issues | 190 |
31 Fitness Functions | 191 |
32 Pareto Ranking | 193 |
33 Pareto Niching and Fitness Sharing | 196 |
34 Mating Restriction | 201 |
35 Solution Stability and Robustness | 202 |
37 MOEA Computational Cost | 204 |
6 Discussion Questions | 205 |
Chapter 6 APPLICATIONS | 207 |
2 Engineering Applications | 209 |
21 Environmental Naval and Hydraulic Engineering | 210 |
22 Electrical and Electronics Engineering | 216 |
23 Telecommunications and Network Optimization | 224 |
24 Robotics and Control Engineering | 226 |
25 Structural and Mechanical Engineering | 236 |
26 Civil and Construction Engineering | 243 |
36 Computer Science and Computer Engineering | 260 |
4 Industrial Applications | 267 |
41 Design and Manufacture | 268 |
42 Scheduling | 275 |
43 Management | 281 |
44 Grouping and Packing | 283 |
5 Miscellaneous Applications | 284 |
51 Finance | 285 |
52 Classification and Prediction | 286 |
6 Future Applications | 289 |
7 Summary | 290 |
9 Discussion Questions | 291 |
MOEA PARALLELIZATION | 293 |
2 Parallel MOEA Philosophy | 294 |
22 Parallel MOEA Objective Function Decomposition | 296 |
23 Parallel MOEA Data Decomposition | 297 |
32 Island Model | 299 |
33 Diffusion Model | 300 |
41 MasterSlave MOEAs | 301 |
42 lsland MOEAs | 304 |
43 Diffusion MOEAs | 310 |
5 Parallel MOEA Analyses and lssues | 311 |
51 Parallel MOEA Quantitative Analysis | 312 |
52 Parallel MOEA Qualitative Analysis | 313 |
6 Parallel MOEA Development Testing | 315 |
61 Specific Developmental lssues | 317 |
7 Summary | 318 |
9 Discussion Questions | 319 |
MULTICRITERIA DECISION MAKING | 321 |
2 MultiCriteria Decision Making | 322 |
21 Operational Attitude of the Decision Maker | 324 |
3 Incorporation of Preferences in MOEAs | 326 |
31 Definition of Desired Goals | 329 |
311 Criticism of Definition of Desired Goals | 332 |
321 Criticism of Utility Functions | 333 |
33 Preference Relations | 334 |
331 Criticism of Preference Relations | 336 |
341 Criticism of Outranking | 338 |
351 Criticism of Fuzzy Logic | 339 |
4 Issues Deserving Attention | 340 |
43 Scalability | 341 |
45 Other important issues | 343 |
5 Summary | 344 |
7 Discussion Questions | 346 |
Chapter 9 SPECIAL TOPICS | 349 |
2 Simulated Annealing | 350 |
22 Advantages and Disadvantages of Simulated Annealing | 356 |
3 Tabu Search and Scatter Search | 357 |
31 Basic Concepts | 358 |
32 Advantages and Disadvantages of Tabu Search and Scatter Search | 362 |
4 Ant System | 363 |
42 Advantages and Disadvantages of the Ant System | 369 |
5 Distributed Reinforcement Learning | 370 |
52 Advantages and Disadvantages of Distributed Reinforcement Learning | 372 |
61 Basic Concepts | 373 |
62 Advantages and Disadvantages of Memetic Algorithms | 376 |
72 Cultural Algorithms | 378 |
73 Immune System | 380 |
74 Cooperative Search | 383 |
8 Summary | 384 |
9 Possible Research Ideas | 385 |
10 Discussion Questions | 386 |
Chapter 10 EPILOG | 389 |
MOEA CLASSIFICATION AND TECHNIQUE ANALYSIS 1 Introduction | 393 |
12 Presentation Layout | 394 |
22 Linear Fitness Combination Techniques | 396 |
23 Nonlinear Fitness Combination Techniques | 402 |
232 Target Vector Fitness Combination Techniques | 403 |
233 Minimax Fitness Combination Techniques | 405 |
3 Progressive MOEA Techniques | 406 |
4 A posteriori MOEA Techniques | 408 |
42 Criterion Selection Techniques | 410 |
43 Aggregation Selection Techniques | 412 |
44 Pareto Sampling Techniques | 415 |
441 ParetoBased Selection | 416 |
442 Pareto Rank and NicheBased Selection | 423 |
443 Pareto DemeBased Selection | 435 |
444 Pareto ElitistBased Selection | 437 |
45 Hybrid Selection Techniques | 440 |
5 MOEA Comparisons and Theory | 441 |
52 MOEA Theory and Reviews | 450 |
6 Alternative Multiobjective Techniques | 451 |
MOPs IN THE LITERATURE | 455 |
Ptrue PFtrue FOR SELECTED NUMERIC MOPs | 461 |
Ptrue PFtrue FOR SIDECONSTRAINED MOPs | 471 |
MOEA SOFTWARE AVAILABILITY 1 Introduction | 477 |
MOEARELATED INFORMATION 1 Introduction | 481 |
2 Websites of Interest | 482 |
5 Researchers | 483 |
6 Distribution Lists | 486 |
| 489 | |
References | 515 |
Otras ediciones - Ver todas
Evolutionary Algorithms for Solving Multi-Objective Problems Carlos Coello Coello,David A. Van Veldhuizen,Gary B. Lamont Vista previa limitada - 2013 |
Términos y frases comunes
aggregating function applications approach assigned authors binary representation Binary string Chapter Chromosome Coello Coello combination of weights constraints convergence cost crossover decision variables defined dominated encoding Engineering evaluation evolution strategy evolutionary algorithms Evolutionary Computation EVOPS Figure fitness function fitness sharing Fonseca and Fleming fuzzy Genes genetic algorithm global goal Goldberg heuristic implementation incorporate individuals Integer string Jaszkiewicz linear combination maximize method metrics mization MOEA test MOGA MOMGA multiobjective optimization niching nondominated solutions nondominated vectors objective function objectives are considered operators Osyczka parallel MOEA parameters Pareto dominance Pareto front Pareto optimal set Pareto optimal solutions Pareto ranking PFknown PFtrue phenotype population preferences problem domain processors programming proposed pseudocode real-world Results are compared roulette wheel selection Schaffer scheduling search space simulated annealing single-objective solve SPEA Srinivas and Deb Table tabu search test functions test suite theorems tion tournament selection uniform mutation utility function VEGA
Referencias a este libro
Scatter Search: Methodology and Implementations in C Manuel Laguna,Rafael Cunquero Martí Vista previa limitada - 2003 |
Applications of Multi-objective Evolutionary Algorithms Carlos A. Coello Coello,Gary B. Lamont Vista previa limitada - 2004 |
