Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/20051
Título: | Solving multidimensional 0-1 knapsack problem with an artificial fish swarm algorithm |
Autor(es): | Azad, Md. Abul Kalam Rocha, Ana Maria A. C. Fernandes, Edite Manuela da G. P. |
Palavras-chave: | 0–1 knapsack problem Multiple constraints Artificial fish swarm Decoding algorithm |
Data: | 2012 |
Editora: | Springer |
Revista: | Lecture Notes in Computer Science |
Resumo(s): | The multidimensional 0–1 knapsack problem is a combinatorial optimization problem, which is NP-hard and arises in many fields of optimization. Exact as well as heuristic methods exist for solving this type of problem. Recently, a population-based artificial fish swarm algorithm was proposed and applied in an engineering context. In this paper, we present a binary version of the artificial fish swarm algorithm for solving multidimensional 0–1 knapsack problem. Infeasible solutions are made feasible by a decoding algorithm. We test the presented method with a set of benchmark problems and compare the obtained results with other methods available in literature. The tested method appears to give good results when solving these problems. |
Tipo: | Artigo em ata de conferência |
URI: | https://hdl.handle.net/1822/20051 |
ISBN: | 978-3-642-31136-9 |
DOI: | 10.1007/978-3-642-31137-6_6 |
ISSN: | 0302-9743 |
Versão da editora: | www.springerlink.com |
Arbitragem científica: | yes |
Acesso: | Acesso restrito UMinho |
Aparece nas coleções: | LES/ALG - Capítulos de livros |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
bAFSA.pdf Acesso restrito! | 124,54 kB | Adobe PDF | Ver/Abrir |