This paper aims to propose a reliable local search algorithm having steepest descent pivot rule for computationally expensive optimization problems. In particular, an application to the design of Permanent Magnet Synchronous Motor (PMSM) drives is shown.
A surrogate assisted Hooke‐Jeeves algorithm (SAHJA) is proposed. The SAHJA is a local search algorithm with the structure of the Hooke‐Jeeves algorithm, which employs a local surrogate model dynamically constructed during the exploratory move at each step of the optimization process.
Several numerical experiments have been designed. These experiments are carried out both on the simulation model (off‐line) and at the actual plant (on‐line). Moreover, the off‐line experiments have been considered in non‐noisy and noisy cases. The numerical results show that use of the SAHJA leads to a saving in terms of computational cost without requiring any extra hardware components.
The surrogate approach in the design of electric drives is novel. In addition, implementation of the proposed surrogate model allows the algorithm not only to reduce computational cost but also to filter noise caused by the sensors and measurement devices.
Neri, F., del Toro Garcia, X., Cascella, G.L. and Salvatore, N. (2008), "Surrogate assisted local search in PMSM drive design", COMPEL - The international journal for computation and mathematics in electrical and electronic engineering, Vol. 27 No. 3, pp. 573-592. https://doi.org/10.1108/03321640810861043
Emerald Group Publishing Limited
Copyright © 2008, Emerald Group Publishing Limited