Advertisement

A Critical Look at Dynamic Multi-dimensional Knapsack Problem Generation

  • Şima Uyar
  • H. Turgut Uyar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5484)

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.

Keywords

Dynamic environments dynamic problem generators constrained problems change severity evolutionary algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)CrossRefzbMATHGoogle Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Yang, S., Yao, X.: Experimental Study on Population-based Incremental Learning Algorithms for Dynamic Optimization Problems. Soft Computing 9(11), 815–834 (2005)CrossRefzbMATHGoogle Scholar
  5. 5.
    Yang, S., Yao, X.: Population-Based Incremental Learning with Associative Memory for Dynamic Environments. IEEE Tran. on Evolutionary Comp. (2008)Google Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    Gottlieb, J.: Evolutionary Algorithms for Combinatorial Optimization Problems, Phd Thesis, Technical University Clausthal, Germany (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Şima Uyar
    • 1
  • H. Turgut Uyar
    • 1
  1. 1.Istanbul Technical UniversityTurkey

Personalised recommendations