A Simple Improvement Heuristic for Attributed Grammatical Evolution with Lookahead to Solve the Multiple Knapsack Problem

Created by W.Langdon from gp-bibliography.bib Revision:1.3973

@InProceedings{Karim:2011:ICHIT,
  author =       "Muhammad Rezaul Karim and Conor Ryan",
  title =        "A Simple Improvement Heuristic for Attributed
                 Grammatical Evolution with Lookahead to Solve the
                 Multiple Knapsack Problem",
  booktitle =    "Proceedings of the 5th International Conference on
                 Convergence and Hybrid Information Technology, ICHIT
                 2011",
  year =         "2011",
  editor =       "Geuk Lee and Daniel Howard and Dominik Slezak",
  volume =       "6935",
  series =       "Lecture Notes in Computer Science",
  pages =        "274--281",
  address =      "Daejeon, Korea",
  month =        sep # " 22-24",
  publisher =    "Springer",
  keywords =     "genetic algorithms, genetic programming, Grammatical
                 Evolution",
  isbn13 =       "978-3-642-24081-2",
  DOI =          "doi:10.1007/978-3-642-24082-9_34",
  size =         "8 pages",
  abstract =     "In this paper, we introduce a simple improvement
                 heuristic to be used with Attribute Grammar with
                 Lookahead approach (AG+LA), a recently proposed mapping
                 approach for Grammatical Evolution (GE) using an
                 attribute grammar (AG) to solve the Multiple Knapsack
                 Problem (MKP). The results presented in this paper show
                 that the proposed improvement heuristic can improve the
                 quality of solutions obtained by AG+LA with little
                 computational effort.",
  affiliation =  "Biocomputing and Developmental Systems Group,
                 Department of Computer Science and Information Systems,
                 University of Limerick, Ireland",
}

Genetic Programming entries for Muhammad Rezaul Karim Conor Ryan

Citations