Data-driven optimization of nano-PCM arrangements for battery thermal management based on Lattice Boltzmann simulation
Bibliographic record
Abstract
An efficient Battery Thermal Management System (BTMS) is vital for maximizing electric vehicle effectiveness and extending service life, essential for sustainable transportation. This study proposes a novel non-uniform nano-PCM distribution strategy within BTMS to tackle battery overheating challenges and further proposes a multi-objective optimization framework combining Back Propagation Neural Networks (BPNN) and Genetic Algorithm (GA) to achieve optimal design solutions for BTMS. Optimization data is derived from the well-validated Lattice Boltzmann Method (LBM) results across 343 cases. Initial evaluations show that a negative gradient distributed nano-PCM (Type 2) improves melting rate, heat dissipation power, and temperature uniformity by 4.67%, 4.87%, 19%, and 7.0%, respectively. The BPNN-GA optimization framework satisfactorily correlates nanoparticle distribution with four evaluation metrics, achieving R 2 values from 0.9469 to 0.9987. Optimization improves melting rate, heat dissipation power, and regional and inter-regional temperature uniformity by 9.13%, 9.94%, 7.77%, and 29.73%, respectively. The BPNN-GA also demonstrates reasonable generalizability for the other two practical case scenarios with improvements in certain criteria up to 49.19%. This study highlights the potential of uneven nano-PCM configurations and the efficiency of the LBM-BPNN-GA framework in achieving superior thermal management for BTMS, which is expected to provide insights for future BTMS designs and implementations. • A novel non-uniform distributed Nano-PCM configuration with BTMS is proposed. • Cooling performance of Nano-PCM is assessed via LBM studies across 343 cases. • A novel multi-objective optimization framework using BPNN and GA is proposed. • A negatively gradient-distributed Nano-PCM shows superior cooling performance. • BPNN-GA framework successfully improved multiple evaluation met-rics up to 29.73%.
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".