Control algorithms for e-car

Cílem práce byl návrh a implementace řídicích algoritmů pro optimalizaci spotřeby energie elektrického vozidla. Hlavním úkolem byla optimalizace rozložení energie mezi hlavním zdrojem energie (bateriemi) a super-kapacitory v průběhu jízdního cyklu. Jízdní výkonový profil je odhadován a předpovězen na základě 3D geografických souřadnic a matematického modelu vozidla. V první části jsou uvedeny komponenty vozidla a jejich modely. Poté jsou představeny algoritmy na základě klouzavého průměru a dynamického programování. Byly provedeny simulace a analýzy pro demostraci přínosů algoritmů. V poslední části je popsána Java implementace algoritmů a také aplikace pro operační systém Android.The aim of this work is to design and implement energy consumption optimization control algorithms for electric vehicle. The main objective is to optimize the power-split-ratio between the main power source (batteries) and the super-capacitors during the driving cycle. The driving power profile is estimated and predicted using 3D geographic data and vehicle model. In the first part, vehicle components modelling is introduced. Then, moving average based algorithm and dynamic programming algorithm are presented. Simulations and analysis are provided to show algorithms' benefits. In the last part, Java implementation and also Android operating system application are described.

A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times

Green transportation is becoming relevant in the context of smart cities, where the use of electric vehicles represents a promising strategy to support sustainability policies. However the use of electric vehicles shows some drawbacks as well, such as their limited driving-range capacity. This paper analyses a realistic vehicle routing problem in which both driving-range constraints and stochastic travel times are considered. Thus, the main goal is to minimize the expected time-based cost required to complete the freight distribution plan. In order to design reliable Routing plans, a simheuristic algorithm is proposed. It combines Monte Carlo simulation with a multi-start metaheuristic, which also employs biased-randomization techniques. By including simulation, simheuristics extend the capabilities of metaheuristics to deal with stochastic problems. A series of computational experiments are performed to test our solving approach as well as to analyse the effect of uncertainty on the routing plans.Peer Reviewe

Forecasting Recharging Demand to Integrate Electric Vehicle Fleets in Smart Grids

Electric vehicle fleets and smart grids are two growing technologies. These technologies provided new possibilities to reduce pollution and increase energy efficiency. In this sense, electric vehicles are used as mobile loads in the power grid. A distributed charging prioritization methodology is proposed in this paper. The solution is based on the concept of virtual power plants and the usage of evolutionary computation algorithms. Additionally, the comparison of several evolutionary algorithms, genetic algorithm, genetic algorithm with evolution control, particle swarm optimization, and hybrid solution are shown in order to evaluate the proposed architecture. The proposed solution is presented to prevent the overload of the power grid

Estimation of fuel consumption in a hybrid electric refuse collector vehicle using a real drive cycle

Postprint (published version