Dynamic Automated Search of Shunting Routes within Mesoscopic Rail-Traffic Simulators
Table 1
Specification of the weighted undirected graph G0—the primary model of the track infrastructure.
Symbols
Specifications
G0
The weighted undirected graph (i) G0 = (V, E, φ, ε)
V(G0)
The set of vertices of the graph G0 (i) |V(G0)| = n0
E(G0)
The set of edges of the graph G0 (i) |E(G0)| = m0 (ii) E(G0) =Edest (G0) ∪ Econn (G0), Edest (G0) ∩ Econn (G0) = ∅ (iii) The set Edest (G0) contains destination edges (iv) The set Econn (G0) contains connecting edges
φ
The incidence function related to the graph G0 (i) φ: E(G0) ⟶ {(,) | (,) ∈ V(G0) × V(G0) ∧ ≠ }
ε
The edge weight function related to the graph G0 (i) ε: E(G0) ⟶ R+ (the set of positive real numbers)