This paper proposes a Hierarchical Evolutionary-Deterministic Algorithm (HEDA) for designing square grounding grids. This algorithm performs the design by means of a hierarchical coupling of a real coded evolutionary algorithm and the Hooke-Jeeves algorithm. The design of the grounding grid is here formalized as a min-max problem. The maximization part is the search of the most dangerous point for a given topological structure, the minimization part is the optimization of the topological parameter (compression ratio) of the grounding grid. The solution of the system of partial differential equations related to the spatial distribution of the current field is carried out by the Galerkin method. The program gives good results in terms of accuracy and computational complexity.
A Hierarchical Evolutionary-Deterministic Algorithm in Topological Optimization of Electrical Grounding Grids / Neri, F.; Cascella, G. L.; Salvatore, N.; Acciani, G.; Gassi, D. A.. - In: WSEAS TRANSACTIONS ON SYSTEMS. - ISSN 1109-2777. - 12:4(2005), pp. 2311-2316.
A Hierarchical Evolutionary-Deterministic Algorithm in Topological Optimization of Electrical Grounding Grids
Neri, F.;Cascella, G. L.;Acciani, G.;
2005-01-01
Abstract
This paper proposes a Hierarchical Evolutionary-Deterministic Algorithm (HEDA) for designing square grounding grids. This algorithm performs the design by means of a hierarchical coupling of a real coded evolutionary algorithm and the Hooke-Jeeves algorithm. The design of the grounding grid is here formalized as a min-max problem. The maximization part is the search of the most dangerous point for a given topological structure, the minimization part is the optimization of the topological parameter (compression ratio) of the grounding grid. The solution of the system of partial differential equations related to the spatial distribution of the current field is carried out by the Galerkin method. The program gives good results in terms of accuracy and computational complexity.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.