https://ifp.hal.science/hal-03102997de Nunzio, GiovanniGiovannide NunzioIFPEN - IFP Energies nouvelles - IFPEN - IFP Energies nouvellesBen Gharbia, IbtihelIbtihelBen GharbiaIFPEN - IFP Energies nouvelles - IFPEN - IFP Energies nouvellesSciarretta, AntonioAntonioSciarrettaIFPEN - IFP Energies nouvelles - IFPEN - IFP Energies nouvellesA General Constrained Optimization Framework for the Eco-Routing Problem: Comparison and Analysis of Solution Strategies for Hybrid Electric VehiclesHAL CCSD2021Eco-routingconstrained optimizationshortest path algorithminteger programminghybrid electric vehiclesenergy management[MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC][INFO.INFO-MO] Computer Science [cs]/Modeling and Simulation[SPI] Engineering Sciences [physics]De Nunzio, GiovanniADvancing user acceptance of general purpose hybridized Vehicles by Improved Cost and Efficiency - ADVICE - 724095 - INCOMING - 2021-01-07 20:01:372021-08-27 09:28:012021-01-08 17:47:11enPreprints, Working Papers, ...application/pdf1Vehicles electrification marks a very important step towards sustainable mobility. However, energy efficiency and driving range of electrified vehicles are nowadays a major concern. From an algorithmic perspective, eco-routing opens up new possibilities regarding the strategies and tools aimed at improving energy efficiency by finding an energy-minimal route under different constraints coming from vehicle characteristics (powertrain, battery capacity, etc.) and user preferences (travel time, etc.). In this work, a powertrain-independent speed prediction model is presented. This model is then used to derive a fast numerical solution of the powertrain energy management for hybrid electric vehicles. Furthermore, a new general formulation is derived for the minimum-energy navigation problem, with a focus on the specific complexity introduced by electrified vehicles. The general constrained optimization problem is reformulated in several alternative ways in order to achieve a solution in limited computation time. The most commonly used approaches nowadays in the literature (integer programming and shortest path algorithms on directed graphs) are compared and benchmarked in terms of solution accuracy and computational effort. The objective is to identify best-practices in accurately and efficiently solving the constrained eco-routing problem.