Probabilistic routing for on-street parking search

DOI10.4230/LIPICS.ESA.2016.6MaRDI QIDQ4606276zbMATH OpenFDO

Authors Tobias Arndt, Danijar Hafner, Thomas Kellermeier, Simon Krogmann, Armin Razmjou, Martin S. Krejca, Ralf Rothenberger, Tobias Friedrich

Publication date 2 March 2018

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2016.6

zbMATH Keywords

constrained optimizationdataseton-street parkingparking searchprobabilistic routing

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Traffic problems in operations research (90B20)

Recommendations

• A scalable dynamic parking allocation framework
• scientific article; zbMATH DE number 1057919
• scientific article; zbMATH DE number 1867329
• City streets parking enforcement inspection decisions: the Chinese postman's perspective
• On Markov-dependent parking problems

Cited in

(4)

• A scalable dynamic parking allocation framework
• Competitively pricing parking in a tree
• scientific article; zbMATH DE number 1057919 (Why is no real title available?)
• City streets parking enforcement inspection decisions: the Chinese postman's perspective

This page was built for publication: Probabilistic routing for on-street parking search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606276)