Optimal Route Planning for Electric Vehicles in Large Networks
| Info | Value |
|---|---|
| Year | 2011 |
| Source | Proceeding AAAI 2011 (opens in a new tab) |
| Main affiliation | Universita ̈t Stuttgart, Institut fu ̈r Formale Methoden der Informatik, 70569 Stuttgart, Germany |
| Affiliated countries | Germany |
Main Contribution
- Speeding up shortest path queries
- Large networks
Optimization
- Minimizing energy consuption
Problems
- Negative energy cost prevents using Djikstra
- Battery constraints
Variables
- Limitation of energy supply
- Battery condition
- Usage
- Running out energy
- Charging
- Overcharging
- Energy recuperation
- Usage
- Battery condition
Methods
- Edge represents energy consumption or recuperation
- Unified cost function representation
- Employing generalization of Johnson's potential shifting technique
- Specific construction of edge cost functions
- Contraction hierarchies
Terminologies
- Routing algorithms
- Djikstra's algorithm
- Johnson's algorithm
- Johnson's potential shifting technique
- Bellman-Ford algorithm
- Contraction hierarchies
- Cost function