Dynamic one-way street detection and routing penalties

A non-transitory computer readable storage medium configured to store program code, the program code comprising instructions that, when executed by one or more processors, cause the one or more processors to:

• access an electronic map associated with a segment of a road;
• identify a plurality of traces of automobile vehicles that traveled a direction of the segment of the road;
• determine a percentage of traces that traveled in the direction relative to a total number of the plurality of traces;
• overwrite a cost factor of routing calculation associated with the segment with a penalized cost factor based on the percentage of traces;
• receive a routing query;
• compute a penalized cost associated with the segment using the penalized cost factor, the penalized cost being higher than an original cost computed using the cost factor;
• and
• select a route that avoids the segment having the penalized cost.

A method comprising:

• accessing an electronic map associated with an intersection of a road;
• accessing a cost factor associated with a maneuver at the intersection, wherein the cost factor is used in routing calculations to compute a cost of performing the maneuver at the intersection in order to determine whether a route including the maneuver at the intersection is selected among a plurality of possible routes;
• identifying a plurality of traces of automobile vehicles that traveled at the intersection;
• determining a percentage of traces of automobile vehicles that performed the maneuver relative to a total number of the plurality of traces;
• and
• overwriting the cost factor associated with the maneuver with a penalized cost factor that results in a higher cost associated with performing the maneuver in the routing calculations.