The use of Grid Computing to solve electromagnetic optimization problems by means of the Tabu Search strategy is proposed in this paper. In order to significantly reduce the prohibitive computational cost of the numerical analyses required by the majority of iterative algorithms, two different grid-enabled Tabu Search strategies have been ported in the grid. Both strategies belong to the Domain Decomposition family: the decomposition of the search space and the decomposition of the neighborhood. The performances of the different parallel implementations have been evaluated on some electromagnetic benchmarks.
Grid-Enabled Tabu Search for Electromagnetic Optimization Problems
CARCANGIU, SARA;FANNI, ALESSANDRA;MONTISCI, AUGUSTO
2010-01-01
Abstract
The use of Grid Computing to solve electromagnetic optimization problems by means of the Tabu Search strategy is proposed in this paper. In order to significantly reduce the prohibitive computational cost of the numerical analyses required by the majority of iterative algorithms, two different grid-enabled Tabu Search strategies have been ported in the grid. Both strategies belong to the Domain Decomposition family: the decomposition of the search space and the decomposition of the neighborhood. The performances of the different parallel implementations have been evaluated on some electromagnetic benchmarks.
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.
