Pareto-based branch and bound algorithm for multiobjective optimization of a safety transformer - Archive ouverte HAL
Article Dans Une Revue COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering Année : 2018

Pareto-based branch and bound algorithm for multiobjective optimization of a safety transformer

Résumé

The design of electromagnetic devices is mainly expressed in the literature in term of problem with continuous parameters. However, these problems are in the second part of the design process and often limited to the fine-tuning of some parameters corresponding to the structure selected in the first part. Despite recent progress in topological (Stolpe, 2014) and combinatorial (Amoiralis et al., 2008; Hemker et al., 2008; Sourd and Spanjaard, 2008) optimizations, there is a lack of decision tools for the choice of the structure and materials when dealing with conflicting goals. At this stage, the parameters aremainly discrete and not sorted. Moreover, the production in a very small series practiced by few small and medium firms is supported by standards. It is thus a question of choosing among a great but finite number of solutions rather than to optimize some dimensions finely. Optimization with discrete variables requires different concept than the conventional continuous one. The computation time of combinatorial optimization is also far more expensive. This is worsening in the design of electromagnetic devices because models are non-linear and time-consuming. Heuristic, Tabu search (Glover and Laguna, 1993) and branch and bound (BB) algorithm (Amoiralis et al., 2008; Hemker et al., 2008; Sourd and Spanjaard, 2008) can solve combinatorial problems. The former computes approximate solutions in an affordable time, while the latter finds the exact solutions with higher computing cost. The first part of the paper is devoted to introducing the context of combinatorial optimization in electrical machines and the main issues for solving this kind of problems. In the second part, the mechanisms of BB algorithm are explained and new criteria for the branching and the initialization are proposed for multiobjective problems. The Pareto-based BB algorithm is applied to the bi-objective optimization of a safety transformer. Results are compared to those of exhaustive enumeration and non-dominated sorting genetic algorithm. Finally, some conclusions and prospects are given.
Fichier principal
Vignette du fichier
MOBB_paper_HAL.pdf (833.67 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01913787 , version 1 (21-11-2018)

Identifiants

Citer

Stephane Brisset, Tuan-Vu Tran. Pareto-based branch and bound algorithm for multiobjective optimization of a safety transformer. COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering, 2018, 37 (2), pp.617 - 629. ⟨10.1108/COMPEL-11-2016-0505⟩. ⟨hal-01913787⟩
48 Consultations
362 Téléchargements

Altmetric

Partager

More