Optimal Design of a Traction Induction Motor Using a Data-Driven DOE-Based Method for Electric Vehicle Applications
Bibliographic record
Abstract
This paper presents an efficient framework for the multi-objective optimization of a traction induction motor (IM), addressing the high computational cost of finite element (FE) analysis through a combination of data-driven and evolutionary techniques. A design of experiments (DOE)-based methodology is proposed to define a compact and targeted search space by identifying a high-performing reference design and filtering out insignificant variables. This targeted approach guides the optimization process toward promising regions of the design space, substantially reducing the number of required FE evaluations. Within this space, two evolutionary algorithms, a non-dominated sorting genetic algorithm (NSGA) and differential evolution (DE) are integrated with a genetic aggregation (GAGG) model to rapidly explore optimal designs. The surrogate model, trained on a strategically selected subset of FE data, significantly reduces computational time while maintaining high prediction accuracy. The developed surrogate model is validated against experimental results under varying load profiles. The optimization outcomes are benchmarked against a full FE-based reference optimization. Comparative analysis based on three key performance indicators confirms that the proposed framework offers a highly effective balance of speed and accuracy, achieving less than 6 % deviation in performance metrics while reducing computation time by over 89 %, establishing it as a practical solution for industrial-scale motor design optimization.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.003 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".