A Network Flow Formulation of the Location-Scheduling Problem for Electric Vehicle Charge Stations with Incomplete Information

When solving the location-scheduling problems related to the design of a private charging infrastructure for a fleet of electric vehicles, we may encounter a gap between the number of unfeasible vehicles obtained from optimization and the simulation results. The gap is caused by the fact that users of the charging infrastructure make decisions based on less information than is assumed to be available in the optimization algorithms. In our contribution, we show how to model these problems by using the flows in networks. We propose an algorithm that will operate despite the lack of information utilised by the users of the charging infrastructure.