Abstract
In multiobjective combinatorial optimization, there exists two main classes of metaheuristics, based either on multiple aggregations, or on a dominance relation. As in the single-objective case, the structure of the search space can explain the difficulty for multiobjective metaheuristics, and guide the design of such methods. In this work we analyze the properties of multiobjective combinatorial search spaces. In particular, we focus on the features related the efficient set, and we pay a particular attention to the correlation between objectives. Few benchmark takes such objective correlation into account. Here, we define a general method to design multiobjective problems with correlation. As an example, we extend the well-known multiobjective NK-landscapes. By measuring different properties of the search space, we show the importance of considering the objective correlation on the design of metaheuristics.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ehrgott, M., Klamroth, K.: Connectedness of efficient solutions in multiple criteria combinatorial optimization. European Journal of Operational Research 97(1), 159–166 (1997)
Mote, J., Olson, I.M.D.L.: A parametric approach to solving bicriterion shortest path problems. European Journal of Operational Research 53(1), 81–92 (1991)
Paquete, L., Stützle, T.: A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices. European Journal of Operational Research 169(3), 943–959 (2006)
Knowles, J., Corne, D.: Instance generators and test suites for the multiobjective quadratic assignment problem. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol. 2632, pp. 295–310. Springer, Heidelberg (2003)
Aguirre, H.E., Tanaka, K.: Working principles, behavior, and performance of MOEAs on MNK-landscapes. European Journal of Operational Research 181(3), 1670–1690 (2007)
Ehrgott, M.: Multicriteria optimization, 2nd edn. Springer, Heidelberg (2005)
Paquete, L., Stützle, T.: Stochastic local search algorithms for multiobjective combinatorial optimization: A review. In: Handbook of Approximation Algorithms and Metaheuristics. Computer & Information Science Series, vol. 13, Chapman & Hall / CRC (2007)
Knowles, J., Corne, D.: Bounded Pareto archiving: Theory and practice. In: Metaheuristics for Multiobjective Optimisation. LNEMS, vol. 535, pp. 39–64. Springer, Heidelberg (2004)
Gorski, J., Klamroth, K., Ruzika, S.: Connectedness of efficient solutions in multiple objective combinatorial optimization. Technical Report 102/2006, University of Kaiserslautern, Department of Mathematics (2006)
Paquete, L., Stützle, T.: Clusters of non-dominated solutions in multiobjective combinatorial optimization: An experimental analysis. In: Multiobjective Programming and Goal Programming. LNEMS, vol. 618, pp. 69–77. Springer, Heidelberg (2009)
Kauffman, S.A.: The Origins of Order. Oxford University Press, New York (1993)
Hotelling, H., Pabst, M.R.: Rank correlation and tests of significance involving no assumptions of normality. Ann. Math. Stat. 7, 29–43 (1936)
Weinberger, E.D.: Correlated and uncorrelatated fitness landscapes and how to tell the difference. Biological Cybernetics 63, 325–336 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Verel, S., Liefooghe, A., Jourdan, L., Dhaenens, C. (2011). Analyzing the Effect of Objective Correlation on the Efficient Set of MNK-Landscapes. In: Coello, C.A.C. (eds) Learning and Intelligent Optimization. LION 2011. Lecture Notes in Computer Science, vol 6683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25566-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-25566-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25565-6
Online ISBN: 978-3-642-25566-3
eBook Packages: Computer ScienceComputer Science (R0)