Encontrados 90 documentos, a visualizar página 1 de 9
A simplified binary artificial fish swarm algorithm for uncapacitated facility ...
Azad, Md. Abul Kalam; Rocha, Ana Maria A. C.; Fernandes, Edite Manuela da G. P.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 in continuous global optimization
Rocha, Ana Maria A. C.; Costa, M. Fernanda P.; Fernandes, Edite Manuela da G. P.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...
A global optimization method to solve engineering design problems
Rocha, Ana Maria A. C.; Costa, M. Fernanda P.; Fernandes, Edite Manuela da G. P.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 ...
Hooke and Jeeves based multilevel coordinate search to globally solving nonsmoo...
Costa, M. Fernanda P.; Rocha, Ana Maria A. C.; Fernandes, Edite Manuela da G. P.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.
Multistart Hooke and Jeeves filter method for mixed variable optimization
Fernandes, Florbela P.; Costa, M. Fernanda P.; Fernandes, Edite Manuela da G. P.; Rocha, Ana Maria A. C.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 ...
Nonmonotone hybrid tabu search for Inequalities and equalities : an experimenta...
Ramadas, Gisela C. V.; Fernandes, Edite Manuela da G. P.The main goal of this paper is to analyze the behavior of nonmonotone hybrid tabu search approaches when solving systems of nonlinear inequalities and equalities through the global optimization of an appropriate merit function. The algorithm combines global and local searches and uses a nonmonotone reduction of the merit function to choose the local search. Relaxing the condition aims to call the local search ...
Modified constrained differential evolution for solving nonlinear global optimi...
Azad, Md. Abul Kalam; Fernandes, Edite Manuela da G. P.Nonlinear optimization problems introduce the possibility of multiple local optima. The task of global optimization is to find a point where the objective function obtains its most extreme value while satisfying the constraints. Some methods try to make the solution feasible by using penalty function methods, but the performance is not always satisfactory since the selection of the penalty parameters for the pr...
Multilocal programming : a derivative-free filter multistart algorithm
Fernandes, Florbela P.; Costa, M. Fernanda P.; Fernandes, Edite Manuela da G. P.Multilocal programming aims to locate all the local solutions of an optimization problem. A stochastic method based on a multistart strategy and a derivative-free filter local search for solving general constrained optimization problems is presented. The filter methodology is integrated into a coordinate search paradigm in order to generate a set of trial approximations that might be acceptable if they improve ...
Combined mutation differential evolution to solve systems of nonlinear equations
Ramadas, Gisela C. V.; Fernandes, Edite Manuela da G. P.This paper presents a differential evolution heuristic to compute a solution of a system of nonlinear equations through the global optimization of an appropriate merit function. Three different mutation strategies are combined to generate mutant points. Preliminary numerical results show the effectiveness of the presented heuristic.
Multilocal programming and applications
Pereira, A. I.; Ferreira, O.; Pinho, S. P.; Fernandes, Edite Manuela da G. P.Preprint version ; Multilocal programming aims to identify all local minimizers of unconstrained or constrained nonlinear optimization problems. The multilocal programming theory relies on global optimization strategies combined with simple ideas that are inspired in deflection or stretching techniques to avoid convergence to the already detected local minimizers. The most used methods to solve this type of pr...
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||