Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/25208
Título: | A simplified binary artificial fish swarm algorithm for uncapacitated facility location problems |
Autor(es): | Azad, Md. Abul Kalam Rocha, Ana Maria A. C. Fernandes, Edite Manuela da G. P. |
Palavras-chave: | Uncapacitated facility location 0–1 programming Artificial fish swarm algorithm Local search artificial fish swarm algorithm |
Data: | 2013 |
Editora: | Newswood Limited Publisher |
Revista: | Lecture Notes in Engineering and Computer Science |
Citação: | Md. Abul Kalam Azad, Ana Maria A.C. Rocha, Edite M.G.P. Fernandes, A Simplified Binary Artificial Fish Swarm Algorithm for Uncapacitated Facility Location Problems, Proceedings of theWorld Congress on Engineering 2013, WCE 2013, S. I. Ao and Len Gelman and David WL Hukins and Andrew Hunter and A. M. Korsunsky (Eds.), Vol I, pp. 31–36, London, U.K., Newswood Limited Publisher, 2013. |
Resumo(s): | Uncapacitated facility location problem (UFLP) is a combinatorial optimization problem, which has many applications. The artificial fish swarm algorithm has recently emerged in continuous optimization problem. In this paper, we present a simplified binary version of the artificial fish swarm algorithm (S-bAFSA) for solving the UFLP. In S-bAFSA, trial points are created by using crossover and mutation. In order to improve the quality of the solutions, a cyclic reinitialization of the population is carried out. To enhance the accuracy of the solution, a local search is applied on a predefined number of points. The presented algorithm is tested on a set of benchmark uncapacitated facility location problems. |
Tipo: | Artigo em ata de conferência |
URI: | https://hdl.handle.net/1822/25208 |
ISBN: | 978-988-19251-0-7 |
ISSN: | 2078-0958 2078-0966 |
Versão da editora: | www.iaeng.org |
Arbitragem científica: | yes |
Acesso: | Acesso aberto |
Aparece nas coleções: |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
AMA_Azad_WCE2013.pdf | 589,66 kB | Adobe PDF | Ver/Abrir |