Skip to main content
Conference Proceedings

A simple improvement heuristic for attributed grammatical evolution with lookahead to solve the multiple knapsack problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6935 LNCS 274-281
DOI: 10.1007/978-3-642-24082-9_34
0Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Karim, M. R., & Ryan, C. (2011). A simple improvement heuristic for attributed grammatical evolution with lookahead to solve the multiple knapsack problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6935 LNCS, pp. 274–281). https://doi.org/10.1007/978-3-642-24082-9_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free