z-logo
Premium
An application of evolutionary computation algorithm in multidisciplinary design optimization of battery packs for electric vehicle
Author(s) -
Cui Xujian,
Panda Biranchi,
Chin Christina May May,
Sakundarini Novita,
Wang ChinTsan,
Pareek Kapil
Publication year - 2020
Publication title -
energy storage
Language(s) - English
Resource type - Journals
ISSN - 2578-4862
DOI - 10.1002/est2.158
Subject(s) - battery (electricity) , sorting , battery pack , genetic algorithm , computer science , computation , mathematical optimization , evolutionary algorithm , electric vehicle , optimization problem , algorithm , artificial intelligence , machine learning , mathematics , power (physics) , physics , quantum mechanics
Abstract The increased concerns of climate change are driving a shift in the transport sector from fossil to green fuels and electric vehicles (EVs) systems capable of delivering long‐term sustainability. However, there are some challenges remaining related to batteries used in EVs. These challenges exist in four different levels, that is, cell, module, pack, and EV level which can be easily solved by evolutionary computation (EC) techniques rather than using conventional modeling or optimization methods. In this study, a framework, using EC is proposed to solve the problems of EV applications. Firstly, a multi‐gene genetic programming is proposed to analyze the data in cell level and formulate a model for lithium‐ion battery capacity. The second case study targets optimization of battery encloser design at pack level using non‐dominated sorting genetic algorithm (NSGA‐II). Validation results manifest the outstanding optimization function of NSGA‐II and improved performance of the enclosure. Moreover, the results show improved performance of NSGA‐II when combined with other artificial intelligence algorithms. The results suggest that EC can be integrated in the EV system for monitoring its performance and ensure its safety.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here