Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/26403
Título: | A simplified binary artificial fish swarm algorithm for 0–1 quadratic knapsack problems |
Autor(es): | Azad, Md. Abul Kalam Rocha, Ana Maria A. C. Fernandes, Edite Manuela da G. P. |
Palavras-chave: | 0–1 knapsack problem Heuristic Artificial fish swarm swap move Local search |
Data: | 2014 |
Editora: | Elsevier |
Revista: | Journal of Computational and Applied Mathematics |
Citação: | Azad, M. A. K., Rocha, A., & Fernandes, E. M. G. P. (2014). A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems. Journal of Computational and Applied Mathematics, 259 , 897-904. doi: 10.1016/j.cam.2013.09.052 |
Resumo(s): | This paper proposes a simplified binary version of the artificial fish swarm algorithm (S-bAFSA) for solving 0–1 knapsack problems. This is a combinatorial optimization problem, which arises in many fields of optimization. In S-bAFSA, trial points are created by using crossover and mutation. In order to make the points feasible, a random heuristic drop item procedure is used. The heuristic add item is also implemented to improve the quality of the solutions, and a cyclic reinitialization of the population is carried out to avoid convergence to non-optimal solutions. To enhance the accuracy of the solution, a local search is applied on a predefined number of points. The method is tested on a set of benchmark 0–1 knapsack problems. |
Tipo: | Artigo |
Descrição: | Available online 8 October 2013. |
URI: | https://hdl.handle.net/1822/26403 |
DOI: | 10.1016/j.cam.2013.09.052 |
ISSN: | 0377-0427 |
Versão da editora: | http://www.sciencedirect.com/science/article/pii/S0377042713005074 |
Arbitragem científica: | yes |
Acesso: | Acesso aberto |
Aparece nas coleções: | CAlg - Artigos em revistas internacionais / Papers in international journals |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
SbAFSA_JCAM_2013.pdf | 155 kB | Adobe PDF | Ver/Abrir |