An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem.
In: Evolutionary Computation in Combinatorial Optimization; 2005, p34-45, 12p
Buch
Zugriff:
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 Multiconstrained 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. [ABSTRACT FROM AUTHOR]
Copyright of Evolutionary Computation in Combinatorial Optimization is the property of Springer eBooks and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Titel: |
An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem.
|
---|---|
Autor/in / Beteiligte Person: | Raidl, Günther R. ; Gottlieb, Jens ; Cleary, Robert ; O'Neill, Michael |
Quelle: | Evolutionary Computation in Combinatorial Optimization; 2005, p34-45, 12p |
Veröffentlichung: | 2005 |
Medientyp: | Buch |
ISBN: | 978-3-540-25337-2 (print) |
Sonstiges: |
|