The zero/one multiple knapsack problem and genetic algorithms

Proceedings of the ACM Symposium on Applied Computing

Volumn Part F129433, Issue , 1994, Pages 188-193

  Khuri, Sami ^a   Bäck, Thomas ^b   Heitkotter, Jörg ^b  

^a SAN JOSE STATE UNIVERSITY   (United States)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

0 1 integer programming; Combinatorial optimization; Evolutionary computation; Genetic algorithm; Multiple knapsack problem

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; INTEGER PROGRAMMING;

0/1 INTEGER PROGRAMMING; CONSTRAINED PROBLEM; DOMAIN-SPECIFIC KNOWLEDGE; FITNESS FUNCTIONS; GA-BASED ALGORITHM; MULTIPLE KNAPSACK PROBLEM; PENALTY TERM; SEARCH SPACES;

OPTIMIZATION;

EID: 85028822975     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/326619.326694     Document Type: Conference Paper

References (36)

1. T. Back. GENEsYs 1.0. Software distribution and installation notes. Systems Analysis Research Group, LSXI, Department of Computer Science, University of Dortmund, Germany, July 1992. (Available via anonymous ftp to lui'ipi . in forma tik.uni -doremund .de as file GENEsYs-l.O.tar.Z in/pub/GA/src).
2. T. Back. The interaction of mutation rate, selection, and self-Adaptation within a genetic algorithm. In Manner and Manderick [19], pages 85-94.
3. E. Balas and E. Zemel. An algorithm for large zero-one knapsack problems. Operations Research, 28:1130-1154, 1980.
4. J. E. Beasley. OR-Library: Distributing Test Problems by Electronic Mail. Journal of Operational Research Society, 41(11):1069-1072, 1990.
5. R. K. Belew and L. B. Booker, editors. Proceedings of the 4th International Conference on Genetic Algorithms. Morgan Kaufmann Publishers, San Mateo, CA, 1991.
6. L. Davis, editor. Handbook of Genetic Algorithms. Van Nos-Trand Reinhold, New York, 1991.
7. L. J. Eshelman, R. A. Caruna, and J. D. Schaffcr. Biases in the crossover landscape. In Schaffer [28], pages 10-19.
8. D. B. Fogel. Evolving Artificial Intelligence. PhD thesis. University of California, Sar. Diego, CA, 1992.
9. L. J. Fogel, A. J. Owens, and M. J. Walsh. Artificial Intelligence through Simulated Evolution. Wiley, New York, 1966.
10. S. Forrest, editor. Proceedings of the 5th international Conference on Genetic Algorithms. Morgan Kaufmann Publishers, San Mateo, CA, 1993.
11. A. Frevile and G. Plateau. Hard 0-1 multiknapsack testprob-lems for size reduction methods. Investigation Operativa, 1:251-270, 1990.
12. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Fransisco, 1979.
13. D. E. Goldberg. Genetic algorithms in search, optimization and machine learning. Addison Wesley, Reading, MA, 1989.
14. J. J. Grefenstette. Optimization of control parameters for genetic algorithms. IEEE Transactions on Systems Man and Cybernetics, 16(1):122-128, 1986.
15. J. J. Grefenstette. A User's Guide to GENESIS. Navy Center for Applied Research in Artificial Intelligence, Washington, D.C., 1987.
16. J. H. Holland. Adaptation in natural and artificial systems. The University of Michigan Press. Ann Arbor, Ml, 1975.
17. K. A. De Jong. An analysis of the behaviour of a class of genetic adaptive systems. PhD thesis. University of Michigan, 1975. Diss. Abstr. Int. 36(10), 5140B. University Microfilms No. 76-9381.
18. Satni Khuri and Ai'da Batarekh. Heuristics for the integer Knapsack Problem. In Proceedings of the Xth International Computer Science Conference. Santiago, Chile, pages 161-172, 1990.
19. R. Manner and B. Manderick, editors. Parallel Problem Solving from Nature 2. Elsevier. Amsterdam, 1992.
20. S. Martello and P. Toth. Knapsack. Problems: Algorithms and Computer Implementations. John Wiley & Sons, Chichester, West Sussex, England, 1990.
21. B. M. E. Moret and H. D. Shapiro. Algorithms from P to NP, Volume 1: Design and Efficiency, Benjamin Cummings, Menlo Park. CA, 1991.
22. H. Mühlenbein. How genetic algorithms really work: I. mutation and hillclimbing. In Manner and Manderick [19], pages 15-25.
23. C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1982.
24. C. C. Petersen. Computational experience with variants of the balas algorithm applied to the selection of r & d projects. Management Science, 13:736-750, 1967.
25. G. Plateau and M. Elkihel. A hybrid algorithm for the 0-1 knapsack problem. Methods of Operations Research, 49:277-293, 1985.
26. I. Rechenberg. Evolutionsstrategie: Optimierung lechnis-cher Systeme nach Prinzipien der biologischen Evolution. Frommann-Holzboog. Stuttgart, 1973.
27. J. T. Richardson. M. R. Palmer, G. Ljepins, and M. Hilliard. Some guidelines for genetic algorithms with penalty functions. In Schaffer [28], pages 191-197.
28. J. D. Schaffer, editor. Proceedings of the 3rd International Conference on Genetic Algorithms. Morgan Kaufmann Publishers, San Mateo, CA. 1989.
29. H.-P. Schwefel. Numerical Optimization of Computer Models. Wiley, Chichester. 1981.
30. H.-P. Schwefel and R. Manner, editors. Parallel Problem Solving from Nature - Proceedings 1st Workshop PPSN volume 496 of Lecture Notes in Computer Science. Springer, Berlin, 1991.
31. S. Senyu and Y. Toyoda. An approach to linear programming with 0-1 variables. Management Science, 15:B196-B207, 1967.
32. A. E. Smith and D. M. Tate. Genetic optimization using a penalty function. In Forrest [10], pages 499-505.
33. W. M. Spears, K. A. De Jong, T. Back, D. B. Fogel, and H. de Garis. An overview of evolutionary computation. In P. B. Brazdii. editor. Machine Learning: ECML-93, volume 667 of Lecture Notes in Artificial Intelligence, pages 442-459. Springer, Berlin, 1993.
34. D. R. Stinson. An Introduction to the Design and Analysis of Algorithms. The Charles Babbage Research Center, Winnipeg, Manitoba. Canada. 2nd edition, 1987.
35. G. Syswerda. Uniform crossover in genetic algorithms. In Schaffer [28], pages 2-9.
36. H. M. Weingartner and D. N. Ness. Methods for the solution of the multi-dimensional 0/1 knapsack problem. Operations Research, 15:83-103, 1967.