Minimum-cost paths for electric cars (2403.16936v1)
Abstract: An electric car equipped with a battery of a finite capacity travels on a road network with an infrastructure of charging stations. Each charging station has a possibly different cost per unit of energy. Traversing a given road segment requires a specified amount of energy that may be positive, zero or negative. The car can only traverse a road segment if it has enough charge to do so (the charge cannot drop below zero), and it cannot charge its battery beyond its capacity. To travel from one point to another the car needs to choose a \emph{travel plan} consisting of a path in the network and a recharging schedule that specifies how much energy to charge at each charging station on the path, making sure of having enough energy to reach the next charging station or the destination. The cost of the plan is the total charging cost along the chosen path. We reduce the problem of computing plans between every two junctions of the network to two problems: Finding optimal energetic paths when no charging is allowed and finding standard shortest paths. When there are no negative cycles in the network, we obtain an $O(n3)$-time algorithm for computing all-pairs travel plans, where~$n$ is the number of junctions in the network. We obtain slightly faster algorithms under some further assumptions. We also consider the case in which a bound is placed on the number of rechargings allowed.
- The design and analysis of computer algorithms. Addison-Wesley, 1974.
- Deterministic APSP, orthogonal vectors, and more: Quickly derandomizing Razborov-Smolensky. ACM Trans. Algorithms, 17(1):2:1–2:14, 2021.
- Edsger W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269–271, 1959.
- Optimal energetic paths for electric cars. In Proc. of 31st ESA, 2023. See also CoRR, abs/2305.19015.
- Faster matrix multiplication via asymmetric hashing. CoRR, abs/2210.10173, 2022. To appear in FOCS 2023.
- Robert W. Floyd. Algorithm 97: Shortest path. Communications of the ACM, 5(6):345, 1962.
- Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34(3):596–615, 1987.
- Hollow heaps. ACM Trans. Algorithms, 13(3):42:1–42:27, 2017.
- To fill or not to fill: The gas station problem. ACM Transactions on Algorithms (TALG), 7(3):1–16, 2011.
- Seth Pettie. A new approach to all-pairs shortest paths on real-weighted graphs. Theor. Comput. Sci., 312(1):47–74, 2004.
- Mikkel Thorup. Integer priority queues with decrease key in constant time and the single source shortest paths problem. J. Comput. Syst. Sci., 69(3):330–353, 2004.
- Stephen Warshall. A theorem on boolean matrices. Journal of the ACM, 9(1):11–12, 1962.
- R. Ryan Williams. Faster all-pairs shortest paths via circuit complexity. SIAM J. Comput., 47(5):1965–1985, 2018.
- R. Ryan Williams. From circuit complexity to faster all-pairs shortest paths. SIAM Rev., 63(3):559–582, 2021.
- Uri Zwick. Exact and approximate distances in graphs - A survey. In Proc. of 9th ESA, volume 2161 of Lecture Notes in Computer Science, pages 33–48. Springer, 2001.
- Uri Zwick. All pairs shortest paths using bridging sets and rectangular matrix multiplication. J. ACM, 49(3):289–317, 2002.