Options
2018
Conference Paper
Titel
A simulation driven branch and bound optimizer for planning charging infrastructures
Abstract
Electric buses in public transport are increasingly being put into operation. Although batteries with large capacities are available, at least one charging point must exist. Especially buses with smaller batteries need a well-designed charging infrastructure. Planning an optimized charging infrastructure is an elaborate and time-consuming optimization process. In the end, no bus is allowed to give up its service due to the lack of energy, which is checked by simulation. A successful simulation for the maximal layout of a charging network is a perequisite for the existence of at least one solution. Under this condition, an optimizer minimizes the number of charging stations with respect to a successful simulation and a minimal value of a given objective function. Thedeveloped optimizer, based on a Branch and Bound algorithm, solves this integer problem with a specific heuristic. This optimizer will be used as a central component of a planning tool for bus companies, energy providers and urban planners.
Author(s)