Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/26403
Registo completo
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | Azad, Md. Abul Kalam | - |
dc.contributor.author | Rocha, Ana Maria A. C. | - |
dc.contributor.author | Fernandes, Edite Manuela da G. P. | - |
dc.date.accessioned | 2013-11-28T11:28:01Z | - |
dc.date.available | 2013-11-28T11:28:01Z | - |
dc.date.issued | 2014 | - |
dc.identifier.citation | 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 | - |
dc.identifier.issn | 0377-0427 | - |
dc.identifier.uri | https://hdl.handle.net/1822/26403 | - |
dc.description | Available online 8 October 2013. | por |
dc.description.abstract | 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. | por |
dc.description.sponsorship | Fundação para a Ciência e a Tecnologia (FCT) | por |
dc.language.iso | eng | por |
dc.publisher | Elsevier 1 | por |
dc.rights | openAccess | por |
dc.subject | 0–1 knapsack problem | por |
dc.subject | Heuristic | por |
dc.subject | Artificial fish swarm | por |
dc.subject | swap move | por |
dc.subject | Local search | por |
dc.title | A simplified binary artificial fish swarm algorithm for 0–1 quadratic knapsack problems | por |
dc.type | article | por |
dc.peerreviewed | yes | por |
dc.relation.publisherversion | http://www.sciencedirect.com/science/article/pii/S0377042713005074 | - |
sdum.publicationstatus | published | por |
oaire.citationStartPage | 897 | - |
oaire.citationEndPage | 904 | - |
oaire.citationIssue | PART B | por |
oaire.citationTitle | Journal of Computational and Applied Mathematics | por |
oaire.citationVolume | 259 | - |
dc.identifier.doi | 10.1016/j.cam.2013.09.052 | - |
dc.subject.wos | Science & Technology | por |
sdum.journal | Journal of Computational and Applied Mathematics | por |
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 |