Abstract
The dynamic, multi-dimensional knapsack problem is an important benchmark for evaluating the performance of evolutionary algorithms in changing environments, especially because it has many real-world applications. In order to analyze the performance of an evolutionary algorithm according to this benchmark, one needs to be able to change the current problem in a controlled manner. Several methods have been proposed to achieve this goal. In this paper, we briefly outline the proposed methods, discuss their shortcomings and propose a new method that can generate changes for a given severity level more reliably. We then present the experimental setup and results for the new method and compare it with existing methods. The current results are promising and promote further study.
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
Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)
Branke, J., Salihoglu, E., Uyar, S.: Towards an Analysis of Dynamic Environments. In: Proceedings of Genetic and Evolutionary Computation Conference, pp. 1433–1439. ACM, New York (2005)
Branke, J., Orbayi, M., Uyar, S.: The role of representations in dynamic knapsack problems. In: Rothlauf, F., Branke, J., Cagnoni, S., Costa, E., Cotta, C., Drechsler, R., Lutton, E., Machado, P., Moore, J.H., Romero, J., Smith, G.D., Squillero, G., Takagi, H. (eds.) EvoWorkshops 2006. LNCS, vol. 3907, pp. 764–775. Springer, Heidelberg (2006)
Yang, S., Yao, X.: Experimental Study on Population-based Incremental Learning Algorithms for Dynamic Optimization Problems. Soft Computing 9(11), 815–834 (2005)
Yang, S., Yao, X.: Population-Based Incremental Learning with Associative Memory for Dynamic Environments. IEEE Tran. on Evolutionary Comp. (2008)
Karaman, A., Uyar, A.S., Eryigit, G.: The Memory Indexing Evolutionary Algorithm for Dynamic Environments. In: Rothlauf, F., Branke, J., Cagnoni, S., Corne, D.W., Drechsler, R., Jin, Y., Machado, P., Marchiori, E., Romero, J., Smith, G.D., Squillero, G. (eds.) EvoWorkshops 2005. LNCS, vol. 3449, pp. 563–573. Springer, Heidelberg (2005)
Gottlieb, J.: Evolutionary Algorithms for Combinatorial Optimization Problems, Phd Thesis, Technical University Clausthal, Germany (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Uyar, Ş., Uyar, H.T. (2009). A Critical Look at Dynamic Multi-dimensional Knapsack Problem Generation. In: Giacobini, M., et al. Applications of Evolutionary Computing. EvoWorkshops 2009. Lecture Notes in Computer Science, vol 5484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01129-0_86
Download citation
DOI: https://doi.org/10.1007/978-3-642-01129-0_86
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01128-3
Online ISBN: 978-3-642-01129-0
eBook Packages: Computer ScienceComputer Science (R0)