Abstract
Constrained optimization problems can be tackled by evolutionary algorithms using penalty functions to guide the search towards feasibility. The core of such approaches is the design of adequate penalty functions. All authors, who designed penalties for knapsack problems, recognized the feasibility problem, i.e. the final population contains unfeasible solutions only. In contrast to previous work, this paper explains the origin of the feasibility problem. Using the concept of fitness segments, a computationally easy analysis of the fitness landscape is suggested. We investigate the effects of the initialization routine, and derive guidelines that ensure resolving the feasibility problem. A new penalty function is proposed that reliably leads to a final population containing feasible solutions, independently of the initialization method employed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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
S. Khuri and A. Batarekh. Heuristics for the Integer Knapsack Problem. In Proc. 10th International Computer Science Conference, 161–172, Santiago, Chile, 1990
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
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
A.L. Olsen. Penalty functions and the knapsack problem. In Proc. 1st IEEE Conference on Evolutionary Computation, 554–558, 1994
R. Hinterding. Representation, Constraint Satisfaction and the Knapsack Problem. In Proc. Congress on Evolutionary Computation, 1286–1292, Washington DC, 1999
S. Khuri, T. Bäck, and J. Heitkötter. The Zero/One Multiple Knapsack Problem and Genetic Algorithms. In Proc. ACM Symposium on Applied Computation, 188–193, ACM Press, 1994
J. Gottlieb. Evolutionary Algorithms for Constrained Optimization Problems. Dissertation, Technical University of Clausthal, 1999. Shaker, Aachen, 2000
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
S. Martello and P. Toth. Knapsack Problems. John Wiley & Sons, 1990
S. Khuri, T. Bäck, and J. Heitkötter. An Evolutionary Approach to Combinatorial Optimization Problems. In Proc. 22nd Annual ACM Computer Science Conference, 66–73, ACM Press, New York, 1994
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
H.A. Mayer. ptGAs-Genetic Algorithms Evolving Noncoding Segments by Means of Promoter/Terminator Sequences. Evolutionary Computation, Volume 6,No. 4, 361–386, 1998
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
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
A. Hoff, A. Løkketangen, and I. Mittet. Genetic Algorithms for 0/1 Multidimensional Knapsack Problems. In Proc. Norsk Informatikk Konferanse, 1996
A. Løkketangen. A Comparison of a Genetic Algorithm and a Tabu Search Method for 0/1 Multidimensional Knapsack Problems. In Proc. Nordic Operations Research Conference, 1995
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gottlieb, J. (2001). On the Feasibility Problem of Penalty-Based Evolutionary Algorithms for Knapsack Problems. In: Boers, E.J.W. (eds) Applications of Evolutionary Computing. EvoWorkshops 2001. Lecture Notes in Computer Science, vol 2037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45365-2_6
Download citation
DOI: https://doi.org/10.1007/3-540-45365-2_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41920-4
Online ISBN: 978-3-540-45365-9
eBook Packages: Springer Book Archive