Permutation-based evolutionary algorithms for multidimensional knapsack problems

Proceedings of the ACM Symposium on Applied Computing

Volumn 1, Issue , 2000, Pages 408-414

  Gottlieb, Jens ^a  

^a CLAUSTHAL UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

CROSS-OVER PROBABILITY; DUPLICATE ELIMINATION; EXPLORATION AND EXPLOITATION; INFORMATION COMMONS; MULTIDIMENSIONAL KNAPSACK PROBLEMS; PERMUTATION-BASED EVOLUTIONARY ALGORITHM; POPULATION DIVERSITY; POSITION INFORMATION;

COMBINATORIAL OPTIMIZATION;

EID: 84897388268     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335603.335866     Document Type: Conference Paper

References (25)

1. C. Bierwirth, D. C. Mattfeld, and H. Kopfer. On permutation representations for scheduling problems. In H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, editors, Parallel Problem Solving from Nature - PPSN IV, volume 1141 of Lecture Notes in Computer Science, pages 310-318. Springer, 1996.
2. P. C. Chu. A Genetic Algorithm Approach for Combinatorial Optimisation Problems. PhD thesis, The Management School, Imperial College of Science, Technology and Medicine, London, 1997.
3. P. C. Chu and J. E. Beasley. A genetic algorithm for the multidimensional knapsack problem. Journal of Heuristics, 4(1):63-86, 1998.
4. L. Davis. Applying adaptive algorithms to epistatic domains. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, pages 162-164, 1985.
5. L. Davis, editor. Handbook of Genetic Algorithms. Van Nostrand Reinhold, 1991.
6. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, 1979.
7. D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989.
8. D. E. Goldberg and R. Lingle. Alleles, loci, and the TSP. In J. J. Grefenstette, editor, Proceedings of the 1st International Conference on Genetic Algorithms, pages 154-159, Hillsdale, NJ, 1985. Lawrence Erlbaum Associates.
9. J. Gottlieb. Evolutionary algorithms for multidimensional knapsack problems: The relevance of the boundary of the feasible region. In Proceedings of the Genetic and Evolutionary Computation Conference, page 787, 1999.
10. J. Gottlieb. On the effectivity of evolutionary algorithms for the multidimensional knapsack problem. In Proceedings of Artificial Evolution, 1999.
11. J. Gottlieb and L. Paulmann. Genetic algorithms for the fixed charge transportation problem. In Proceedings of the 5th IEEE International Conference on Evolutionary Computation, pages 330-335, 1998.
12. J. Gottlieb and G. R. Raidl. Characterizing locality in decoder-based EAs for the multidimensional knapsack problem. In Proceedings of Artificial Evolution, 1999.
13. R. Hinterding. Mapping, order-independent genes and the knapsack problem. In Proceedings of the 1st IEEE International Conference on Evolutionary Computation, pages 13-17, 1994.
14. R. Hinterding. Representation, constraint satisfaction and the knapsack problem. In Proceedings of the Congress on Evolutionary Computation, pages 1286-1292, 1999.
15. G. Leguizamón and Z. Michalewicz. A new version of ant system for subset problems. In Proceedings of the Congress on Evolutionary Computation, pages 1459-1464, 1999.
16. S. Martello and P. Toth. Knapsack Problems. John Wiley & Sons, 1990.
17. Z. Michalewicz and J. Arabas. Genetic algorithms for the 0/1 knapsack problem. In Z. W. Raś and Z. Zemankova, editors, Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems, volume 869 of Lecture Notes in Artificial Intelligence, pages 134-143. Springer, 1994.
18. I. M. Oliver, D. J. Smith, and J. R. C. Holland. A study of permutation crossover operators on the traveling salesman problem. In J. J. Grefenstette, editor, Proceedings of the 2nd International Conference on Genetic Algorithms, pages 224-230, Hillsdale, NJ, 1987. Lawrence Erlbaum Associates.
19. G. R. Raidl. An improved genetic algorithm for the multiconstrained 0-1 knapsack problem. In Proceedings of the 5th IEEE International Conference on Evolutionary Computation, pages 207-211, 1998.
20. G. R. Raidl. Weight-codings in a genetic algorithm for the multiconstraint knapsack problem. In Proceedings of the Congress on Evolutionary Computation, pages 596-603, 1999.
21. G. R. Raidl and J. Gottlieb. On the importance of phenotypic duplicate elimination in decoder-based evolutionary algorithms. In S. Brave and A. S. Wu, editors, Late Breaking Papers at the Genetic and Evolutionary Computation Conference, pages 204-211, 1999.
22. H.-P. Schwefel. Evolution and Optimum Seeking. Wiley, 1995.
23. G. A. Vignaux and Z. Michalewicz. A genetic algorithm for the linear transportation problem. IEEE Transactions on Systems, Man, and Cybernetics, 21(2):445-452, 1991. (Pubitemid 21660904)
24. D. Whitley. Permutation recombination. In T. Bäck, D. B. Fogel, and Z. Michalewicz, editors, Handbook of Evolutionary Computation, pages C3.3:14-C3.3:20. Oxford University Press, New York, NY, 1997.
25. D. Whitley, T. Starkweather, and D. Fuquay. Scheduling problems and traveling salesmen: The genetic edge recombination operator. In J. D. Schaffer, editor, Proceedings of the 3rd International Conference on Genetic Algorithms, pages 133-140. Morgan Kaufmann, 1989.