Skip to main content
Conference ProceedingsOPEN ACCESS

A shuffled complex evolution algorithm for the multidimensional knapsack problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 9423 768-775
DOI: 10.1007/978-3-319-25751-8_92
7Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This work addresses the application of a population based evolutionary algorithm called shuffled complex evolution (SCE) in the multidimensional knapsack problem. The SCE regards a natural evolution happening simultaneously in independent communities. The performance of the SCE algorithm is verified through computational experiments using well-known problems from literature and randomly generated problem as well. The SCE proved to be very effective in finding good solutions demanding a very small amount of processing time.

Author supplied keywords

Cite

CITATION STYLE

APA

Baroni, M. D. V., & Varejão, F. M. (2015). A shuffled complex evolution algorithm for the multidimensional knapsack problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9423, pp. 768–775). Springer Verlag. https://doi.org/10.1007/978-3-319-25751-8_92

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