A simplified binary artificial fish swarm algorithm for 0–1 quadratic knapsack problems

Detalhes bibliográficos
Autor(a) principal: Azad, Md. Abul Kalam
Data de Publicação: 2014
Outros Autores: Rocha, Ana Maria A. C., Fernandes, Edite Manuela da G. P.
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/1822/26403
Resumo: Available online 8 October 2013.
id RCAP_27b134876eec482776ec6074dfebbdae
oai_identifier_str oai:repositorium.sdum.uminho.pt:1822/26403
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling A simplified binary artificial fish swarm algorithm for 0–1 quadratic knapsack problems0–1 knapsack problemHeuristicArtificial fish swarmswap moveLocal searchScience & TechnologyAvailable online 8 October 2013.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.Fundação para a Ciência e a Tecnologia (FCT)ElsevierUniversidade do MinhoAzad, Md. Abul KalamRocha, Ana Maria A. C.Fernandes, Edite Manuela da G. P.20142014-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/1822/26403engAzad, 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.0520377-042710.1016/j.cam.2013.09.052http://www.sciencedirect.com/science/article/pii/S0377042713005074info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-07-21T12:36:08Zoai:repositorium.sdum.uminho.pt:1822/26403Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T19:32:08.134729Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv A simplified binary artificial fish swarm algorithm for 0–1 quadratic knapsack problems
title A simplified binary artificial fish swarm algorithm for 0–1 quadratic knapsack problems
spellingShingle A simplified binary artificial fish swarm algorithm for 0–1 quadratic knapsack problems
Azad, Md. Abul Kalam
0–1 knapsack problem
Heuristic
Artificial fish swarm
swap move
Local search
Science & Technology
title_short A simplified binary artificial fish swarm algorithm for 0–1 quadratic knapsack problems
title_full A simplified binary artificial fish swarm algorithm for 0–1 quadratic knapsack problems
title_fullStr A simplified binary artificial fish swarm algorithm for 0–1 quadratic knapsack problems
title_full_unstemmed A simplified binary artificial fish swarm algorithm for 0–1 quadratic knapsack problems
title_sort A simplified binary artificial fish swarm algorithm for 0–1 quadratic knapsack problems
author Azad, Md. Abul Kalam
author_facet Azad, Md. Abul Kalam
Rocha, Ana Maria A. C.
Fernandes, Edite Manuela da G. P.
author_role author
author2 Rocha, Ana Maria A. C.
Fernandes, Edite Manuela da G. P.
author2_role author
author
dc.contributor.none.fl_str_mv Universidade do Minho
dc.contributor.author.fl_str_mv Azad, Md. Abul Kalam
Rocha, Ana Maria A. C.
Fernandes, Edite Manuela da G. P.
dc.subject.por.fl_str_mv 0–1 knapsack problem
Heuristic
Artificial fish swarm
swap move
Local search
Science & Technology
topic 0–1 knapsack problem
Heuristic
Artificial fish swarm
swap move
Local search
Science & Technology
description Available online 8 October 2013.
publishDate 2014
dc.date.none.fl_str_mv 2014
2014-01-01T00:00:00Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/1822/26403
url http://hdl.handle.net/1822/26403
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 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
0377-0427
10.1016/j.cam.2013.09.052
http://www.sciencedirect.com/science/article/pii/S0377042713005074
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799132832561364992

Registros relacionados