Automated valet parking is a use case for autonomous driving. It allows customers to leave their vehicles at the entrance of a parking garage. The vehicles then independently steer to a parking space. Besides increasing comfort, automated valet parking also enables parking garage operators to provide additional services, such as charging an electric vehicle, to which the vehicle can be autonomously routed. We formulate automated valet parking service provision as a scheduling problem and propose solution methods that focus on runtime and quality of results. The results show that the proposed optimization approach is capable of slightly outperforming heuristic benchmarks in many scenarios. However, we also find that the First-Come-First-Served and Earliest-Due-Date-First heuristics are often satisfying scheduling approaches. In addition, the potential of optimizing automated valet parking service provision is compared to traditional parking garages, showing at least a 46.4% increase in charging and other services scheduled.
Schmidt, Marc, Staudt, Philipp. The automated valet parking problem for parking garage service provision. // Journal of Scheduling. – 2026. – DOI: 10.1007/s10951-026-00894-z. – URL: http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10951-026-00894-z
Schmidt, Marc, Staudt, & Philipp (2026). The automated valet parking problem for parking garage service provision. Journal of Scheduling. https://doi.org/10.1007/s10951-026-00894-z
Schmidt, et al. “The automated valet parking problem for parking garage service provision.” Journal of Scheduling, 2026. doi:10.1007/s10951-026-00894-z.
@article{Schmidt2026,
title = {The automated valet parking problem for parking garage service provision},
author = {Schmidt and Marc and Staudt and Philipp},
journal = {Journal of Scheduling},
year = {2026},
doi = {10.1007/s10951-026-00894-z},
url = {http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10951-026-00894-z}
}
In this paper, we consider cost-sharing problems defined on rooted trees. We refer to these problems as cost-tree problems and to the induced transferable utility cooperative games as irrigation games. We introduce a formal notion of...
In this paper, we focus on nonlinear programming problems with cardinality constraints that restrict the number of nonzero components of the decision vector. We start with a straightforward mixed-integer programming reformulation....
Portfolio selection is a critical issue in financial management under uncertainty. In this paper, we propose a complex approach for portfolio selection with quantile return approximation. In particular, we propose a practical workflow...
The transcendental logarithmic (translog) production function is recognised as a flexible functional form for modelling production processes. It accommodates varying elasticities of input substitution and diverse types of...
This study investigates mothership-drone route determination using two optimization approaches: a Mixed Integer Linear Programming (MILP) model based on a discrete hexagonal grid, and a Mixed Integer Nonlinear Programming (MINLP) model...