Representation, constraint satisfaction and the knapsack problem

Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999

Volumn 2, Issue , 1999, Pages 1286-1292

  Hinterding, Robert ^a  

^a VICTORIA UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; CONSTRAINED OPTIMIZATION; MAPPING;

CONSTRAINED OPTIMISATION PROBLEMS; CONSTRAINT SATISFACTION; KNAPSACK PROBLEMS; SIMPLE STRUCTURES;

EVOLUTIONARY ALGORITHMS;

EID: 84901453701     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.1999.782591     Document Type: Conference Paper

References (16)

1. J. C. Bean. Genetics and random keys for sequencing and optimization. ORSA Journal on Computing, 6(2):154-160, 1994.
2. K. A. De Jong. An Analysis of the Behaviour of a Class of Genetic Adaptive System. Doctoral dissertation, University of Michigan, 1975. Dissertation Abstract International, 36(10), 5140B. (University Microfilms No 76-9381).
3. V. S. Gordon, A. P. W. Bohm, and D. Whitely. A note on the performance of genetic algorithms on zero-one knapsack problems. Technical report cs-93-108, Department of Computer Science, Colorado State University, USA, 1993.
4. Michael R. Garey and David S. Johnson. Computers and Intractability - A Guide to the Theory of NP-completeness. W. H. Freeman Co., San Francisco, 1979.
5. V. S. Gordon and D. Whitley. Serial and parallel genetic algorithms as function optimizers. In Proceeding of the Fifth International Conference on Genetic Algorithms. Morgan Kaufmann, 1993. pp. 177-183.
6. R. Hinterding. Mapping, order-independent genes and the knapsack problem. In Proceedings of the First IEEE Conference on Evolutionary Computation, Orlando, Florida, June 1994. IEEE Press, pp. 13-17.
7. R. Hinterding and Z Michalewicz. Your brains and my beauty: Parent matching for constrained optimisation. In IEEE International Conference on Evolutionary Computation. IEEE Press, 1998.
8. S. Khuri, T. Bäck, and J. Heitkötter. The zero/one multiple knapsack problem and genetic algorithms. In Proceedings of the 1994 ACM Symposium of Applied Computation. ACM Press, 1994.
9. Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer - Verlag, 2nd edition, 1994.
10. S. Martello and P. Toth. Knapsack Problems. John Wiley & Sons, 1990.
11. A. L. Olsen. Genetic Algorithms and the Knapsack Problem: A Study of Penalty Functions. Masters thesis, University of North Carolina at Charlotte, 1993.
12. A. L. Olsen. Penalty functions and the knapsack problem. In Proceedings of the First IEEE Conference on Evolutionary Computation, Orlando, Florida, June 1994. IEEE Press, pp. 554-558.
13. M. Syslo, N. Deo, and J. Kowalik. Discrete Optimization Algorithms with Pascal Programs. Prentice Hall, 1983.
14. C. G. Shaefer. The argot strategy: adaptive representation genetic optimizer technique. In Proceedings of the 2nd International Conference on Genetic Algorithms. Lawrence Erlbaum Associates, 1987. pp. 50-58.
15. C. G. Shaefer and S. J. Smith. The argot strategy ii: Combinatorial optimizations. Technical report, Thinking Machine Corperation, 1988.
16. K. Watannabe, Y. Ikeda, S. Matsuo, and T. Tsuji. Improvement of the genetic algorithm and its application. Memoirs - faculty of engineering, Fuki University, Japan, 1992. Vol 40 Issue 1.