Locality in decoder-based EAs for the multidimensional knapsack problem

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

Volumn 1829, Issue , 2000, Pages 38-52

  Gottlieb, Jens ^a   Raidl, Günther R ^b  

^a CLAUSTHAL UNIVERSITY OF TECHNOLOGY   (Germany)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION;

DECODER-BASED EVOLUTIONARY ALGORITHMS; DUPLICATE ELIMINATION; FITNESS LANDSCAPE; MULTIDIMENSIONAL KNAPSACK PROBLEMS; POPULATION DIVERSITY; SOLUTION QUALITY; STATISTICAL MEASURES;

DECODING;

EID: 84931475280     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10721187_3     Document Type: Conference Paper

References (25)

1. L. Altenberg: Fitness Distance Correlation Analysis: An Instructive Counterexam- ple, in Proc. of the 7th Int. Conf. on Genetic Algorithms, East Lansing, MI, pp. 57-64, 1997
2. P. C. Chu, J. E. Beasley: A Genetic Algorithm for the Multidimensional Knapsack Problem, Journal of Heuristics 4, pp. 63-86, 1998
3. D. B. Fogel, A. Ghozeil: Using Fitness Distributions to Design More Efficient Evolutionary Algorithms, in Proc. of the 3rd IEEE Int. Conf. on Evolutionary Computation, Nagoya, Japan, pp. 11-19, 1996
4. M. D. Garey, D. S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979
5. D. E. Goldberg: Genetic Algorithms in Search, Optimization and Machine Lear- ning, Addison-Wesley, 1989
6. J. Gottlieb: Evolutionary Algorithms for Multidimensional Knapsack Problems: The Relevance of the Boundary of the Feasible Region, in Proc. of the Genetic and Evolutionary Computation Conf., Orlando, FL, p. 787, 1999
7. J. Gottlieb: On the Effectivity of Evolutionary Algorithms for Multidimensional Knapsack Problems, in Proc. of Artificial Evolution, Dunkerque, France, 1999
8. J. J. Grefenstette, R. Gopal, B. Rosmaita, D. Van Gucht: Genetic Algorithms for the Traveling Salesman Problem, in Proc. of the 1st Int. Conf. on Genetic Algorithms, Hillsdale, NJ, pp. 160-168, 1985
9. R. Hinterding: Mapping, Order-independent Genes and the Knapsack Problem, in Proc. of the 1st IEEE Int. Conference on Evolutionary Computation, Orlando, FL, pp. 13-17, 1994
10. C. Igel: Causality of Hierarchical Variable Length Representations, in Proc. of the 5th IEEE Int. Conf. on Evolutionary Computation, Anchorage, AL, pp. 324-329, 1998
11. T. Jones, S. Forrest: Fitness Distance Correlation as a Measure of Problem Dificulty for Genetic Algorithms, in Proc. of the 6th Int. Conf. on Genetic Algorithms, Pittsburgh, PA, pp. 184-192, 1995
12. L. Kallel, M. Schoenauer: A Priori Comparison of Binary Crossover Operators: No Universal Statistical Measure, but a Set of Hints, in Proc. of 3rd European Conf. on Artificial Evolution, Nîmes, France, pp. 287-299, 1997
13. M. J. Magazine, O. Oguz: A Heuristic Algorithm for the Multidimensional Zero- One Knapsack Problem, European Journal of Op. Res., 16, pp. 319-326, 1984
14. B. Manderick, M. deWeger, P. Spiessens: The Genetic Algorithm and the Structure of the Fitness Landscape, in Proc. of the 4th Int. Conf. on Genetic Algorithms, pp. 143-150, 1991
15. S. Martello, P. Toth: Knapsack Problems: Algorithms and Computer Implementa- tions, J. Wiley & Sons, 1990
16. H. Pirkul: A Heuristic Solution Procedure for the Multiconstrained Zero-One Knap- sack Problem, Naval Research Logistics 34, pp. 161-172, 1987
17. G. R. Raidl: An Improved Genetic Algorithm for the Multiconstrained 0-1 Knap- sack Problem, in Proc. of the IEEE Int. Conf. on Evolutionary Computation, An- chorage, AL, pp. 207-211, 1998
18. G. R. Raidl: Weight-Codings in a Genetic Algorithm for the Multiconstraint Knap- sack Problem, in Proc. of the Congress on Evolutionary Computation, Washington DC, pp. 596-603, 1999.
19. G. R. Raidl, J. Gottlieb: On the Importance of Phenotypic Duplicate Elimination in Decoder-Based Evolutionary Algorithms, in Late-Breaking Papers Proc. of the Genetic and Evolutionary Computation Conf., Orlando, FL, pp. 204-211, 1999.
20. I. Rechenberg: Evolutionsstrategie: Optimierung technischer Systeme nach Prinzi- pien der biologischen Evolution, Frommann-Holzboog, Stuttgart, 1973
21. I. Rechenberg: Evolutionsstrategie '94, Frommann-Holzboog, 1994
22. S. Ronald: Robust Encodings in Genetic Algorithms, in D. Dasgupta, Z. Micha- lewicz (eds.), Evolutionary Algorithms in Engineering Applications, pp. 29-44, Springer, 1997
23. B. Sendhoff, M. Kreutz, W. von Seelen: A condition for the genotype-phenotype mapping: Causality, in Proc. of the 7th Int. Conf. on Genetic Algorithms, East Lansing, MI, pp. 73-80, 1997
24. J. Thiel, S. Voss: Some Experiences on Solving Multiconstraint Zero-One Knapsack Problems with Genetic Algorithms, INFOR 32, pp. 226-242, 1994
25. C. Valenzuela, S. Hurley, D. Smith: A Permutation Based Genetic Algorithm for Minimum Span Frequency Assignment, in Proc. of the 5th Int. Conf. on Parallel Problem Solving from Nature, Amsterdam, The Netherlands, pp. 907-916, 1998