The role of representations in dynamic knapsack problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3907 LNCS, Issue , 2006, Pages 764-775

  Branke, Jürgen ^a   Orbayi, Merve ^b   Uyar, Şima ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b ISTANBUL TECHNICAL UNIVERSITY   (Turkey)

Author keywords

Dynamic environment; Evolutionary algorithm; Representation

Indexed keywords

DYNAMIC PROGRAMMING; GENETIC ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING;

DYNAMIC ENVIRONMENT; HEURISTIC ADAPTATION; KNAPSACK PROBLEM; REPRESENTATION;

KNOWLEDGE REPRESENTATION;

EID: 33745782032     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11732242_74     Document Type: Conference Paper

References (17)

1. J. E. Beasley. Or-library. online, http://www.brunel.ac.uk/depts/ma/ reseajch/jeb/orlib/mknapinfo.html.
2. J. Branke. Evolutionary Optimization in Dynamic Environments. Kluwer, 2001.
3. J. Branke, E. Salihoglu, and S. Uyar. Towards an analysis of dynamic environments. In Genetic and Evolutionary Computation Conference, pages 1433-1439. ACM, 2005.
4. H. G. Cobb. An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent nonstationary environments. Technical Report AIC-90-001, Naval Research Laboratory, Washington, USA, 1990.
5. GLPK. GNU linear programming kit. online, http://www.gnu.org/software/ glpk/glpk.html.
6. J. Gottlieb. Evolutionary Algorithms for Combinatorial Optimization Problems. Phd, Technical University Clausthal, Germany, December 1999.
7. J. Gottlieb. Permutation-based evolutionary algorithms for multidimensional knapsack problems. In ACM Symposium on Applied Computing, volume 1, pages 408-414. ACM, 2000.
8. J. Gottlieb. On the feasibility problem of penalty-based evolutionary algorithms for knapsack problems. In E.J.W. Boers et al., editors, Applications of Evolutionary Computing, volume 2037 of Lecture Notes in Computer Science, pages 50-60. Springer, 2001.
9. G. R. Raidl J. Gottlieb. The effects of locality on the dynamics of decoder-based evolutionary search. In Genetic and Evolutionary Computation Conference, pages 283-290. Morgan Kauffman, 2000.
10. Y. Jin and J. Branke. Evolutionary optimization in uncertain environments - a survey. IEEE Transactions on Evolutionary Computation, 9(3):303-317, 2005.
11. H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems. Springer, 2004.
12. R. Morrison. Designing Evolutionary Algorithms for Dynamic Environments. Springer, 2004.
13. H. Pirkul. A heuristic solution procedure for the multiconstraint zero-one knapsack problem. Naval Research Logistics, 34:161-172, 1987.
14. G. R. Raidl. Weight-codings in a genetic algorithm for the multiconstraint knapsack problem. In Congress on Evolutionary Computation, pages 596-603. IEEE, 1999.
15. G. R. Raidl and J. Gottlieb. Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem. Evolutionary Computation, 13(4), 2005.
16. F. Rothlauf. Representations for Genetic and Evolutionary Algorithms. Physica, 2002.
17. K. Weicker. Evolutionary Algorithms and Dynamic Optimization Problems. Der Andere Verlag, 2003.