https://github.com/h-waldschmidt/olsp
Optimized loading station placement based on hierarchical Hub-Labeling
https://github.com/h-waldschmidt/olsp
contraction-hierarchies cpp dijkstra e-mobility hub-labeling hub-labeling-algorithm pathfinding
Last synced: 5 months ago
JSON representation
Optimized loading station placement based on hierarchical Hub-Labeling
- Host: GitHub
- URL: https://github.com/h-waldschmidt/olsp
- Owner: h-waldschmidt
- License: apache-2.0
- Created: 2023-08-01T14:05:36.000Z (almost 3 years ago)
- Default Branch: main
- Last Pushed: 2024-03-20T15:18:36.000Z (over 2 years ago)
- Last Synced: 2024-04-24T05:27:12.159Z (about 2 years ago)
- Topics: contraction-hierarchies, cpp, dijkstra, e-mobility, hub-labeling, hub-labeling-algorithm, pathfinding
- Language: C++
- Homepage:
- Size: 103 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Optimized Loading Station Placement (OLSP)
This code is part of my bachelor thesis [[1]](#1).
## How to run?
1. Get Stuttgart, Baden-Württemberg and Deutschland graph from [here](https://fmi.uni-stuttgart.de/alg/research/stuff/)
2. Create `data` folder and place graph files in there
3. Compile with `sh build.sh -r`
4. Run with `./build/olsp` (Default: runs predefined benchmarks for all graphs without independent sets)
5. (To define custom benchmarks edit `src/main.cpp` file (see `example` function). Available graph functions can be found in `src/graph.h`)
## References
[1]
Waldschmidt Helmut
"Optimized placement of charging stations for electric cars"
http://dx.doi.org/10.18419/opus-13829