Abstract
An extended Tabu algorithm with an aspiration factor is proposed. The algorithm is based on the success of techniques such as the memorization of the previously visited subspaces, the systematic diversification as well as the intensification process for neighborhood creations. The numerical results obtained by solving a mathematical test function and the benchmark problem 22 of the TEAM Workshop reported in this paper will demonstrate the usefulness of the proposed method.
Original language | English |
---|---|
Pages (from-to) | 3570-3574 |
Number of pages | 5 |
Journal | IEEE Transactions on Magnetics |
Volume | 37 |
Issue number | 5 I |
DOIs | |
Publication status | Published - 1 Sept 2001 |
Event | Ninth Biennial Electromagnetic Field Computation (CEFC) - Milwaukee, WI, United States Duration: 4 Jun 2001 → 7 Jun 2001 |
Keywords
- Global optimization
- Inverse problem
- Optimal design
- Stochastic algorithm
- Tabu search method
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Physics and Astronomy (miscellaneous)