An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem

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

@InProceedings{cleary:2005:AAGDFR0MKP,

• author = "Robert Cleary and Michael O'Neill",
• title = "An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem",
• booktitle = "Evolutionary Computation in Combinatorial Optimization -- {EvoCOP}~2005",
• year = "2005",
• month = "30 " # mar # "-1 " # apr,
• editor = "G{\"{u}}nther R. Raidl and Jens Gottlieb",
• series = "LNCS",
• volume = "3448",
• publisher = "Springer Verlag",
• address = "Lausanne, Switzerland",
• publisher_address = "Berlin",
• pages = "34--45",
• keywords = "genetic algorithms, genetic programming, grammatical evolution, evolutionary computation, attribute grammar",
• isbn13 = "978-3-540-25337-2",
• ISSN = "0302-9743",
• DOI = "doi:10.1007/978-3-540-31996-2_4",
• abstract = "We describe how the standard genotype-phenotype mapping process of Grammatical Evolution (GE) can be enhanced with an attribute grammar to allow GE to operate as a decoder-based Evolutionary Algorithm (EA). Use of an attribute grammar allows GE to maintain context-sensitive and semantic information pertinent to the capacity constraints of the 01 Multi-constrained Knapsack Problem (MKP). An attribute grammar specification is used to perform decoding similar to a first-fit heuristic. The results presented are encouraging, demonstrating that GE in conjunction with attribute grammars can provide an improvement over the standard context-free mapping process for problems in this domain.",
• notes = "EvoCOP2005 Also known as \cite{cleary:evocop05}",

}

Genetic Programming entries for Robert Cleary Michael O'Neill

Citations