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 im...
Distribution based artificial fish swarm (DbAFS) is a new heuristic for continuous global optimization. Based on the artificial fish swarm paradigm, the new algorithm generates trial points from the Gaussian distribution, where the mean is the midpoint between the current and the target point and the standard deviation is the difference between those two points. A local search procedure is incorporated into the...
Distribution based artificial fish swarm is a new heuristic for continuous global optimization. Based on the artificial fish swarm paradigm, the new algorithm generates trial points from the Gaussian distribution, where the mean is the target point and the standard deviation is the difference between the current and the target point. A local search procedure is incorporated into the algorithm aiming to improve the ...
The article presents the results of two focus groups and a questionnaire implemented with engineering students from the University of Minho, in order to assess opinions and perspectives concerning the main learning difficulties in mathematics-based disciplines. The results obtained show that students generally see the relevance of mathematics to engineering courses. Mathematics is considered as an essential dis...
Publicado em "AIP Conference Proceedings", vol. 1558 ; In this paper, we present a derivative-free multilevel coordinate search (MCS) approach, that relies on the Hooke and Jeeves local search, for globally solving bound constrained optimization problems. Numerical experiments show that the proposed algorithm is effective in solving benchmark problems, when compared with the well-known solvers MCS and DIRECT.
AIP Conference Proceedings, vol. 1558 ; In this study, we propose an extended version of the Hooke and Jeeves algorithm that uses a simple heuristic to handle integer and/or binary variables and a filter set methodology to handle constraints. This proposal is integrated into a multistart method as a local solver and it is repeatedly called in order to compute different optimal solutions. Then, the best of all ...
Documento submetido para revisão pelos pares. A publicar em "Journal of computational and applied mathematics". ISSN 0377-0427. Available online 8 October 2013 (http://www.sciencedirect.com/science/article/pii/S0377042713005074) ; 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, whic...
Documento submetido para revisão pelo pares a publicar em Swarm and evolutionary computation. ISSN 2210-6502. Versão "In Press, Corrected Proof" disponível em http://www.sciencedirect.com/science/article/pii/S2210650213000552?np=y ; The 0–1 multidimensional knapsack problem (MKP) arises in many fields of optimization and is NP-hard. Several exact as well as heuristic methods exist. Recently, an artificial fish...
Financiadores do RCAAP | |||||||
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |