Optimal Design of Pin-Fin Heatsinks for SiC Power Modules Based on Analytical Thermal Modeling and TLBO Algorithm
Bibliographic record
Abstract
Thermal management has always been one of the leading technical challenges in high-power power modules. Especially in the current trend of seeking high power density of devices, optimized thermal design is crucial. This paper presents an optimal design method for pin-fin heatsinks for SiC power modules, based on analytical thermal models and Teaching Learning Based Optimization (TLBO) algorithm. First, the analytical thermal model of the pin-fin heatsink is introduced, which combines the Fourier-based conduction model and the empirical convection model. Junction temperature <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(T_{j})$</tex> can be directly estimated using this comprehensive model and has been verified to be within a 5% error by numerical simulations. Then, this paper investigates the effectiveness of TLBO in finding the optimal pin-fin heatsink with a compatible cold plate. Compared to Genetic Algorithm (GA) and Particle Swam Optimization algorithm (PSO), TLBO can converge more easily, taking only one-third of the convergence time with the same optimization target and constraint. This proposed optimal design methodology not only improves the power density of the converter system but also provides a valuable design method for researchers and engineers in the field.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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".