Table 2.

Acronyms of the model

Acronym	Description
$\mathcal{G}$	Graph of MAs $G=\langle \mathcal{M},E\rangle$
$\mathcal{M}$	Set of target MAs
E	Set of edges among MAs
N	Number of MAs
$\mathcal{T}$	Time period under study
$\mathcal{A}\in {\mathbb{ℝ}}^{N\times N}$	Adjacency matrix among MAs
$I_N\in {\mathbb{ℝ}}^{N\times N}$	Identity matrix
$\widehat{\mathcal{A}}\in {\mathbb{ℝ}}^{N\times N}$	Adjacency matrix with self-connections
$\mathcal{O}\mathcal{T}\in {\mathbb{ℝ}}^{N\times h_{prev}}$	Feature matrix with sequence of last hprev
	outgoing trips per MA
$\tilde{\mathcal{D}}\in {\mathbb{ℝ}}^{N\times N}$	Degree matrix of $\mathcal{G}$ ($\tilde{\mathcal{D}}={\sum }_j{\tilde{\mathcal{A}}}_{ij}$)