
The traffic assignment problem (TAP) is essential to efficient road network operation and significantly influences urban mobility and development. Traditional optimization algorithms typically rely on strict assumptions and iterative optimization methods, making them computationally intensive and inflexible. Deep learning methods, conversely, offer a promising alternative by effectively capturing heterogeneous and nonlinear traffic flow characteristics from diverse datasets. This study introduced a graph convolutional network (GCN)-based framework for the user equilibrium traffic assignment problem (UE-TAP). Specifically, the proposed GCN model learned the implicit relationships between origin-destination (OD) demand matrices and the resulting equilibrium traffic flows, providing efficient and reliable traffic flow estimations without iterative computations. Furthermore, to accommodate variations in network topology, an innovative deep learning approach based on network partitioning and subgraph training was introduced, significantly enhancing the scalability and adaptability of the model. Numerical experiments conducted on the Sioux-Falls and Eastern Massachusetts networks demonstrated that the proposed model achieved robust and high-accuracy estimations across diverse scenarios. In fixed-topology scenarios with random variations in OD demands and link capacities, the proposed model achieved R2 of approximately 0.90. Even in scenarios with random link failures coupled with varying OD demands and capacities, the model maintained R2 of around 0.84. Overall, the proposed methodology represented a significant advancement in solving UE-TAP, particularly in dynamic environments with evolving road network structures.
Citation: Xin Liu, Yuan Zhang, Kai Zhang, Qixiu Cheng, Jiping Xing, Zhiyuan Liu. A scalable learning approach for user equilibrium traffic assignment problem using graph convolutional networks[J]. Electronic Research Archive, 2025, 33(5): 3246-3270. doi: 10.3934/era.2025143
[1] | Haiyan Song, Cuihong Liu, Shengnan Li, Peixiao Zhang . TS-GCN: A novel tumor segmentation method integrating transformer and GCN. Mathematical Biosciences and Engineering, 2023, 20(10): 18173-18190. doi: 10.3934/mbe.2023807 |
[2] | Zia Ud Din, Amir Ali, Zareen A. Khan, Gul Zaman . Heat transfer analysis: convective-radiative moving exponential porous fins with internal heat generation. Mathematical Biosciences and Engineering, 2022, 19(11): 11491-11511. doi: 10.3934/mbe.2022535 |
[3] | Debao Yan . Existence results of fractional differential equations with nonlocal double-integral boundary conditions. Mathematical Biosciences and Engineering, 2023, 20(3): 4437-4454. doi: 10.3934/mbe.2023206 |
[4] | Noura Laksaci, Ahmed Boudaoui, Seham Mahyoub Al-Mekhlafi, Abdon Atangana . Mathematical analysis and numerical simulation for fractal-fractional cancer model. Mathematical Biosciences and Engineering, 2023, 20(10): 18083-18103. doi: 10.3934/mbe.2023803 |
[5] | Ganesh Kumar Thakur, Sudesh Kumar Garg, Tej Singh, M. Syed Ali, Tarun Kumar Arora . Non-fragile synchronization of BAM neural networks with randomly occurring controller gain fluctuation. Mathematical Biosciences and Engineering, 2023, 20(4): 7302-7315. doi: 10.3934/mbe.2023317 |
[6] | Bingrui Zhang, Jin-E Zhang . Fixed-deviation stabilization and synchronization for delayed fractional-order complex-valued neural networks. Mathematical Biosciences and Engineering, 2023, 20(6): 10244-10263. doi: 10.3934/mbe.2023449 |
[7] | Haydar Akca, Chaouki Aouiti, Farid Touati, Changjin Xu . Finite-time passivity of neutral-type complex-valued neural networks with time-varying delays. Mathematical Biosciences and Engineering, 2024, 21(5): 6097-6122. doi: 10.3934/mbe.2024268 |
[8] | Adnan Sami, Amir Ali, Ramsha Shafqat, Nuttapol Pakkaranang, Mati ur Rahmamn . Analysis of food chain mathematical model under fractal fractional Caputo derivative. Mathematical Biosciences and Engineering, 2023, 20(2): 2094-2109. doi: 10.3934/mbe.2023097 |
[9] | Luís P. Castro, Anabela S. Silva . On the solution and Ulam-Hyers-Rassias stability of a Caputo fractional boundary value problem. Mathematical Biosciences and Engineering, 2022, 19(11): 10809-10825. doi: 10.3934/mbe.2022505 |
[10] | Biwen Li, Yujie Liu . Average-delay impulsive control for synchronization of uncertain chaotic neural networks with variable delay impulses. Mathematical Biosciences and Engineering, 2025, 22(6): 1382-1398. doi: 10.3934/mbe.2025052 |
The traffic assignment problem (TAP) is essential to efficient road network operation and significantly influences urban mobility and development. Traditional optimization algorithms typically rely on strict assumptions and iterative optimization methods, making them computationally intensive and inflexible. Deep learning methods, conversely, offer a promising alternative by effectively capturing heterogeneous and nonlinear traffic flow characteristics from diverse datasets. This study introduced a graph convolutional network (GCN)-based framework for the user equilibrium traffic assignment problem (UE-TAP). Specifically, the proposed GCN model learned the implicit relationships between origin-destination (OD) demand matrices and the resulting equilibrium traffic flows, providing efficient and reliable traffic flow estimations without iterative computations. Furthermore, to accommodate variations in network topology, an innovative deep learning approach based on network partitioning and subgraph training was introduced, significantly enhancing the scalability and adaptability of the model. Numerical experiments conducted on the Sioux-Falls and Eastern Massachusetts networks demonstrated that the proposed model achieved robust and high-accuracy estimations across diverse scenarios. In fixed-topology scenarios with random variations in OD demands and link capacities, the proposed model achieved R2 of approximately 0.90. Even in scenarios with random link failures coupled with varying OD demands and capacities, the model maintained R2 of around 0.84. Overall, the proposed methodology represented a significant advancement in solving UE-TAP, particularly in dynamic environments with evolving road network structures.
Neural network dynamics have attracted much attention owing to the wide applications in associative memory [1], signal processing [2], intelligent control [3], and so on. The mainly dynamical behaviours in neural network systems include stability [4,5,6,7,8,9,10], synchronization [11,12], bifurcation [13], chaos [14] and reaction-diffusion[15], which reflect the characteristics of network systems. Fractional calculus has good free space and infinite storage space in many fields, such as artificial neural networks [16], genetic algorithm [17] and image enhancement [18].
Time delay is an interesting phenomenon in network systems, resulting from differences in the efficiency of signal transmission from the point of generation to the point of reception during network transmission, as well as interference from other external factors. Recently, the results with regard to time delay phenomena are extensively reported including leakage time delay[19], discrete time delay[20], distributed time delay[21] and so on. In actual industrial operation, uncertainties in the parameters associated with the model coefficients can arise due to operational errors, incomplete considerations and model construction. Therefore, the models with uncertain parameters will further improve the robustness of systems in [22,23,24].
Synchronization, as one of the typical dynamical behaviours, such as collective recitations, military parades and resonance phenomena, and has become a hot topic [15,22,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43] including Fin-TS [22,26,27,28,29], Fix-TS [22,25,26,30], exponential synchronization[31,32,33,34,35], Mittag-Leffler synchronization[36,37,38], projective synchronization[36,39], quasi-synchronization[40,41], global synchronization[42]. Lin et al. [15] explored the synchronization of directly coupled QDNNs based on pinning control. Li et al. [22] investigated Fin-TS and Fix-TS of Caputo QVNNs by employing feedback and adaptive controllers. Wei et al. [25] studied Fix-TS of QNNs by a pure power-law control design. Kashkynbayev et al. [26] discussed Fin-TS and Fix-TS of DNNs by designing proper control functions. Hu et al.[43] used an adaptive distributed approach at the edge to study the synchronization of spatio-temporal networks. In fact, Fin-TS and Fix-TS are more relevant to realistic control requirements. However, very few research results on Fin-TS and Fix-TS for fractional order NNs are reported except [44,45], where the controller designs for Fix-TS are denoted in fractional order form, then this will undoubtedly increase the difficulty to explore the dynamics of systems.
Inspired by these works, this paper focuses on Fin-TS and Fix-TS issues on Caputo QDNNs with uncertainty. Different from the decomposition method [23,25,35,46], Laplace transform [40,47,52], comparison principle [23,48,49] and linear matrix inequality (LMI) [30,41,50], we apply the quaternion direct method, the Lyapunov stability method and the quaternion inequality method to establish the synchronization criterion for Caputo QDNNs. It is worth noting that a new Caputo differential inequality is constructed, then the fixed time of the positive definite function is estimated. The propoesd method can greatly simplify the complexity of the calculation and solve the complexity of controller design caused by the immaturity of the fractional fixed time stability theory, which is very convenient to derive Fix-TS condition to Caputo QDNNs.
The main innovations and highlights of this paper are presented below.
∙ The model includes the discrete and distributed delays, uncertain term and Caputo derivative operator.
∙ A new Caputo differential inequality is constructed, then the fixed time of the positive definite function is estimated.
∙ Applying quaternion direct method rather than the decomposition method, the algebraic discriminant conditions to achieve Fin-TS and Fix-TS on Caputo QDNNs are proposed.
∙ The control strategies to design the appropriate self feedback and adaptive controllers can effectively reduce the consumption of control costs caused by the time delay term.
In this section, the basic definitions, related lemmas and model introduction are described.
Definition 2.1. Fractional integral of the order μ of k(t) is defined as [51]
t0D−μtk(t)=1Γ(μ)∫tt0(t−l)μ−1k(l)dl. |
Definition 2.2. The Caputo-type fractional-order derivative of the function k(t) is defined as [51]
Ct0Dμtk(t)=1Γ(n−μ)∫tt0(t−l)n−μ−1k(n)(l)dl, |
where t>t0, n=[μ]+1.
Lemma 2.1. If 0<μ<1, α∈R, then [49]
Ct0Dμtkα(t)=Γ(1+α)Γ(1+α−μ)kα−μ(t)Ct0Dμtk(t). |
Lemma 2.2. Let k(t) be a differentiable function over the quaternion field Q, then [22]
Ct0Dμt[¯k(t)k(t)]⩽¯k(t)Ct0Dμtk(t)+[Ct0Dμt¯k(t)]k(t), 0<μ<1. |
Lemma 2.3. Let χ and φ be any constant in the quaternion field Q, for any positive number θ in the real number field R, then [44]
¯χφ+¯φχ⩽θ¯χχ+θ−1¯φφ. |
Lemma 2.4. If ξi⩾0, 0<θ⩽1, γ>1, for i=1,2,⋯,s, then [25]
s∑i=1ξθi⩾(s∑i=1ξ)θ, s∑i=1ξγi⩾s1−γ(s∑i=1ξi)γ. |
Lemma 2.5. Suppose the positive definite function V(t) is a continuously differentiable function on [0,+∞), if there are positive numbers 0<μ<1, λ>0, v⩾1, γ>0, such that [22]
Ct0DμtV(t)⩽−λV−v(t)−γ, |
then when t→¯T, limt→¯TV(t)=0, and for any t⩾¯T, V(t)=0 holds, where
¯T=t0+{Γ(1+μ)λ(1+v)[(V(t0)+(λγ)1v)1+v−(λγ)1+vv]}1μ. |
Lemma 2.6. Suppose k(t) is a continuously differentiable function on [t0,ξ), for any constant ζ on interval [t0,ξ), then [22]
Ct0Dμt[k(t)−ζ]2⩽2[k(t)−ζ]Ct0Dμtk(t), 0<μ<1. |
In this paper, a class of Caputo QDNNs with delays and uncertain coefficients is considered as the drive system
Ct0Dμtkp(t)=−apkp(t)+n∑w=1(bpw+Δbpw(t))gw(kw(t))+n∑w=1(cpw+Δcpw(t))gw(kw(t−τ1(t)))+n∑w=1(dpw+Δdpw(t))∫tt−τ2(t)gw(kw(s))ds+Ip(t), | (2.1) |
where 0<μ<1, kp(t) is the state vector representing the p-th neuron, ap is the self feedback regulation coefficient, gw(⋅) is the activation function, bpw+Δbpw(t), cpw+Δcpw(t) and dpw+Δdpw(t) are connection weights, Δbpw(t), Δcpw(t), Δdpw(t) are the uncertain coefficients, Ip(t) is an external input, τ1(t), τ2(t) are time-varying delays, ap∈R, the other coefficients belong to quaternion field Q.
The response system associated with System (2.1) is
Ct0Dμtop(t)=−apop(t)+n∑w=1(bpw+Δbpw(t))gw(ow(t))+n∑w=1(cpw+Δcpw(t))gw(ow(t−τ1(t)))+n∑w=1(dpw+Δdpw(t))∫tt−τ2(t)gw(oq(s))ds+Ip(t)+Up(t), | (2.2) |
where Up(t)∈Q stands for controller, kp(t0)∈Q and ow(t0)∈Q are the initial conditions of derive-response Systems (2.1) and (2.2).
Let ~ℑp(t)=op(t)−kp(t), then error system of derive-response Systems (2.1) and (2.2) is:
Ct0Dμt~ℑp(t)=−ap~ℑp(t)+n∑w=1(bpw+Δbpw(t))(gw(ow(t))−gw(kw(t)))+n∑w=1(cpw+Δcpw(t))(gw(ow(t−τ1(t)))−gw(kw(t−τ1(t))))+n∑w=1(dpw+Δdpw(t))∫tt−τ2(t)(gw(ow(s))−gw(kw(s)))ds+Up(t), | (2.3) |
then the initial condition to System (2.3) is ~ℑp(t0)=op(t0)−kp(t0).
Throughout this paper, the following assumptions and synchronization definitions are given:
Assumption 2.1. For any ki,oi, there exists a positive number li, such that
|gi(ki)−gi(oi)|⩽li|ki−oi|, i=1,2,...,n, |
where g(⋅)=(g1(⋅),g2(⋅),...,gn(⋅))T∈Qn is the activation function in System (2.1).
Assumption 2.2. For uncertain coefficients Δ(t), Δcpw(t), Δdpw(t), there exist constants ^bpw, ^cpw, ^dpw, such thatΔbpw(t)=ˆbpwαpw(t), Δcpw(t)=ˆcpwβpw(t),Δdpw(t)=ˆdpwωpw(t), where αpw(t),βpw(t), ωpw(t) are uncertain quantities under ¯αpw(t)αpw(t)⩽1, ¯βpw(t)βpw(t)⩽1, ¯ωpw(t)ωpw(t)⩽1.
Definition 2.3. For Systems (2.1) and (2.2), if there exists a positive constant ¯T related to the initial condition, such that limt→¯T||~ℑp(t)||=0, ||~ℑp(t)||=0 holds for any t⩾¯T, then Systems (2.1) and (2.2) are said to reach Fin-TS [22].
Definition 2.4. For Systems (2.1) and (2.2), if there exists a positive constant T independent of the initial condition, such that limt→T||~ℑp(t)||=0, for any t⩾T, ||~ℑp(t)||=0 holds, then Systems (2.1) and (2.2) are said to reach Fix-TS [44].
Remark 2.1. The models with uncertain parameters can further improve the robustness of systems in [22,23,24]. In this paper, the model (2.1) includes the discrete and distributed delays, uncertain term and Caputo derivative operator. Different from the constant time delays in [23,34,47], the time delays in model (2.1) are variable, which can enhance the applicability of the model and enrich the results of Fin-TS and Fix-TS.
In this section, we mainly establish Fin-TS and Fix-TS criteria between Systems (2.1) and (2.2).
Firstly, we construct a Caputo derivative differential inequality to estimate Fix-TS time for the positive definite function V(t).
Theorem 3.1. Let V(t)≜V(t,φ(t)) be a continuously positive definite and radially unbounded function, and V(t,φ(t))=0 if and only if φ(t)=0. If
Ct0DαtV(t)⩽−ξVδ(t)−ηVε(t), | (3.1) |
where 0<ε<α<1, 1<δ<1+α, ξ>0, η>0, then for any t⩾T=t0+T1+T2, the equality V(t)=0 holds, where
T1=[Γ(1−δ)Γ(1+α)−ξΓ(1+α−δ)]1α , T2=[Γ(1−ε)Γ(1+α)ηΓ(1+α−ε)]1α. | (3.2) |
Proof. We first prove that when t⩾t0, there exists a t∗, such that V(t∗)⩽1. Otherwise, for any t⩾t0, V(t)>1. From inequality (3.1), we can get that the following two differential inequalities are simultaneously true
Ct0DαtV(t)⩽−ξVδ(t), Ct0DαtV(t)⩽−ηVε(t). | (3.3) |
Taking the Caputo derivative of order α on t0→t for Vα−δ(t), from Lemma 2.1, then we get
Ct0DαtVα−δ(t)=Γ(1+α−δ)Γ(1−δ)V−δ(t)Ct0DαtV(t)⩾Γ(1+α−δ)Γ(1−δ)V−δ(t)(−ξVδ(t))=−ξΓ(1+α−δ)Γ(1−δ). | (3.4) |
For both sides of inequality (3.4), we take α-order fractional integral on t0→t below
t0D−αtCt0DαtVα−δ(t)⩾t0Iαt(−ξΓ(1+α−δ)Γ(1−δ)). | (3.5) |
Then, we have
Vα−δ(t)−Vα−δ(t0)⩾−ξΓ(1+α−δ)Γ(1−δ)1Γ(α+1)(t−t0)α, | (3.6) |
(1V(t))δ−α⩾Vα−δ(t0)+−ξΓ(1+α−δ)Γ(1−δ)Γ(1+α)(t−t0)α, | (3.7) |
V(t)⩽[1Vα−δ(t0)+−ξΓ(1+α−δ)Γ(1−δ)Γ(1+α)(t−t0)α]1δ−α. | (3.8) |
From inequality (3.8), we know that V(t) is monotonically decreasing. Take
t∗=t0+[Vδ−α(t0)−1−ξΓ(1+α−δ)Γ(1−δ)Γ(1+α)Vδ−α(t0)]1α, |
then the inequality V(t∗)⩽1 holds. Let
T1=t0+[Γ(1−δ)Γ(1+α)−ξΓ(1+α−δ)]1α, |
thus we have T1>t∗. Similarly, we can also get
Ct0DαtVα−ε(t)=Γ(1+α−ε)Γ(1−ε)V−ε(t)Ct0DαtV(t)⩽−ηΓ(1+α−ε)Γ(1−ε), | (3.9) |
V(t)⩽[Vα−ε(t∗)−ηΓ(1+α−ε)Γ(1−ε)Γ(1+α)(t−t∗)α]1α−ε⩽[1−ηΓ(1+α−ε)Γ(1−ε)Γ(1+α)(t−t∗)α]1α−ε. | (3.10) |
Let
T2=[Γ(1−ε)Γ(1+α)ηΓ(1+α−ε)]1α, |
when t=t∗+T2, then the right hand side of inequality (3.10) is equal to 0. Furthermore, we can get that V(t)⩽0 when t=t∗+T2. Since V(t) is a positive definite function, when t=t∗+T2, V(t)≡0. Let t=t0+T1+T2, then we can get V(t)=0 holds. When t⩾t0+T1+T2, we have φ(t)=0, and the settling time is estimated as T.
Remark 3.1. Recently, many synchronization results have been reported in [15,22,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43] including Fin-TS [22,26], Fix-TS [22,25,26], exponential synchronization[31,32,33,34,35], Mittag-Leffler synchronization[36,37,38], projective synchronization[36,39] and quasi-synchronization[40,41]. In Theorem 3.1, a new Caputo differential inequality is constructed, then the fixed time of the positive definite function is estimated, which is very convenient to derive Fix-TS conditions between Systems (2.1) and (2.2).
To achieve Fin-TS between Systems (2.1) and (2.2), the self feedback controller is designed
{Up(t)=ψp(t)+ϕp(t),ψp(t)=−αp~ℑp(t),ϕp(t)=−δ~ℑp(t)|~ℑp(t)|2−σ~ℑp(t)|~ℑp(t)|2ε, | (3.11) |
where ε⩾2,αp,δ and σ are positive constants.
Theorem 3.2. Under Assumptions 2.1, 2.2 and controller (3.11), if there exist positive constants h>1 and r>1, such that
2nlp2+n∑w=1(Ω+Π+Ψ)−2ap−2αp+2nl′p2h+2nl″p2r⩽0, | (3.12) |
then Systems (2.1) and (2.2) can achieve Fin-TS, and the settling time of Systems (2.1) and (2.2) is
¯T=t0+{Γ(1+μ)2σnεε[(V(t0)+n(σδ)1ε−1)ε−nε(σδ)εε−1]}1μ, | (3.13) |
whereΩ=|bpw|2+^|bpw|2, Π=|cpw|2+^|cpw|2, Ψ=|dpw|2+^|dpw|2, lp,l′p and l″p are Lipschitz coefficients.
Proof. Choosing the following Lyapunov function
V1(t)=n∑p=1¯~ℑp(t)~ℑp(t). | (3.14) |
From Lemma 2.2, we have
Ct0DμtV1(t)⩽n∑p=1[¯~ℑp(t)Ct0Dμt~ℑp(t)+(Ct0Dμt¯~ℑp(t))~ℑp(t)]=n∑p=1¯~ℑp(t)[−ap~ℑp(t)+n∑w=1(bpw+Δbpw(t))(gw(ow(t))−gw(kw(t)))]+n∑p=1¯~ℑp(t)[n∑w=1(cpw+Δcpw(t))(gw(ow(t−τ1(t)))−gw(kw(t−τ1(t))))]+n∑p=1¯~ℑp(t)[n∑w=1(dpw+Δdpw(t))∫tt−τ2(t)(gw(ow(s))−gw(kw(s)))ds+Up(t)]+n∑p=1[−ap¯~ℑp(t)+n∑w=1¯(gw(ow(t))−gw(kw(t)))(¯bpw+¯Δbpw(t))]~ℑp(t)+n∑p=1[n∑w=1¯(gw(ow(t−τ1(t)))−gw(kw(t−τ1(t))))(¯cpw+¯Δcpw(t))]~ℑp(t)+n∑p=1[n∑w=1∫tt−τ2(t)¯(gw(ow(s))−gw(kw(s)))ds(¯dpw+¯Δdpw(t))+¯Up(t)]~ℑp(t). | (3.15) |
By computation, we further get
Ct0DμtV1(t)⩽n∑p=1[−2ap¯~ℑp(t)~ℑp(t)+¯~ℑp(t)Up(t)+¯Up(t)~ℑp(t)]+n∑p=1n∑w=1¯~ℑp(t)bpw(gw(ow(t))−gw(kw(t)))+n∑p=1n∑w=1¯(gw(ow(t))−gw(kw(t)))¯bpw~ℑp(t)+n∑p=1n∑w=1¯~ℑp(t)Δbpw(t)(gw(ow(t))−gw(kw(t)))+n∑p=1n∑w=1¯(gw(ow(t))−gw(kw(t)))¯Δbpw(t)~ℑp(t)+n∑p=1n∑w=1¯~ℑp(t)cpw(gw(ow(t−τ1(t)))−gw(kw(t−τ1(t))))+n∑p=1n∑w=1¯(gw(ow(t−τ1(t)))−gw(kw(t−τ1(t))))¯cpw~ℑp(t)+n∑p=1n∑w=1¯~ℑp(t)Δcpw(t)(gw(ow(t−τ1(t)))−gw(kw(t−τ1(t))))+n∑p=1n∑w=1¯(gw(ow(t−τ1(t)))−gw(kw(t−τ1(t))))¯Δcpw(t)~ℑp(t)+n∑p=1n∑w=1¯~ℑp(t)dpw∫tt−τ2(t)(gw(ow(s))−gw(kw(s)))ds+n∑p=1n∑w=1∫tt−τ2(t)¯(gw(ow(s))−gw(kq(s)))ds¯dpw~ℑp(t)+n∑p=1n∑w=1¯~ℑp(t)Δdpw(t)∫tt−τ2(t)(gw(ow(s))−gw(kw(s)))ds+n∑p=1n∑w=1∫tt−τ2(t)¯(gw(ow(s))−gw(kw(s)))ds¯Δdpw(t)~ℑp(t). | (3.16) |
According to controller (3.11), we have
n∑p=1[¯~ℑp(t)Up(t)+¯Up(t)~ℑp(t)]=n∑p=1¯~ℑp(t)[−αp~ℑp(t)−δ~ℑp(t)|~ℑp(t)|2−σ~ℑp(t)|~ℑp(t)|2ε]+n∑p=1[−αp¯~ℑp(t)−δ¯~ℑp(t)|~ℑp(t)|2−σ¯~ℑp(t)|~ℑp(t)|2ε]~ℑp(t)⩽n∑p=1[−2αp¯~ℑp(t)~ℑp(t)−2σ(¯~ℑp(t)~ℑp(t))1−ε−2δ]. | (3.17) |
In terms of Lemma 2.3, Assumptions 2.1 and 2.2, we have
n∑p=1n∑w=1¯~ℑp(t)bpw(gw(ow(t))−gw(kw(t)))+n∑p=1n∑w=1¯(gw(ow(t))−gw(kw(t)))¯bpw~ℑp(t)⩽n∑p=1n∑w=1|bpw|2¯~ℑp(t)~ℑp(t)+n∑p=1n∑w=1l2w¯~ℑp(t)~ℑp(t)⩽n∑p=1n∑w=1|bpw|2¯~ℑp(t)~ℑp(t)+nn∑p=1l2w¯~ℑp(t)~ℑp(t). | (3.18) |
Similarly, we can get
n∑p=1n∑w=1¯~ℑp(t)Δbpw(t)(gw(ow(t))−gw(kw(t)))+n∑p=1n∑w=1¯(gw(ow(t))−gw(kw(t)))¯Δbpw(t)~ℑp(t)+n∑p=1n∑w=1¯~ℑp(t)cpw(gw(ow(t−τ1(t)))−gw(kw(t−τ1(t))))+n∑p=1n∑w=1¯(gw(ow(t−τ1(t)))−gw(kw(t−τ1(t))))¯cpw~ℑp(t)+n∑p=1n∑w=1¯~ℑp(t)Δcpw(t)(gw(ow(t−τ1(t)))−gw(kw(t−τ1(t))))+n∑p=1n∑w=1¯(gw(ow(t−τ1(t)))−gw(kw(t−τ1(t))))¯Δcpw(t)~ℑp(t)+n∑p=1n∑w=1¯~ℑp(t)dpw∫tt−τ2(t)(gw(ow(s))−gw(kw(s)))ds+n∑p=1n∑w=1∫tt−τ2(t)¯(gw(ow(s))−gw(kw(s)))ds¯dpw~ℑp(t)+n∑p=1n∑w=1¯~ℑp(t)Δdpw(t)∫tt−τ2(t)(gw(ow(s))−gw(kw(s)))ds+n∑p=1n∑w=1∫tt−τ2(t)¯(gw(ow(s))−gw(ow(s)))ds¯Δdpw(t)~ℑp(t)⩽n∑p=1[nl2p+n∑w=1^|bpw|2+n∑w=1(|cpw|2+^|cpw|2)+n∑w=1(|dpw|2+^|dpw|2)]¯~ℑp(t)~ℑp(t)+2nn∑p=1l′p2¯~ℑp(t−τ1(t))~ℑp(t−τ1(t))+2nτ22(t)n∑p=1l″p2supt−τ2(t)⩽l⩽t|~ℑp(l)|2. | (3.19) |
Substituting (3.17)–(3.19) to (3.16), we can get
Ct0DμtV1(t)⩽n∑p=1[2nl2p+n∑w=1(Ω+Π+Ψ)−2ap−2αp]¯~ℑp(t)~ℑp(t)+n∑p=12nl′p2¯~ℑp(t−τ1(t))~ℑp(t−τ1(t))+n∑p=12nl″p2τ22(t)supt−τ2(t)⩽l⩽t|~ℑp(l)|2−2σn∑p=1(¯~ℑp(t)~ℑp(t))1−ε−2δn, | (3.20) |
where Ω=|bpw|2+^|bpw|2, Π=|cpw|2+^|cpw|2, Ψ=|dpw|2+^|dpw|2. From (3.12), Lemma 2.4, fractional-order Razumikhin theorem and Jensen Inequality, there exist h>1 and r>1, such that
Ct0DμtV1(t)⩽n∑p=1[2nl2p+n∑w=1(Ω+Π+Ψ)−2ap−2αp]¯~ℑp(t)~ℑp(t)+n∑p=12nl′p2h¯~ℑp(t)~ℑp(t)+n∑p=12nl″p2r¯~ℑp(t)~ℑp(t)−2σn∑p=1(¯~ℑp(t)~ℑp(t))1−ε−2δn⩽n∑p=1[2nl2p+n∑w=1(Ω+Π+Ψ)−2ap−2αp+2nl′p2h+2nl″p2r]¯~ℑp(t)~ℑp(t)−2σnε(n∑p=1¯~ℑp(t)~ℑp(t))1−ε−2δn⩽−2σnεV−(ε−1)1(t)−2δn. | (3.21) |
According to Lemma 2.5, Systems (2.1) and (2.2) can realize Fin-TS under controller (3.11), and the settling time of Systems (2.1) and (2.2) is estimated as
¯T=t0+{Γ(1+μ)2σnεε[(V(t0)+n(σδ)1ε−1)ε−nε(σδ)εε−1]}1μ. | (3.22) |
Therefore, when t⩾¯T, we have ||~ℑp(t)||=0, then Systems (2.1) and (2.2) can realize Fin-TS under controller (3.11).
In order to realize Fix-TS of Systems (2.1) and (2.2), the following adaptive controller is designed
{Up(t)=Ξp(t)+Hp(t),Ξp(t)=−σp(t)~ℑp(t),Hp(t)=−k1p~ℑp(t)(¯~ℑp(t)~ℑp(t))δ−k2p~ℑp(t)(¯~ℑp(t)~ℑp(t))ε, | (3.23) |
where −μ<δ<0, 1−μ<ε<1,k1p>0,k2p>0, and σp(t) is the adaptive control gain satisfying
Ct0Dμtσp(t)=¯~ℑp(t)~ℑp(t)−Sp[sign(σp(t)−σ∗p)]|σp(t)−σ∗p|1−2δ−Rp[sign(σp(t)−σ∗p)]|σp(t)−σ∗p|1−2ε. | (3.24) |
Theorem 3.3. Under Assumptions 2.1, 2.2 and controller (3.23), if there exist positive constants h>1 and r>1, such that
nlp2+12n∑w=1(Ω+Π+Ψ)−ap+nl′p2h+nl″p2r⩽σ∗p, | (3.25) |
then Systems (2.1) and (2.2) can realize Fix-TS, and the settling time of Systems (2.1) and (2.2) is
T=t0+[Γ(δ)Γ(1+μ)−(2n)δH1Γ(μ+δ)]1μ+[Γ(ε)Γ(1+μ)H2Γ(μ+ε)]1μ, | (3.26) |
where lp,l′p and l″p are Lipschitz coefficients.
Proof. Take into account the following Lyapunov function
V2(t)=n∑p=1λp¯~ℑp(t)~ℑp(t)+n∑p=1λp[σp(t)−σ∗p]2. | (3.27) |
Similar to the proof Theorem 3.2, by Lemma 2.6 we have
Ct0DμtV2(t)⩽n∑p=1λp[2nl2p+n∑w=1(Ω+Π+Ψ)−2ap−2σp(t)]¯~ℑp(t)~ℑp(t)+n∑p=12nλpl′p2¯~ℑp(t−τ1(t))~ℑp(t−τ1(t))+n∑p=12nλpl″p2τ2(t)supt−τ2(t)⩽l⩽t|~ℑp(l)|2−2k1pn∑p=1λp(¯~ℑp(t)~ℑp(t))1−δ−2k2pn∑p=1λp(¯~ℑp(t)~ℑp(t))1−ε+n∑p=1λp2(σp(t)−σ∗p)Ct0Dμtσp(t). | (3.28) |
Under adaptive controller (3.23), we have
Ct0DμtV2(t)⩽n∑p=1λp[2nl2p+n∑w=1(Ω+Π+Ψ)−2ap−2σ∗p]¯~ℑp(t)~ℑp(t)+n∑p=12nλpl′p2¯~ℑp(t−τ1(t))~ℑp(t−τ1(t))+n∑p=12nλpl″p2τ2(t)supt−τ2(t)⩽l⩽t|~ℑp(l)|2−2k1pn∑p=1λp(¯~ℑp(t)~ℑp(t))1−δ−n∑p=12λpSp((σp(t)−σ∗p)2)1−δ−2k2pn∑p=1λp(¯~ℑp(t)~ℑp(t))1−ε−n∑p=12λpRp((σp(t)−σ∗p)2)1−ε. | (3.29) |
By fractional-order Razumikhin theorem, there are h>1,r>1, The following formula holds:
Ct0DμtV2(t)⩽n∑p=1λp[2nl2p+n∑w=1(Ω+Π+Ψ)−2ap−2σ∗p+2nl′p2h+2nl″p2r]¯~ℑp(t)~ℑp(t)−2k1pn∑p=1λp(¯~ℑp(t)~ℑp(t))1−δ−n∑p=12λpSp((σp(t)−σ∗p)2)1−δ−2k2pn∑p=1λp(¯~ℑp(t)~ℑp(t))1−ε−n∑p=12λpRp((σp(t)−σ∗p)2)1−ε. | (3.30) |
An application of Lemma 2.4 yields that
n∑p=12k1pλp(¯~ℑp(t)~ℑp(t))1−δ+n∑p=12Spλp((σp(t)−σ∗p)2)1−δ=n∑p=12k1pλδp(λp¯~ℑp(t)~ℑp(t))1−δ+n∑p=12Spλδp(λp(σp(t)−σ∗p)2)1−δ⩾H1[n∑p=1(λp¯~ℑp(t)~ℑp(t))1−δ+n∑p=1(λp(σp(t)−σ∗p)2)1−δ]⩾2δH1[n∑p=1[λp¯~ℑp(t)~ℑp(t)+λp(σp(t)−σ∗p)2]1−δ]⩾(2n)δH1[n∑p=1[λp¯~ℑp(t)~ℑp(t)+λp(σp(t)−σ∗p)2]]1−δ=(2n)δH1V1−δ2(t). | (3.31) |
Similarly, one can get
n∑p=12k2pλp(¯~ℑp(t)~ℑp(t))1−ε+n∑p=12Rpλp((σp(t)−σ∗p)2)1−ε⩾H2[n∑p=1(λp¯~ℑp(t)~ℑp(t))1−ε+n∑p=1(λp(σp(t)−σ∗p)2)]⩾H2n∑p=1[λp¯~ℑp(t)~ℑp(t)+λp(σp(t)−σ∗p)2]1−ε⩾H2[n∑p=1[λp¯~ℑp(t)~ℑp(t)+λp(σp(t)−σ∗p)2]]1−ε=H2V1−ε2(t), | (3.32) |
where H1=min1⩽p⩽n{2k1pλδp,2Spλδp},H2=min1⩽p⩽n{2k2pλεp,2Rpλεp}. Substituting (3.31) and (3.32) to (3.30), from (3.25), we have
Ct0DμtV2(t)⩽−(2n)δH1V1−δ2(t)−H2V1−ε2(t). | (3.33) |
According to Theorem 3.1, Systems (2.1) and (2.2) can achieve Fix-TS under controller (3.23), and the settling time is estimated as
T=t0+[Γ(δ)Γ(1+μ)−(2n)δH1Γ(μ+δ)]1μ+[Γ(ε)Γ(1+μ)H2Γ(μ+ε)]1μ. | (3.34) |
Therefore, when t⩾T, we have limt→T||~ℑp(t)||=0. Thus, Systems (2.1) and (2.2) can realize Fix-TS under controller (3.23).
Remark 3.2. Different from other synchronization controller designs such as exponential synchronization [31,32,33,34,35], quasi-synchronization [40,41] and global synchronization [42], the Fin-TS and Fix-TS controllers (3.11) and (3.23) are designed in two steps including the synchronization control term and stability control term, which can greatly improve the performance of the controller, enhance the operability and system stability, and also allow the synchronization term gain and stability term gain to be adjusted.
Remark 3.3. In contrast to the decomposition method [46], Laplace transform [47], comparison principle [48,49] and linear matrix inequality (LMI) [50], the algebraic condition (3.12) in Theorem 3.2 is proposed to realize Fin-TS based on the quaternion direct method, Lyapunov stability theory, extended Cauchy Schwartz inequality and Jensen inequality.
In this section, two numerical examples are given to verify the correctness and validity of Theorems 3.1–3.3 under the different derivative orders.
Consider the following Caputo QDNN model:
Ct0Dμtkp(t)=−apkp(t)+2∑w=1(bpw+Δbpw(t))gw(kw(t))+2∑w=1(cpw+Δcpw(t))gw(kw(t−τ1(t)))+2∑w=1(dpw+Δdpw(t))∫tt−τ2(t)gw(kw(s))ds+Ip(t), p=1,2, | (4.1) |
where
μ=0.73, τ1(t)=0.5+0.5|sin(t)|, τ2(t)=0.5+0.5|cos(t)|, I1(t)=I2(t)=0, |
gw(kw(t))=tanh(kRw(t))+itanh(kIw(t))+jtanh(kJw(t))+ktanh(kKw(t)), |
kp(t)=kRp(t)+ikIp(t)+jkJp(t)+kkKp(t)∈Q, |
A=(1001), B=(0.1+0.5i+0.8j+0.1k0.2−0.2i+0.2j−0.2k0.1+0.1i−0.1j+0.1k0.1+0.3i−0.1j+0.2k)+(0.4(sint+isint−jsint−ksint)0.4(cost+icost+jcost+kcost)0.4(cost+icost+jcost+ksint)0.4(sint+isint+jsint+ksint)),C=(0.3+0.3i+0.2j+0.2k0.1−0.2i+0.1j+0.2k0.1+0.1i+0.1k0.6+0.6j+0.2k)+(0.4(cost+icost−jsint−ksint)0.4(sint+icost+jcost−ksint)0.4(cost+isint+jsint+ksint)0.4(cost−icost−jcost+ksint)),D=(0.1+0.1i+0.1j+0.1k0.3+0.1i+0.2j+0.2k0.1+0.1i+0.1j+0.1k0.3+0.1i+0.3j−0.2k)+(0.4(sint+isint+jsint+ksint)0.4(cost+icost+jcost+kcost)0.4(sint+icost+jsint+kcost)0.4(−cost−isint−jsint+kcost)). |
The response system is
Ct0Dμtop(t)=−apop(t)+2∑w=1(bpw+Δbpw(t))gw(ow(t))+2∑w=1(cpw+Δcpw(t))gw(ow(t−τ1(t)))+2∑w=1(dpw+Δdpw(t))∫tt−τ2(t)gw(ow(s))ds+Ip(t)+Up(t), p=1,2, | (4.2) |
where op(t)=oRp(t)+IoIp(t)+JoJp(t)+KoKp(t)∈Q. The initial conditions of Systems (4.1) and (4.2) are chosen as
k1(0)=0.1+0.4i+0.3j+0.6k, k2(0)=−0.1−0.1i−0.4j+0.2k,w1(0)=−0.1−0.4i−0.3j−0.6k, w2(0)=0.1+0.1i+0.4j−0.2k. |
Example 4.1. To realize Fin-TS of Systems (4.1) and (4.2), for the self feedback controller (3.11), the following control gains are taken as δ=0.9, σ=0.1, ε=2.1, h=r=1.5, lp=l′p=l″p=1. By calculation, we can get
9.8=α1⩾2l21+0.5(|b11|2+|^b11|2+|b12|2+|^b12|2+|c11|2+|^c11|2+|c12|2+|^c12|2+|d11|2+|^d11|2+|d12|2+|^d12|2)−a1+2l′12h+2l″12r=9.7450, |
9.6=α2⩾2l22+0.5(|b21|2+|^b21|2+|b22|2+|^b22|2+|c21|2+|^c21|2+|c22|2+|^c22|2+|d21|2+|^d21|2+|d22|2+|^d22|2)−a2+2l′22h+2l″22r=9.5500. |
From Theorem 3.2, the settling time can be estimated as ¯T≈4.5123. Figure 1 shows the state trajectories of derive-response Systems (4.1) and (4.2) without controller. Figures 2 and 3 describe Fin-TS trajectories and error norm of Systems (4.1) and (4.2) under controller (3.11) when the order is 0.73. Figures 4 and 5 depict Fin-TS trajectories and error norm of Systems (4.1) and (4.2) under controller (3.11) when the derivative order is 0.53. Figures 2–5 reveal that the numerical simulations are consistent with Theorem 3.2.
Example 4.2. To realize Fix-TS between Systems (4.1) and (4.2), an adaptive controller (3.20) is designed based on Theorem 3.1. Taking
k11=k12=0.1, k21=k22=0.3, δ=−0.31, r=h=1.5,ε=0.9, λp=Rp=Sp=1, σ∗1=σ∗2=10.0, H1=0.2,H2=0.6, |
the other model parameters are consistent with Example 4.1. By computation, the conditions of Theorem 3.3 are satisfied. The settling time can be estimated as T≈5.2198. Figures 6 and 7 show Fix-TS trajectories and error norm of Systems (4.1) and (4.2) under controller (3.23) when the order is 0.73. Figures 8 and 9 characterize Fix-TS trajectories and error norm of Systems (4.1) and (4.2) under controller (3.23) when the derivative order is 0.53. Figures 6–9 verify that the numerical simulations are coincident with Theorems 3.1 and 3.3.
Remark 4.1. Figures 10 and 11 depict the relationship between the settling time ¯T of Fin-TS with the order μ and the parameters σ, δ and ε. Figures 12 and 13 illustrate the relationship between the settling time T of Fix-TS with the order μ and the parameters δ, ε. For Fin-TS, it can be observed from Figures 10 and 11 that the settling time is positively correlated with σ, ε and negatively correlated with δ, μ. For Fix-TS the settling time is positively correlated with δ and negatively correlated with ε, μ. Therefore, the settling time of synchronisation is closely related to the order of the equation, regardless of whether it is Fin-TS or Fix-TS.
This paper has investigated Fin-TS and Fix-TS issues for derive-response Systems (2.1) and (2.2). Firstly, a new Caputo fractional differential inequality (3.1) is constructed, then Fix-TS settling time of the positive definite function V(t) is estimated, which is very convenient to derive Fix-TS condition to Systems (2.1) and (2.2). By designing the appropriate self feedback controller (3.11) and adaptive controller (3.23), the algebraic discriminant conditions (3.12) and (3.25) to achieve Fin-TS and Fix-TS on Systems (2.1) and (2.2) are established in terms of quaternion direct method, Lyapunov stability theory, extended Cauchy Schwartz inequality, Jensen inequality. Finally, the correctness and validity of Theorems 3.1–3.3 under the orders μ=0.53 and μ=0.73 are verified by two numerical examples. The dynamics of QDNNs models including impulsive effect and multiple time delays will be our next research issue.
This work was supported by the Natural Science Foundation of Anhui Province of China (No. 1908085MA01) and Research on green prevention and control of tea diseases and insect pests and automatic processing technology based on 5G network (No. 200118).
The authors declare that they have no conflict of interest.
[1] |
J. Xing, R. Liu, K. Anish, Z. Liu, A customized data fusion tensor approach for interval-wise missing network volume imputation, IEEE Trans. Intell. Transp. Syst., 24 (2023), 12107–12122. https://doi.org/10.1109/TITS.2023.3289193. doi: 10.1109/TITS.2023.3289193
![]() |
[2] | J. Xing, R. Liu, Y. Zhang, C. F. Choudhury, X. Fu, Q. Cheng, Urban network-wide traffic volume estimation under sparse deployment of detectors, Transportmetrica A: Transp. Sci., 20 (2024). https://doi.org/10.1080/23249935.2023.2197511. |
[3] |
J. Xing, W. Wu, Q. Cheng, R. Liu, Traffic state estimation of urban road networks by multi-source data fusion: Review and new insights, Physica A Stat. Mech. Appl., 595 (2022), 127079. https://doi.org/10.1016/j.physa.2022.127079. doi: 10.1016/j.physa.2022.127079
![]() |
[4] |
Y. Jiang, O. A. Nielsen, Urban multimodal traffic assignment, Multimodal Transp., 1 (2022), 100027. https://doi.org/10.1016/j.multra.2022.100027. doi: 10.1016/j.multra.2022.100027
![]() |
[5] |
D. Huang, J. Zhang, Z. Liu, A robust coordinated charging scheduling approach for hybrid electric bus charging systems, Transp. Res. Part D: Transp. Environ., 125 (2023), 103955. https://doi.org/10.1016/j.trd.2023.103955. doi: 10.1016/j.trd.2023.103955
![]() |
[6] |
Z. Zhou, Z. Gu, X. Qu, P. Liu, Z. Liu, W. Yu, Urban mobility foundation model: A literature review and hierarchical perspective, Transp. Res. Part E: Logist. Transp. Rev., 192 (2024), 103795. https://doi.org/10.1016/j.tre.2024.103795. doi: 10.1016/j.tre.2024.103795
![]() |
[7] |
J. Huo, Z. Liu, J. Chen, Q. Cheng, Q. Meng, Bayesian optimization for congestion pricing problems: A general framework and its instability, Transp. Res. Part B: Methodol., 169 (2023), 1–28. https://doi.org/10.1016/j.trb.2023.01.003. doi: 10.1016/j.trb.2023.01.003
![]() |
[8] |
D. Huang, Y. Gu, S. Wang, Z. Liu, W. Zhang, A two-phase optimization model for the demand-responsive customized bus network design, Transp. Res. Part C: Emerg. Technol., 111 (2020), 1–21. https://doi.org/10.1016/j.trc.2019.12.004. doi: 10.1016/j.trc.2019.12.004
![]() |
[9] | D. Wang, F. X. Liao, Formulation and solution for calibrating boundedly rational activity-travel assignment: An exploratory study, Commun. Transp. Res., 3 (2023). https://doi.org/10.1016/j.commtr.2023.100092. |
[10] |
C. Liu, Z. Wang, Z. Liu, K. Huang, Multi-agent reinforcement learning framework for addressing demand-supply imbalance of shared autonomous electric vehicle, Transp. Res. Part E: Logist. Transp. Rev., 197 (2025), 104062. https://doi.org/10.1016/j.tre.2025.104062. doi: 10.1016/j.tre.2025.104062
![]() |
[11] |
D. Huang, Z. Liu, P. Liu, J. Chen, Optimal transit fare and service frequency of a nonlinear origin-destination based fare structure, Transp. Res. Part E: Logist. Transp. Rev., 96 (2016), 1–19. https://doi.org/10.1016/j.tre.2016.10.004. doi: 10.1016/j.tre.2016.10.004
![]() |
[12] |
Z. Gu, Y. Li, M. Saberi, T. H. Rashidi, Z. Liu, Macroscopic parking dynamics and equitable pricing: Integrating trip-based modeling with simulation-based robust optimization, Transp. Res. Part B: Methodol., 173 (2023), 354–381. https://doi.org/10.1016/j.trb.2023.05.011. doi: 10.1016/j.trb.2023.05.011
![]() |
[13] |
Z. Liu, X. Chen, Q. Meng, I. Kim, Remote park-and-ride network equilibrium model and its applications, Transp. Res. Part B: Methodol., 117 (2018), 37–62. https://doi.org/10.1016/j.trb.2018.08.004. doi: 10.1016/j.trb.2018.08.004
![]() |
[14] | Y. Gu, A. Chen, S. Jang, S. Kitthamkesorn, A binary choice model for adoption of an emerging travel mode with unique service features, Commun. Transp. Res., 4 (2024). https://doi.org/10.1016/j.commtr.2024.100121. |
[15] | J. G. Wardrop, Road paper. some theoretical aspects of road traffic research, 1 (1952), 325–362. https://doi.org/10.1680/ipeds.1952.11259. |
[16] | M. Beckmann, C. B. McGuire, C. B. Winsten, Studies in the Economics of Transportation, 1956. |
[17] |
M. Frank, P. Wolfe, An algorithm for quadratic programming, Naval Res. Logist. Q., 3 (1956), 95–110. https://doi.org/10.1002/nav.3800030109. doi: 10.1002/nav.3800030109
![]() |
[18] |
M. Florian, J. Guálat, H. Spiess, An efficient implementation of the "Partan" variant of the linear approximation method for the network equilibrium problem, Networks, 17 (1987), 319–339. https://doi.org/10.1002/net.3230170307. doi: 10.1002/net.3230170307
![]() |
[19] |
S. Lawphongpanich, D. W. Hearn, Simplical decomposition of the asymmetric traffic assignment problem, Transp. Res. Part B: Methodol., 18 (1984), 123–133. https://doi.org/10.1016/0191-2615(84)90026-2. doi: 10.1016/0191-2615(84)90026-2
![]() |
[20] |
M. Mitradjieva, P. O. Lindberg, The stiff is moving—conjugate direction Frank-Wolfe Methods with applications to traffic assignment, Transp. Sci., 47 (2013), 280–293. https://doi.org/10.1287/trsc.1120.0409. doi: 10.1287/trsc.1120.0409
![]() |
[21] |
H. Bar-Gera, Origin-based algorithm for the traffic assignment problem, Transp. Sci., 36 (2002), 398–417. https://doi.org/10.1287/trsc.36.4.398.549. doi: 10.1287/trsc.36.4.398.549
![]() |
[22] |
Y. M. Nie, A class of bush-based algorithms for the traffic assignment problem, Transp. Res. Part B: Methodol., 44 (2010), 73–89. https://doi.org/10.1016/j.trb.2009.06.005. doi: 10.1016/j.trb.2009.06.005
![]() |
[23] | J. Xie, C. Xie, Origin-based algorithms for traffic assignment: algorithmic structure, complexity analysis, and convergence performance, Transp. Res. Rec., 2498 (2015), 46–55. https://doi.org/10.3141/2498-06. |
[24] | R. Jayakrishnan, W. T. Tsai, J. N. Prashker, S. Rajadhyaksha, A faster path-based algorithm for traffic assignment, in Transportation Research Board 73rd Annual Meeting, 1994. |
[25] |
T. Larsson, M. Patriksson, Simplicial decomposition with disaggregated representation for the traffic assignment problem, Transp. Sci., 26 (1992), 4–17. https://doi.org/10.1287/trsc.26.1.4. doi: 10.1287/trsc.26.1.4
![]() |
[26] |
J. Xie, Y. Nie, X. Liu, A greedy path-based algorithm for traffic assignment, Transp. Res. Rec., 2672 (2018), 36–44. https://doi.org/10.1177/0361198118774236. doi: 10.1177/0361198118774236
![]() |
[27] |
K. Zhang, H. Zhang, Y. Dong, Y. Wu, X. Chen, An ADMM-based parallel algorithm for solving traffic assignment problem with elastic demand, Commun. Transp. Res., 3 (2023), 100108. https://doi.org/10.1016/j.commtr.2023.100108. doi: 10.1016/j.commtr.2023.100108
![]() |
[28] |
K. Zhang, H. Zhang, Q. Cheng, X. Chen, Z. Wang, Z. Liu, A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem, Comput. Oper. Res., 154 (2023), 106193. https://doi.org/10.1016/j.cor.2023.106193. doi: 10.1016/j.cor.2023.106193
![]() |
[29] |
X. Chen, Z. Liu, K. Zhang, Z. Wang, A parallel computing approach to solve traffic assignment using path-based gradient projection algorithm, Transp. Res. Part C: Emerg. Technol., 120 (2020), 102809. https://doi.org/10.1016/j.trc.2020.102809. doi: 10.1016/j.trc.2020.102809
![]() |
[30] |
H. Zhang, Z. Liu, J. Wang, Y. Wu, A novel flow update policy in solving traffic assignment problems: Successive over relaxation iteration method, Transp. Res. Part E: Logist. Transp. Rev., 174 (2023), 103111. https://doi.org/10.1016/j.tre.2023.103111. doi: 10.1016/j.tre.2023.103111
![]() |
[31] |
Z. Liu, X. Chen, J. Hu, S. Wang, K. Zhang, H. Zhang, An alternating direction method of multipliers for solving user equilibrium problem, Eur. J. Oper. Res., 310 (2023), 1072–1084. https://doi.org/10.1016/j.ejor.2023.04.008. doi: 10.1016/j.ejor.2023.04.008
![]() |
[32] |
M. Veres, M. Moussa, Deep learning for intelligent transportation systems: A survey of emerging trends, IEEE Trans. Intell. Transp. Syst., 21 (2019), 3152–3168. https://doi.org/10.1109/TITS.2019.2929020. doi: 10.1109/TITS.2019.2929020
![]() |
[33] |
H. Nguyen, L. M. Kieu, T. Wen, C. Cai, Deep learning methods in transportation domain: a review, IET Intell. Transp. Syst., 12 (2018), 998–1004. https://doi.org/10.1049/iet-its.2018.0064. doi: 10.1049/iet-its.2018.0064
![]() |
[34] |
Z. Zhao, W. Chen, X. Wu, P. C. Chen, J. Liu, LSTM network: a deep learning approach for short‐term traffic forecast, IET Intell. Transp. Syst., 11 (2017), 68–75. https://doi.org/10.1049/iet-its.2016.0208. doi: 10.1049/iet-its.2016.0208
![]() |
[35] |
Y. Lv, Y. Duan, W. Kang, Z. Li, F. Y. Wang, Traffic flow prediction with big data: A deep learning approach, IEEE Trans. Intell. Transp. Syst., 16 (2014), 865–873. https://doi.org/10.1109/TITS.2014.2345663. doi: 10.1109/TITS.2014.2345663
![]() |
[36] | J. Xing, X. Jiang, Y. Yuan, W. Liu, Incorporating mobile phone data-based travel mobility analysis of metro ridership in aboveground and underground layers, Electron. Res. Arch., 32 (2024). https://doi.org/10.3934/era.2024202. |
[37] |
A. Nigam, S. Srivastava, Hybrid deep learning models for traffic stream variables prediction during rainfall, Multimodal Transp., 2 (2023), 100052. https://doi.org/10.1016/j.multra.2022.100052. doi: 10.1016/j.multra.2022.100052
![]() |
[38] |
Y. Liu, Z. Liu, R. Jia, DeepPF: A deep learning based architecture for metro passenger flow prediction, Transp. Res. Part C: Emerg. Technol., 101 (2019), 18–34. https://doi.org/10.1016/j.trc.2019.01.027. doi: 10.1016/j.trc.2019.01.027
![]() |
[39] |
D. Huang, J. Zhang, Z. Liu, Y. He, P. Liu, A novel ranking method based on semi-SPO for battery swapping allocation optimization in a hybrid electric transit system, Transp. Res. Part E: Logist. Transp. Rev., 188 (2024), 103611. https://doi.org/10.1016/j.tre.2024.103611. doi: 10.1016/j.tre.2024.103611
![]() |
[40] |
J. Zhang, D. Huang, Z. Liu, Y. Zheng, Y. Han, P. Liu, et al., A data-driven optimization-based approach for freeway traffic state estimation based on heterogeneous sensor data fusion, Transp. Res. Part E: Logist. Transp. Rev., 189 (2024), 103656. https://doi.org/10.1016/j.tre.2024.103656. doi: 10.1016/j.tre.2024.103656
![]() |
[41] |
Z. Gu, X. Yang, Q. Zhang, W. Yu, Z. Liu, TERL: Two-stage ensemble reinforcement learning paradigm for large-scale decentralized decision making in transportation simulation, IEEE Trans. Knowl. Data Eng., 35 (2023), 13043–13054. https://doi.org/10.1109/TKDE.2023.3272688. doi: 10.1109/TKDE.2023.3272688
![]() |
[42] |
Z. Gu, Y. Wang, W. Ma, Z. Liu, A joint travel mode and departure time choice model in dynamic multimodal transportation networks based on deep reinforcement learning, Multimodal Transp., 3 (2024), 100137. https://doi.org/10.1016/j.multra.2024.100137. doi: 10.1016/j.multra.2024.100137
![]() |
[43] |
R. Rahman, S. Hasan, Data-driven traffic assignment: A novel approach for learning traffic flow patterns using graph convolutional neural network, Data Sci. Transp., 5 (2023), 11. https://doi.org/10.1007/s42421-023-00073-y. doi: 10.1007/s42421-023-00073-y
![]() |
[44] |
P. Guarda, M. Battifarano, S. Qian, Estimating network flow and travel behavior using day-to-day system-level data: A computational graph approach, Transp. Res. Part C: Emerg. Technol., 158 (2024), 104409. https://doi.org/10.1016/j.trc.2023.104409. doi: 10.1016/j.trc.2023.104409
![]() |
[45] |
B. Sifringer, V. Lurkin, A. Alahi, Enhancing discrete choice models with representation learning, Transp. Res. Part B: Methodol., 140 (2020), 236–261. https://doi.org/10.1016/j.trb.2020.08.006. doi: 10.1016/j.trb.2020.08.006
![]() |
[46] | Z. Fang, Q. Cheng, Z. Liu, Y. Liu, A deep learning approach for the traffic assignment problem, in Transportation Research Board 98th Annual Meeting, 2019. |
[47] |
Z. Liu, Y. Yin, F. Bai, D. K. Grimm, End-to-end learning of user equilibrium with implicit neural networks, Transp. Res. Part C: Emerg. Technol., 150 (2023), 104085. https://doi.org/10.1016/j.trc.2023.104085. doi: 10.1016/j.trc.2023.104085
![]() |
[48] | Z. Liu, Y. Yin, End-to-end learning of user equilibrium: Expressivity, generalization, and optimization, Transp. Sci., 2025. https://doi.org/10.1287/trsc.2023.0489. |
[49] |
W. Fan, Z. Tang, P. Ye, F. Xiao, J. Zhang, Deep learning-based dynamic traffic assignment with incomplete origin–destination data, Transp. Res. Rec., 2677 (2023), 1340–1356. https://doi.org/10.1177/03611981221123805. doi: 10.1177/03611981221123805
![]() |
[50] |
X. Hu, C. Xie, Use of graph attention networks for traffic assignment in a large number of network scenarios, Transp. Res. Part C: Emerg. Technol., 171 (2025), 104997. https://doi.org/10.1016/j.trc.2025.104997. doi: 10.1016/j.trc.2025.104997
![]() |
[51] | T. N. Kipf, M. Welling, Semi-supervised classification with graph convolutional networks, in International Conference on Learning Representations, 2017. |
[52] |
M. R. McCord, Urban transportation networks: Equilibrium analysis with mathematical programming methods, Transp. Res. Part A: Policy Pract., 21 (1987), 481–484. https://doi.org/10.1016/0191-2607(87)90038-0. doi: 10.1016/0191-2607(87)90038-0
![]() |
[53] | K. Lab, METIS-Serial Graph Partitioning and Fill-reducing Matrix Ordering, 2016. |
1. | Wenjing Wang, Jingjing Dong, Dong Xu, Zhilian Yan, Jianping Zhou, Synchronization control of time-delay neural networks via event-triggered non-fragile cost-guaranteed control, 2022, 20, 1551-0018, 52, 10.3934/mbe.2023004 |