Abstract
In this paper, we introduce a new approach to genotype-phenotype mapping for Grammatical Evolution (GE) using an attribute grammar (AG) to solve 0-1 multiconstraint knapsack problems.
Previous work on AGs dealt with constraint violations through repeated remapping of non-terminals, which generated many introns, thus decreasing the power of the evolutionary search.
Our approach incorporates a form of lookahead into the mapping process using AG to focus only on feasible solutions and so avoid repeated remapping and introns. The results presented in this paper show that the proposed approach is capable of obtaining high quality solutions for the tested problem instances using fewer evaluations than existing methods.
Keywords
- Problem Instance
- Knapsack Problem
- Constraint Satisfaction Problem
- Constraint Violation
- Semantic Function
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools, 2nd edn. Addison-Wesley, Reading (2006)
Beasley, J.E.: Or-library: distributing test problems by electronic mail. Journal of the Operational Research Society 41(11), 1069–1072 (1990)
Chu, P.C., Beasley, J.E.: A genetic algorithm for the multidimensional knapsack problem. Journal of Heuristics 4(1), 63–86 (1998)
Cleary, R.: Extending Grammatical Evolution with Attribute Grammars: An Application to Knapsack Problems. Master of science thesis in computer science, University of Limerick, Ireland (2005)
Cotta, C., Troya, J.M.: A hybrid genetic algorithm for the 0-1 multiple knapsack problem. In: Artificial Neural Nets and Genetic Algorithms 3, pp. 250–254. Springer, New York (1998)
de la Cruz, M., Ortega de la Puente, A., Alfonseca, M.: Attribute grammar evolution. In: Mira, J., Álvarez, J.R. (eds.) IWINAC 2005. LNCS, vol. 3562, pp. 182–191. Springer, Heidelberg (2005)
Gottlieb, J.: On the effectivity of evolutionary algorithms for the multidimensional knapsack problem. In: Fonlupt, C., Hao, J.-K., Lutton, E., Schoenauer, M., Ronald, E. (eds.) AE 1999. LNCS, vol. 1829, pp. 23–37. Springer, Heidelberg (2000)
Gottlieb, J.: Permutation-based evolutionary algorithms for multidimensional knapsack problems. In: Proceedings of the 2000 ACM Symposium on Applied Computing, pp. 408–414. ACM, New York (2000)
Gottlieb, J.: On the feasibility problem of penalty-based evolutionary algorithms for knapsack problems. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol. 2037, pp. 50–59. Springer, Heidelberg (2001)
Gottlieb, J., Raidl, G.R.: The effects of locality on the dynamics of decoder-based evolutionary search. In: Proceedings of the Genetic and Evolutionary Computation Conference 2000, pp. 283–290. Morgan Kaufmann Publishers, San Francisco (2000)
Khuri, S., Back, T., Heitkotter, J.: The zero/one multiple knapsack problem and genetic algorithms. In: Proceedings of the 1994 ACM Symposium on Applied Computing, pp. 188–193. ACM Press, New York (1994)
Knuth, D.E.: Semantics of context-free languages. Theory of Computing Systems 2(2), 127–145 (1968)
Kumar, V.: Algorithms for constraint satisfaction problems: A survey. AI Magazine 13(1), 32–44 (1992)
O’Neill, M., Cleary, R., Nikolov, N.: Solving knapsack problems with attribute grammars. In: Proceedings of the Third Grammatical Evolution Workshop (2004)
Paakki, J.: Attribute grammar paradigms–a high-level methodology in language implementation. ACM Comput. Surv. 27(2), 196–255 (1995)
Paterson, N., Livesey, M.: Evolving caching algorithms in C by genetic programming. In: Koza, J.R., Deb, K., Dorigo, M., Fogel, D.B., Garzon, M., Iba, H., Riolo, R.L. (eds.) Proceedings of the Second Annual Conference on Genetic Programming, pp. 262–267. Morgan Kaufmann, San Francisco (1997)
Pisinger, D.: Algorithms for knapsack problems. Ph.D. thesis, University of Copenhagen (1995)
Raidl, G.R.: An improved genetic algorithm for the multiconstrained 0-1 knapsack problem. In: Proceeding of the 1998 IEEE International Conference on Evolutionary Computation, pp. 207–211 (1998)
Raidl, G.R.: Weight-codings in a genetic algorithm for the multi-constraint knapsack problem. In: Proceedings of the 1999 Congress on Evolutionary Computation, pp. 596–603 (1999)
Ryan, C., Azad, R.M.A.: Sensible initialisation in grammatical evolution. In: Barry, A.M. (ed.) Proceedings of the Bird of a Feather Workshops, Genetic and Evolutionary Computation Conference, Chigaco, pp. 142–145 (2003)
Ryan, C., Collins, J., O’Neill, M.: Grammatical evolution: Evolving programs for an arbitrary language. In: Proceedings of the First European Workshop on Genetic Programming, pp. 83–95. Springer, Heidelberg (1998)
Ryan, C., Nicolau, M., O’Neill, M.: Genetic algorithms using grammatical evolution. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A.G.B. (eds.) EuroGP 2002. LNCS, vol. 2278, pp. 278–287. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karim, M.R., Ryan, C. (2011). A New Approach to Solving 0-1 Multiconstraint Knapsack Problems Using Attribute Grammar with Lookahead. In: Silva, S., Foster, J.A., Nicolau, M., Machado, P., Giacobini, M. (eds) Genetic Programming. EuroGP 2011. Lecture Notes in Computer Science, vol 6621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20407-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-20407-4_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20406-7
Online ISBN: 978-3-642-20407-4
eBook Packages: Computer ScienceComputer Science (R0)