Multiobjective landscape analysis and the generalized assignment problem
Abstract
The importance of tuning a search algorithm for the specific features of the target search space has been known for quite some time. However, when dealing with multiobjective problems, there are several twists on the conventional notions of fitness landscapes. Multiobjective optimization problems provide additional difficulties for those seeking to study the properties of the search space. However, the requirement of finding multiple candidate solutions to the problem also introduces new potentially exploitable structure. This paper provides a somewhat high-level overview of multiobjective search space and fitness landscape analysis and examines the impact of these features on the multiobjective generalized assignment problem. © 2008 Springer Berlin Heidelberg.
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Recommended Citation
Garrett, D., & Dasgupta, D. (2008). Multiobjective landscape analysis and the generalized assignment problem. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5313 LNCS, 110-124. https://doi.org/10.1007/978-3-540-92695-5_9
