Please use this identifier to cite or link to this item:
|Title:||Improving the efficacy of multi-objective evolutionary algorithms for real-world applications|
|Source:||Kay, C.T. (2007). Improving the efficacy of multi-objective evolutionary algorithms for real-world applications. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4403 LNCS : 2-. ScholarBank@NUS Repository.|
|Abstract:||Multi-objective evolutionary algorithms (MOEAs) are a class of stochastic optimization techniques that simulate biological evolution to solve problems with multiple objectives. Multi-objective (MO) optimization is a challenging research topic because it involves the simultaneous optimization of several (and normally conflicting) objectives in the Pareto optimal sense. It requires researchers to address many issues that are unique to MO problems, such as fitness assignment, diversity preservation, balance between exploration and exploitation, elitism and archiving. In this talk, a few advanced features for handling large and computationally intensive real-world MO optimization problems will be presented. These include a distributed cooperative coevolutionary approach to handle large-scale problems via a divide-andconquer strategy by harnessing technological advancements in parallel and distributed systems and a hybridization scheme with local search heuristics for combinatorial optimization with domain knowledge. The talk will also discuss the application of these techniques to various engineering problems including scheduling and system design, which often involve different competing specifications in a large and highly constrained search space. © Springer-Verlag Berlin Heidelberg 2007.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.