Moritz Baum
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Moritz Baum has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
Dorothea Wagner
Institute of Theoretical Informatics Group Algorithmics, Karlsruhe Institute of Technology, 76131 Karlsruhe, Germany
3 shared publicationsJulian Dibbelt
Sunnyvale, California 94086
3 shared publicationsTobias Zündorf
Institute of Theoretical Informatics Group Algorithmics, Karlsruhe Institute of Technology, 76131 Karlsruhe, Germany
3 shared publications- Andreas Gemsa
Karlsruhe Institute of Technology, Karlsruhe, Germany
2 shared publications - Dorothea Wagner
Karlsruhe Institute of Technology (KIT) Karlsruhe Germany
1 shared publication Jonas Sauer
Karlsruhe Institute of Technology (KIT)
1 shared publication
Latest Publications
- 1 November 2020
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 54 (6) , 1571-1600
Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles
We study the problem of computing constrained shortest paths for battery electric vehicles. Because battery capacities are limited, fastest routes are often infeasible. Instead, users are interested in fast routes on which the energy consumption does not exceed the battery capacity. For that, drivers can deliberately reduce speed to save energy. Hence, route planning should provide both path and speed recommendations. To tackle the resulting [ ]-hard optimization problem, previous work trades correctness or accuracy of the underlying model for practical running times. We present a novel framework to compute optimal constrained shortest paths (without charging stops) for electric vehicles that uses more realistic physical models, while taking speed adaptation into account. Careful algorithm engineering makes the approach practical even on large, realistic road networks: We compute optimal solutions in less than a second for typical battery capacities, matching the performance of previous inexact methods. For even faster query times, the approach can easily be extended with heuristics that provide high quality solutions within milliseconds.
- 1 November 2020
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 54 (6) , 1571-1600
Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles
We study the problem of computing constrained shortest paths for battery electric vehicles. Because battery capacities are limited, fastest routes are often infeasible. Instead, users are interested in fast routes on which the energy consumption does not exceed the battery capacity. For that, drivers can deliberately reduce speed to save energy. Hence, route planning should provide both path and speed recommendations. To tackle the resulting [ ]-hard optimization problem, previous work trades correctness or accuracy of the underlying model for practical running times. We present a novel framework to compute optimal constrained shortest paths (without charging stops) for electric vehicles that uses more realistic physical models, while taking speed adaptation into account. Careful algorithm engineering makes the approach practical even on large, realistic road networks: We compute optimal solutions in less than a second for typical battery capacities, matching the performance of previous inexact methods. For even faster query times, the approach can easily be extended with heuristics that provide high quality solutions within milliseconds.
- 3 December 2019
- Published by Springer Nature in Algorithmica
- Vol. 82 (5) , 1490-1546
Energy-Optimal Routes for Battery Electric Vehicles
- 3 December 2019
- Published by Springer Nature in Algorithmica
- Vol. 82 (5) , 1490-1546
Energy-Optimal Routes for Battery Electric Vehicles
- 1 November 2019
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 53 (6) , 1627-1655
Shortest Feasible Paths with Charging Stops for Battery Electric Vehicles
We study the problem of minimizing overall trip time for battery electric vehicles in road networks. As battery capacity is limited, stops at charging stations may be inevitable. Careful route planning is crucial because charging stations are scarce and recharging is time-consuming. We extend the constrained shortest-path problem for electric vehicles with realistic models of charging stops, including varying charging power and battery-swapping stations. Although the resulting problem is theoretically hard, we propose a combination of algorithmic techniques to achieve good performance in practice. Extensive experimental evaluation shows that our approach (CHArge) enables computation of optimal solutions on realistic inputs even of continental scale. Finally, we investigate heuristic variants of CHArge that derive high-quality routes in well below a second on sensible instances.
- 1 November 2019
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 53 (6) , 1627-1655
Shortest Feasible Paths with Charging Stops for Battery Electric Vehicles
We study the problem of minimizing overall trip time for battery electric vehicles in road networks. As battery capacity is limited, stops at charging stations may be inevitable. Careful route planning is crucial because charging stations are scarce and recharging is time-consuming. We extend the constrained shortest-path problem for electric vehicles with realistic models of charging stops, including varying charging power and battery-swapping stations. Although the resulting problem is theoretically hard, we propose a combination of algorithmic techniques to achieve good performance in practice. Extensive experimental evaluation shows that our approach (CHArge) enables computation of optimal solutions on realistic inputs even of continental scale. Finally, we investigate heuristic variants of CHArge that derive high-quality routes in well below a second on sensible instances.
- 22 November 2014
- Published by Springer Nature in Computer Science - Research and Development
- Vol. 31 (1-2) , 105-109
Towards route planning algorithms for electric vehicles with realistic constraints
- 22 November 2014
- Published by Springer Nature in Computer Science - Research and Development
- Vol. 31 (1-2) , 105-109
Towards route planning algorithms for electric vehicles with realistic constraints