In this paper a simulated annealing algorithm has been used to approach optimization problems in which the feasibility area contains more than one local minimum, devising then a strategy switching to a search algorithm for faster convergence in the final stage of the procedure. The combined algorithm is described, and has been successfully applied to some test cases for which results are presented and discussed. © 1992 IEEE
A Combined Strategy for Optimization in Non Linear Magnetic Problems Using Simulated Annealing and Search Techniques
NERVI, MARIO;
1992-01-01
Abstract
In this paper a simulated annealing algorithm has been used to approach optimization problems in which the feasibility area contains more than one local minimum, devising then a strategy switching to a search algorithm for faster convergence in the final stage of the procedure. The combined algorithm is described, and has been successfully applied to some test cases for which results are presented and discussed. © 1992 IEEE
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
