Optimization of Relocation Processes for Shared E-vehicles

ABSTRACT

. This study describes a system with one-way trips and relocations of e-vehicles between sectors by service personnel according to a dynamically compiled list of service trips. The model includes an algorithm that uses model parameter values to optionalize expected income, depending on the dynamically selected e-vehicle transfer. The implementation of the MIP (Mixed-Integer Programming) type algorithm proposed in the study pays particular attention to its performance, as optimization should be performed dynamically with a few hours' interval. The developed optimization algorithm has been validated for its practical application in Riga, Latvia.