Probabilistic routing for on-street parking search

DOI10.4230/LIPICS.ESA.2016.6zbMATH Open1397.90098MaRDI QIDQ4606276FDOQ4606276

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

Publication date 2 March 2018

zbMATH Keywords

datasetconstrained optimizationon-street parkingprobabilistic routingparking search

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) 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

(3)

• A scalable dynamic parking allocation framework
• Competitively pricing parking in a tree
• 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)