Global optimization for discrete magnetostatic problems
M.L. Marchesi, G. Molinari, Maurizio Repetto · IEEE Transactions on Magnetics · 1993
The problem of global optimization of magnetic structures composed of solenoids is examined, using a modified simulated annealing algorithm able to deal with the functions of continuous and/or discrete variables. The algorithm is tested using a discrete problem which allows determination of the cost function for every possible configuration of the system, providing information about the pattern of the cost function with respect to design variables. Despite the difficulty of minimizing the function, the proposed algorithm was able to locate the global minimum, or a point where the cost function has a value very close to it, seven times out of a total of ten runs. The algorithm is described, and results are discussed.>
Cited by 11 works. doi:10.1109/20.250750
Authors
References
- Optimization by Simulated Annealing
- Concepts of scale in simulated annealing
- Vector potential and magnetic field of current-carrying finite arc segment in analytical form, Part III: Exact computation for rectangular cross section
- A combined strategy for optimization in nonlinear magnetic problems using simulated annealing and search techniques
- Applications of simulated annealing for the design of special digital filters
- Optimization problems in electromagnetics
- The subregion method in magnetic field analysis and design optimization
- Optimal magnet design for NMR
- IIR filter design using mixed simulated annealing-deterministic optimization