<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05945105</id>
  <dt>a</dt>
  <an>05945105</an>
  <augroup>
    <au>Karim, Muhammad Rezaul</au>
    <au>Ryan, Conor</au>
  </augroup>
  <ti>A new approach to solving 0-1 multiconstraint knapsack problems using attribute grammar with lookahead.</ti>
  <so>Silva, Sara (ed.) et al., Genetic programming. 14th European conference, EuroGP 2011, Torino, Italy, April 27--29, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20406-7/pbk). Lecture Notes in Computer Science 6621, 250-261 (2011).</so>
  <py>2011</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-20407-4_22</li>
  </ligroup>
  <abgroup>
    <ab>Summary: 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.</ab>
    <rv></rv>
  </abgroup>
</item>