Edges of the graph, represented as a tuple (s, t, e)
, where s
is the id of the source node, t
is the id of the target node and e
is the description of the edge.
Must contain a minimum of 1
items
Must contain a minimum of 3
items
Must contain a maximum of 3
items
Value must be greater or equal to 0.0
Value must be greater or equal to 0.0
An edge of a road network that connects two nodes.
{
"base_speed": 13.88888888888889,
"bottleneck_flow": 0.4,
"constant_travel_time": 4.0,
"lanes": 2,
"length": 100.0,
"overtaking": true,
"speed_density": {
"type": "ThreeRegimes",
"value": {
"beta": 2.0,
"jam_density": 0.8,
"jam_speed": 2.7777777777777777,
"min_density": 0.3
}
}
}
The base speed of the edge.
Value must be greater or equal to 0.0
The length of the edge, from source node to target node.
Value must be greater or equal to 0.0
The number of lanes on the edge.
Value must be greater or equal to 1.0
Speed-density function for the running part of the edge.
Vehicles always travel at free-flow speed.
Vehicles travel at free-flow speed when flow is below edge capacity. Then, speed is inversely proportional to flow.
The parameter represents the capacity of each lane of the edge, in length unit per time unit.
A speed-density function with three regimes: free flow, congested and traffic jam.
A speed-density function with three regimes.
The three regimes are:
Free-flow regime. If density on the edge is smaller than min_density
, travel time is equal to free-flow travel time.
Congested regime. If density on the edge is between min_density
and jam_density
, speed is equal to v = v0 * (1 - c) + jam_speed * c
, where v0
is the free-flow speed and c = ((density - min_density) / (jam_density - min_density))^beta
.
Traffic jam. If density on the edge is larger than jam_density
, travel time is equal to tt = distance / jam_speed
.
Density on the edge (between 0.0
and 1.0
) below which the speed is equal to free-flow speed.
Density on the edge (between 0.0
and 1.0
) above which the speed is equal to jam speed.
Speed at which the vehicle travel in case of traffic jam.
Parameter to compute the speed in the congested regime.
Maximum flow of vehicle entering the edge (in PCE per second).
Constant travel time penalty for the runnning part of the edge.
If true
, vehicles can overtaking each other at the exit bottleneck (if they have a different outgoing edge).
Must contain a minimum of 1
items
A road vehicle with a given (headway) length, passenger car equivalent and speed function.
{
"allowed_edges": [],
"headway": 8.0,
"pce": 1.0,
"restricted_edges": [],
"speed_function": {
"type": "Multiplicator",
"value": 0.8
}
}
{
"allowed_edges": [],
"headway": 20.0,
"pce": 3.0,
"restricted_edges": [
1,
0
],
"speed_function": {
"type": "Piecewise",
"value": [
[
0.0,
0.0
],
[
90.0,
90.0
],
[
130.0,
90.0
]
]
}
}
Headway length of the vehicle, used to compute vehicle density on the edges.
Alias: length
Passenger car equivalent of the vehicle, used to compute bottleneck flow.
Speed function that gives the vehicle speed as a function of the edge base speed.
The identity function.
A linear function: f(s) = a * s
.
A piecewise-linear function, represented by a vector of breakpoints (x, y)
, where x
is the base speed on the edge and y
is the effective speed.
The breakpoints (x, y)
must be ordered by increasing x
.
If the edge's base speed is out of bound (i.e., smaller than the smaller x
value or larger than the largest x
value), the base speed is used as the effective speed.
Must contain a minimum of 2
items
Must contain a maximum of 2
items
Representation of a speed, expressed in meters per second.
Set of edge indices that the vehicle is allowed to take (by default, all edges are allowed, unlesse specified in restricted_edges
).
Value must be greater or equal to 0.0
Set of edge indices that the vehicle cannot take. Note that restricted_edges
is ignored if allowed_edges
is specified.
Value must be greater or equal to 0.0