The heuristics herein presented are modified versions of the artificial fish swarm algorithm for global optimization. The new ideas aim to improve solution accuracy and reduce computational costs, in particular the number of function evaluations. The modifications also focus on special point movements, such as the random, search and the leap movements. A local search is applied to refine promising regions. An e...
This paper presents an augmented Lagrangian methodology with a stochastic population based algorithm for solving nonlinear constrained global optimization problems. The method approximately solves a sequence of simple bound global optimization subproblems using a fish swarm intelligent algorithm. A stochastic convergence analysis of the fish swarm iterative process is included. Numerical results with a benchmar...
Nonlinear programming problems are known to be difficult to solve, especially those that involve a multimodal objective function and/or non-convex and at the same time disjointed solution space. Heuristic methods that do not require derivative calculations have been used to solve this type of constrained problems. The most used constraint-handling technique has been the penalty method. This method converts the ...
The algorithm herein presented is a modified version of the artificial fish swarm algorithm for global optimization. The new ideas are focused on a set of movements, closely related to the random, the searching and the leaping fish behaviors. An extension to bound constrained problems is also presented. To assess the performance of the new fish swarm intelligent algorithm, a set of seven benchmark problems is u...
Financiadores do RCAAP | |||||||
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |