On the feasibility problem of penalty-based evolutionary algorithms for knapsack problems

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

Volumn 2037, Issue , 2001, Pages 50-59

  Gottlieb, Jens ^a  

^a SAP RESEARCH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; CONSTRAINED OPTIMIZATION; OPTIMIZATION;

CONSTRAINED OPTIMI-ZATION PROBLEMS; FEASIBILITY PROBLEM; FEASIBLE SOLUTION; FITNESS LANDSCAPE; INITIALIZATION METHODS; KNAPSACK PROBLEMS; PENALTY FUNCTION;

EVOLUTIONARY ALGORITHMS;

EID: 84958057413     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45365-2_6     Document Type: Conference Paper

References (17)

1. J. T. Richardson, M. R. Palmer, G. Liepins, and M. Hilliard. Some Guidelines for Genetic Algorithms with Penalty Functions. In Proc. 3rd International Conference on Genetic Algorithms, 191-197, Morgan Kaufmann, 1989
2. S. Khuri and A. Batarekh. Heuristics for the Integer Knapsack Problem. In Proc. 10th International Computer Science Conference, 161-172, Santiago, Chile, 1990
3. J. Thiel and S. Voss. Some Experiences on Solving Multiconstraint Zero-One Knapsack Problems with Genetic Algorithms. INFOR, Volume 32, No. 4, 226-242, 1994
4. Z. Michalewicz and J. Arabas. Genetic Algorithms for the 0/1 Knapsack Problem. In Proc. 8th International Symposium on Methodologies for Intelligent Systems, 134-143, Springer, 1994
5. A. L. Olsen. Penalty functions and the knapsack problem. In Proc. 1st IEEE Conference on Evolutionary Computation, 554-558, 1994
6. R. Hinterding. Representation, Constraint Satisfaction and the Knapsack Problem. In Proc. Congress on Evolutionary Computation, 1286-1292, Washington DC, 1999
7. S. Khuri, T. Back, and J. Heitkotter. The Zero/One Multiple Knapsack Problem and Genetic Algorithms. In Proc. ACM Symposium on Applied Computation, 188-193, ACM Press, 1994
8. J. Gottlieb. Evolutionary Algorithms for Constrained Optimization Problems. Dissertation, Technical University of Clausthal, 1999. Shaker, Aachen, 2000
9. P. C. Chu and J. E. Beasley. A Genetic Algorithm for the Multidimensional Knapsack Problem. Journal of Heuristics, Volume 4, No. 1, 63-86, 1998
10. S. Martello and P. Toth. Knapsack Problems. John Wiley & Sons, 1990
11. S. Khuri, T. Back, and J. Heitkotter. An Evolutionary Approach to Combinatorial Optimization Problems. In Proc. 22nd Annual A CM Computer Science Conference, 66-73, ACM Press, New York, 1994
12. F. Corno, M. Sonza Reorda, and G. Squillero. The Selfish Gene Algorithm: A New Evolutionary Optimization Strategy. In Proc. 13th Annual ACM Symposium on Applied Computing. 1998
13. H. A. Mayer. ptGAs-Genetic Algorithms Evolving Noncoding Segments by Means of Promoter/Terminator Sequences. Evolutionary Computation, Volume 6, No. 4, 361-386, 1998
14. G. Rudolph and J. Sprave. A Cellular Genetic Algorithm with Self-Adjusting Acceptance Threshold. In Proc. 1st IEE/IEEE International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, 365-372, IEE, London, 1995
15. G. Rudolph and J. Sprave. Significance of Locality and Selection Pressure in the Grand Deluge Evolutionary Algorithm. In Proc. 4th Conference on Parallel Problem Solving from Nature, 686-695, Springer, 1996
16. A. Hoff, A. L0kketangen, and I. Mittet. Genetic Algorithms for 0/1 Multidimensional Knapsack Problems. In Proc. Norsk Informatikk Konferanse, 1996
17. A. L0kketangen. A Comparison of a Genetic Algorithm and a Tabu Search Method for 0/1 Multidimensional Knapsack Problems. In Proc. Nordic Operations Research Conference, 1995