Abstract
This article reports an experimental study on a given structural property of connectedness of optimal solutions for two variants of the bicriteria knapsack problem. A local search algorithm that explores this property is then proposed and its performance is compared against exact algorithms in terms of running time and number of optimal solutions found. The experimental results indicate that this simple local search algorithm is able to find a representative set of optimal solutions in most of the cases, and in much less time than exact approaches.
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
Beier, R., Vöcking, B.: Probabilistic analysis of knapsack core algorithms. In: Proc. of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 468–477 (2004)
Ehrgott, M.: Multicriteria optimization. Lecture Notes in Economics and Mathematical Systems, vol. 491. Springer, Heidelberg (2000)
Ehrgott, M., Klamroth, K.: Connectedness of efficient solutions in multiple criteria combinatorial optimization. European Journal of Operational Research 97(1), 159–166 (1997)
Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Boston (1989)
Gorski, J., Klamroth, K., Ruzika, S.: Connectedness of efficient solutions in multiple objective combinatorial optimization. Tech. Rep. 102/2006, University of Kaiserslautern, Department of Mathematics (2006)
Gorski, J., Paquete, L.: On a particular case of the multi-criteria unconstrained optimization problem. Electronic Notes on Discrete Mathematics 36, 135–142 (2010)
Kung, H., Luccio, F., Preparata, F.: On finding the maxima of a set of vectors. Journal of ACM 22(4), 469–476 (1975)
Nemhauser, G., Ullman, Z.: Discrete dynamic programming and capital allocation. Management Science 15(9), 494–505 (1969)
Paquete, L., Schiavinotto, T., Stützle, T.: On local optima in multiobjective combinatorial optimization problems. Annals of Operations Research 156(1), 83–97 (2007)
Paquete, L., Stützle, T.: Clusters of non-dominated solutions in multiobjective combinatorial optimization: An experimental analysis. In: Multiobjective Programming and Goal Programming. Lecture Notes in Economics and Mathematical Systems, vol. 618, pp. 69–77. Springer, Heidelberg (2009)
da Silva, C.G., Clímaco, J., Figueira, J.R.: Geometrical configuration of the Pareto fronteir of the bi-criteria 0-1-knapsack problem. Tech. Rep. 16/2004, INESC, Coimbra, Portugal (2004)
Verel, S., Liefooghe, A., Jourdan, L., Dhaenens, C.: Analyzing the effect of objective correlation on the efficient set of MNK-landscapes. In: Proc. of the 5th Conference on Learning and Intelligent OptimizatioN (LION 5). LNCS. Springer, Heidelberg (2011) (to appear)
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
Liefooghe, A., Paquete, L., Simões, M., Figueira, J.R. (2011). Connectedness and Local Search for Bicriteria Knapsack Problems. In: Merz, P., Hao, JK. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2011. Lecture Notes in Computer Science, vol 6622. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20364-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-20364-0_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20363-3
Online ISBN: 978-3-642-20364-0
eBook Packages: Computer ScienceComputer Science (R0)