Routing Algorithms with Range Restriction in Sparse Supply Networks
Shortest paths are computed for vehicles with comparatively small maximum range so that they must refuel, recharge or change batteries along a single trip in a road network. Heuristic solutions are given as well as exact algorithms. For sparse networks of service stations, shortest paths within thes...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SAGE Publishing
2013-06-01
|
| Series: | Journal of Algorithms & Computational Technology |
| Online Access: | https://doi.org/10.1260/1748-3018.7.2.145 |