×
Well done. You've clicked the tower. This would actually achieve something if you had logged in first. Use the key for that. The name takes you home. This is where all the applicables sit. And you can't apply any changes to my site unless you are logged in.

Our policy is best summarized as "we don't care about _you_, we care about _them_", no emails, so no forgetting your password. You have no rights. It's like you don't even exist. If you publish material, I reserve the right to remove it, or use it myself.

Don't impersonate. Don't name someone involuntarily. You can lose everything if you cross the line, and no, I won't cancel your automatic payments first, so you'll have to do it the hard way. See how serious this sounds? That's how serious you're meant to take these.

×
Register


Required. 150 characters or fewer. Letters, digits and @/./+/-/_ only.
  • Your password can’t be too similar to your other personal information.
  • Your password must contain at least 8 characters.
  • Your password can’t be a commonly used password.
  • Your password can’t be entirely numeric.
Enter the same password as before, for verification.
Login

Grow A Dic
Define A Word
Make Space
Set Task
Mark Post
Apply Votestyle
Create Votes
(From: saved spaces)
Exclude Votes
Apply Dic
Exclude Dic

Computing safe bicycle routes -- Berechnung sicherer Fahrradwege

Click here to flash read.

arXiv:2403.18363v1 Announce Type: new
Abstract: The safety of streets is difficult to quantify numerically. However, it is possible to sort streets regarding their safety into ordered categories, like safe, neutral and unsafe. In this paper we model the computation of safe bicycle routes as an optimization problem with ordinal coefficients. We describe an appropriate optimality concept for ordinal optimization problems and introduce a solution strategy for ordinal routing problems. Furthermore, we introduce a concept to incorporate safety preferences by introducing weights such that longer path with a higher safety rating are preferred. We apply the concept of ordinal routing to compute safe bicycle routes in Stuttgart, Germany, based on dates from OpenStreetMaps. We show that the choice of the weights does not only represent the trade-off of safety vs. path length, but has also an impact on the number of alternative solutions and thus on the computation time.
--
Die Sicherheit von Wegen ist nur eingeschr\"ankt messbar und daher schwierig zu quantifizieren. Dahingegen ist es verh\"altnism\"a{\ss}ig leicht Wege bez\"uglich ihrer Sicherheit in geordnete Kategorien, wie beispielsweise sicher, neutral und gef\"ahrlich einzuordnen. In diesem Beitrag werden Optimierungsprobleme mit geordneten Kategorien formuliert und Optimalit\"at f\"ur diese definiert. Daraus wird eine L\"osungsstrategie f\"ur solche Probleme abgeleitet. Dar\"uber hinaus wird erkl\"art, wie die Abgrenzung zwischen den Kategorien erh\"oht werden kann, sodass l\"angere aber daf\"ur sicherere Wege mit Hilfe von Gewichten berechnet werden k\"onnen. Diese theoretischen Ergebnisse werden in der Praxis angewendet und es werden auf Grundlage von Daten von OpenStreetMaps sichere Fahrradwege in Stuttgart berechnet. Dabei zeigt sich, dass eine gute Wahl der Gewichte zu weniger L\"osungen und k\"urzeren Rechenzeiten f\"uhrt.

Click here to read this post out
ID: 806915; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: March 28, 2024, 7:32 a.m. Changes:
/u/anonymous
Dictionaries:
Words:
Spaces:
Views: 8
CC:
No creative common's license
Comments: