The dissertation thesis deal with the design and the optimization of the permanent magnet synchronous machine (SMPM) based on the artificial intelligence. The main target is to apply potential optimization methods on the design procedure of the machine and evaluate the effectiveness of optimization and the optimization usefulness. In general, the optimization of the material properties (NdFeB or SmCo), the efficiency maximization with given nominal input parameters, the cogging torque elimination are proposed. Moreover, the magnet shape optimization, shape of the air gap and the shape of slots were also performed. The well known Genetic algorithm and Self-Organizing migrating algorithm produced in Czech were presented and applied on the particular optimization issues. The basic principles (iterations) and definitions (penalty function and cost function) of proposed algorithms are demonstrated on the examples. The results of the vibration generator optimization (VG) with given power 7mW (0.1g acceleration) and the results of the SMPM 1,1kW (6 krpm) optimization are practically evaluated in the collaboration with industry. Proposed methods are useful for the optimization of PM machines and they are further theoretically applied on the low speed machine (10 krpm) optimization and high speed machine (120 krpm) optimization.

This research investigates tolerance strategies for modular systems on a project specific basis. The objective of the proposed research is to form a guideline for optimizing the construction costs/risks with the aim of developing an optimal design of resilient modular systems. The procedures for achieving the research objective included: (a) development of 3D structural analysis models of the modules, (b) strength/stability investigation of the structure, (c) developing the fabrication cost function, (e) checking elastic and inelastic distortion, and (f) constructing the site-fit risk functions. The total site-fit risk function minimizes the cost/risk associated with fabrication, transportation; alignment, rework, and safety, while maximizing stiffness in terms of story drift values for site re-alignment and fitting alternatives. The fabrication cost function was developed by collecting 61 data points for the investigated module chassis using the SAP2000 software while reducing the initial section sizes, in addition to the fabrication costs at each step (61 steps). With the reduction of the structural reinforcement, story drift values increase, therefore there will be a larger distortion in the module. This generic module design procedure models a trade-off between the amount of reinforcement and expected need for significant field alterations. Structural design software packages such as SAP2000, AutoCAD, and Autodesk were used in order to model and test the module chassis. This research hypothesizes that the influential factors in the site-fit risk functions are respectively: fabrication, transportation, alignment, safety, and rework costs/risks. In addition, the site-fit risk function provides a theoretical range of possible solutions for the construction industry. The maximum allowable modular out-of-tolerance value, which requires the minimum amount of cost with respect to the defined function, can be configured using this methodology. This research concludes that over-reinforced or lightly-reinforced designs are not the best solution for mitigating risks, and reducing costs. For this reason the site-fit risk function will provide a range of pareto-optimal building solutions with respect to the fabrication, transportation, safety, alignment, and rework costs/risks.

Les problèmes d’optimisation combinatoire sont devenus la cible de nombreuses recherches scientifiques pour leur importance dans la résolution de problèmes académiques et de problèmes réels rencontrés dans le domaine de l’ingénierie et dans l’industrie. La résolution de ces problèmes par des méthodes exactes ne peut être envisagée à cause des délais de traitement souvent exorbitants que nécessiteraient ces méthodes pour atteindre la (les) solution(s) optimale(s). Dans cette thèse, nous nous sommes intéressés au contexte algorithmique de résolution des problèmes combinatoires, et au contexte de modélisation de ces problèmes. Au niveau algorithmique, nous avons appréhendé les méthodes hybrides qui excellent par leur capacité à faire coopérer les méthodes exactes et les méthodes approchées afin de produire rapidement des solutions. Au niveau modélisation, nous avons travaillé sur la spécification et la résolution exacte des problématiques complexes de fouille des ensembles de motifs en étudiant tout particulièrement le passage à l’échelle sur des bases de données de grande taille. D'une part, nous avons proposé une première parallélisation de l'algorithme DGVNS, appelée CPDGVNS, qui explore en parallèle les différents clusters fournis par la décomposition arborescente en partageant la meilleure solution trouvée sur un modèle maître-travailleur. Deux autres stratégies, appelées RADGVNS et RSDGVNS, ont été proposées qui améliorent la fréquence d'échange des solutions intermédiaires entre les différents processus. Les expérimentations effectuées sur des problèmes combinatoires difficiles montrent l'adéquation et l'efficacité de nos méthodes parallèles. D'autre part, nous avons proposé une approche hybride combinant à la fois les techniques de programmation linéaire en nombres entiers (PLNE) et la fouille de motifs. Notre approche est complète et tire profit du cadre général de la PLNE (en procurant un haut niveau de flexibilité et d’expressivité) et des heuristiques spécialisées pour l’exploration et l’extraction de données (pour améliorer les temps de calcul). Outre le cadre général de l’extraction des ensembles de motifs, nous avons étudié plus particulièrement deux problèmes : le clustering conceptuel et le problème de tuilage (tiling). Les expérimentations menées ont montré l’apport de notre proposition par rapport aux approches à base de contraintes et aux heuristiques spécialisées. / Combinatorial optimization problems have become the target of many scientific researches for their importance in solving academic problems and real problems encountered in the field of engineering and industry. Solving these problems by exact methods is often intractable because of the exorbitant time processing that these methods would require to reach the optimal solution(s). In this thesis, we were interested in the algorithmic context of solving combinatorial problems, and the modeling context of these problems. At the algorithmic level, we have explored the hybrid methods which excel in their ability to cooperate exact methods and approximate methods in order to produce rapidly solutions of best quality. At the modeling level, we worked on the specification and the exact resolution of complex problems in pattern set mining, in particular, by studying scaling issues in large databases. On the one hand, we proposed a first parallelization of the DGVNS algorithm, called CPDGVNS, which explores in parallel the different clusters of the tree decomposition by sharing the best overall solution on a master-worker model. Two other strategies, called RADGVNS and RSDGVNS, have been proposed which improve the frequency of exchanging intermediate solutions between the different processes. Experiments carried out on difficult combinatorial problems show the effectiveness of our parallel methods. On the other hand, we proposed a hybrid approach combining techniques of both Integer Linear Programming (ILP) and pattern mining. Our approach is comprehensive and takes advantage of the general ILP framework (by providing a high level of flexibility and expressiveness) and specialized heuristics for data mining (to improve computing time). In addition to the general framework for the pattern set mining, two problems were studied: conceptual clustering and the tiling problem. The experiments carried out showed the contribution of our proposition in relation to constraint-based approaches and specialized heuristics.