Shortest Feasible Paths with Charging Stops for Battery Electric Vehicles∗
| Info | Value |
|---|---|
| Year | 2019 |
| Source | arXiv 2019 (opens in a new tab) |
| Main affiliation | Karlsruhe Institute of Technology, Germany |
| Affiliated countries | Germany, USA |
Main Contribution
- Speeding up shortest path queries
- Extending CSP route planning
Optimisation
- Minimizing travel time
- Capacity-constrained routing
Variables
- Limitation of energy supply
- Battery condition
- Capacity
- Charging
- Charging stops
- Charging time
- Regular charging stations
- Superchargers
- Battery swapping stations
- Energy recuperation
- Dynamic model of State of Charge (SoC)
- Charging stops
- Battery condition
Methods
- Constrained shortest path
- Bicriteria extension of Contraction Hierarchies (CH)
- Generalizations of A* Search
- Incorporate SoC and required charging time into the derived bounds
- Charging function propagating