Next Article in Journal
Effect of Monomer Mixture Composition on TiCl4-Al(i-C4H9)3 Catalytic System Activity in Butadiene–Isoprene Copolymerization: A Theoretical Study
Previous Article in Journal
A New Type of High-Order Mapped Unequal-Sized WENO Scheme for Nonlinear Degenerate Parabolic Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Research on the Branch Road Traffic Flow Estimation and Main Road Traffic Flow Monitoring Optimization Problem

School of Mathematics and Statistics, Huaiyin Normal University, Huaian 223300, China
*
Author to whom correspondence should be addressed.
Computation 2025, 13(8), 183; https://doi.org/10.3390/computation13080183
Submission received: 5 July 2025 / Revised: 19 July 2025 / Accepted: 23 July 2025 / Published: 1 August 2025

Abstract

Main roads are usually equipped with traffic flow monitoring devices in the road network to record the traffic flow data of the main roads in real time. Three complex scenarios, i.e., Y-junctions, multi-lane merging, and signalized intersections, are considered in this paper by developing a novel modeling system that leverages only historical main-road data to reconstruct branch-road volumes and identify pivotal time points where instantaneous observations enable robust inference of period-aggregate traffic volumes. Four mathematical models (I–IV) are built using the data given in appendix, with performance quantified via error metrics (RMSE, MAE, MAPE) and stability indices (perturbation sensitivity index, structure similarity score). Finally, the significant traffic flow change points are further identified by the PELT algorithm.

1. Introduction

In the road network, main roads are usually equipped with traffic flow monitoring devices, which can record the traffic flow data of the main roads in real time. When multiple branch roads converge into the main road, since some branch roads lack traffic flow monitoring devices, the traffic flow of each branch road needs to be estimated by combining the traffic flow data from the main road with the history trend information of the branch roads. This will provide data and methodological support for issues such as optimizing the timing of traffic signals, alleviating traffic congestion, and planning road resources.
A novel modeling framework that utilizes only historical main-road data is required to reconstruct branch-road traffic volumes and identify critical time points at which instantaneous observations facilitate robust inference of aggregate traffic volumes over specific time periods. And it must be applicable to several common real-world road scenarios, including Y-junctions, multi-lane merging, and signalized intersections, as well as to cases with noisy sensor data.
Least squares methods facilitate both linear and nonlinear economic forecasting, cross-category product gap analysis, and power system transmission line parameter estimation. The nonlinear variant has proven effective for estimating RC thermal models in building energy analysis. For complex optimization challenges, metaheuristic algorithms demonstrate wide applicability. Genetic algorithms optimize flexible power allocation in hybrid energy storage systems, enhance facial expression recognition via reinforcement learning, and improve tuned mass damper designs for wind turbine towers. Hybrid genetic-simulated annealing approaches minimize spare parts inspection costs, optimize composite laminate orientations, enable unsupervised tight sandstone reservoir classification, and refine least squares support vector machine parameters in breakdown diagnosis. Simulated annealing additionally supports tourism management optimization. Robust principal component analysis (RPCA) addresses critical image processing challenges, including single-image glow/hot-pixel removal and low-quality retinal image enhancement, while revealing methodological insights about outlier detection sensitivity to center-point inaccuracies. Change point detection algorithms analyze temporal dynamics across domains, examining both the impact of sliding window selection on detection accuracy and structural shifts in power grid time-series data. The PELT algorithm specifically enables precise microseismic signal identification. Most recently, hybrid models have performed outstandingly in regards to traffic prediction. Li et al. (2025) proposed a spatiotemporal graph model integrating CTM and transformer (the Cell Transformer, abbreviated as CeT) methods. CeT employs discretized lane segments to emulate the cell transmission model, creating a cell space to forecast vehicle counts across all segments based on historical traffic data [1].

2. Materials and Methods

2.1. Scene Overviews

We consider the roads shown in the Figure 1. Firstly, the Y-shaped road in Figure 1a is investigated at the point where the traffic flow of Branch Road 1 and Branch Road 2 converges simultaneously into Main Road 3. Suppose that only the traffic flow monitoring device A1 is installed on Main Road 3, and the traffic flow information of the main road is recorded every 2 min. The time it takes for the vehicle to travel from the branch road to the main road and reach A1 is negligible. The third column in Table A1 in Appendix A provides the traffic flow data on Main Road 3 on a certain morning [6:58, 8:58] (7:00 is the first data recording moment, and 8:58 is the last data recording moment, as shown below).
Secondly, consider the road shown in Figure 1b. The traffic flow of Branch Road 1 and Branch Road 2 converges onto Main Road 5 simultaneously, and the traffic flow of Branch Road 3 and Branch Road 4 converges onto Main Road 5 simultaneously. Only the traffic flow monitoring device A2 is installed on Main Road 5, and the traffic flow information of the main road is recorded once every 2 min. The fourth column in Table A1 in Appendix A provides the traffic flow data on Main Road 5 during the time period of [6:58, 8:58] on a certain morning. Suppose the time it takes for the vehicle to travel from the intersection of Branch Road 1 and Branch Road 2 to A2 is 2 min, and the travel time of the vehicle from Branch Road 3 and Branch Road 4 to A2 is negligible. According to the historical traffic flow observation records, during the time period of [6:58, 8:58], the traffic flow on Branch Road 1 was stable. The traffic volume of Branch Road 2 increased linearly during the time periods of [6:58, 7:48] and [8:14, 8:58], and remained stable during the time period of (7:48, 8:14). The traffic volume of Branch Road 3 first shows a trend of linear growth followed by stabilization. A periodic pattern is shown as the traffic volume on Branch Road 4. Thirdly, in Figure 1c, the traffic flow of Branch Road 1 and Branch Road 2 simultaneously converges onto Main Road 4. Branch Road 3 is a special traffic control road, and the vehicles on Branch Road 3 are controlled by the traffic signal C when passing through the intersection. The red light time for C is set to 8 min, the green light time to 10 min, and the yellow light time is negligible. Only the traffic flow monitoring device A3 is installed on Main Road 4, recording the traffic flow information of the main road every 2 min. The traffic flow data of Main Road 4 on a certain morning [6:58, 8:58] is provided in the fifth column in Table A1 of Appendix A. Suppose the driving time of the vehicle from the intersection of Branch Road 1 and Branch Road 2 to A3 is 2 min, and the driving time of the vehicle from Branch Road 3 to A3 is negligible.
Finally, in the case of a poor network signal, low visibility, large traffic flow, or too fast traffic speed, the traffic flow monitoring device may produce data errors. Considering the road shown in Figure 1c, suppose that the data recorded by device A3 on a certain day exhibits an error. The observed data within the time period of [6:58, 8:58] are shown in the sixth column in Table A1 of Appendix A. The traffic volume of Branch Road 1 exhibited a trend of “no flow → linear growth → stability → linear decrease to no flow”. The traffic volume of Branch Road 2 increased linearly and decreased linearly during the time periods of [6:58, 7:34] and [8:10, 8:58], respectively, and remained stable during the time period of (7:34, 8:10). The red light duration for signal light C is set to 8 min, the green light duration to 10 min, and the yellow light duration is negligible. When C shows a green light, the traffic flow on Branch Road 3 is either stable or shows a linear changing trend. When C shows a red light, the traffic volume on Branch Road 3 is 0. The time when C shows the green light is unknown.

2.2. Model Hypothesis

We propose the following hypothesis:
Assumption 1.
The traffic flow on the main road is the sum of the traffic flow on each branch road, and the traffic flow on each branch road displays a certain regularity (e.g., the morning and evening peaks; the traffic flow distribution is different during the weekday peak hours), and this regularity can be described by a function.
Assumption 2.
The roads are all one-way lanes, and the blue arrows in Figure 1 represent the direction of traffic flow.
Assumption 3.
The “increase/decrease” trend of traffic flow in scenarios 1–4 refers to the trend of “strictly monotonous increase/strictly monotonous decrease”, “stable” refers to a state in which the traffic flow remains constant at a non-negative fixed value, and the functional relationships describing the variations in traffic flow across all branches are continuous functions.
Assumption 4.
For convenience, let 7:00 be  t = 0  and  t [ 0 ,   59 ]  in the functional relationship.

2.3. Model Analysis and Establishment

2.3.1. Mathematical Model I

According to the historical traffic flow observation records, during the period of [6:58, 8:58], the traffic flow on Branch Road 1 showed a linear growth trend, while that on Branch Road 2 exhibited a trend of linear growth first and then a linear decrease. For the empirical traffic flow data in the third column in Table A1 of Appendix A, we implemented a least squares curve fitting model [2,3,4,5] to reconstruct branch road traffic flows. Python 3.9 was utilized for algorithm implementation. Software implementation details include the least squares method coded in Python with NumPy (1.26.3) for matrix operations and SciPy (1.13.1) for optimization. Specifically, linear regression and piecewise linear models were developed for Branch Road 1 and Branch Road 2. The branch fitting formulas are shown in Equations (1) and (2). The resulting fitted curves are shown in Figure 2 and Figure 3, where RMSE is 0.0000, MAE is 0.000, and MAPE is 0%. Visualization of the main road traffic flow reveals an approximately linear trend. Consequently, the linear model for Branch Roads 1 and 2 achieves an RMSE of 0, indicating negligible overfitting. The fitted values of main road traffic flow align closely with observed data, demonstrating high model fidelity.
f 11 t = 0.5 t + 7 ,               0 t < 60  
f 12 ( t ) = t ,                       0 t < 30 t + 30 ,       30 t < 60

2.3.2. Mathematical Model II

According to the historical traffic flow observation records, during the time period of [6:58, 8:58], the traffic flow on Branch Road 1 was stable. The traffic volume of Branch Road 2 increases linearly during the time periods of [6:58, 7:48] and [8:14, 8:58], and remains stable during the time period of (7:48, 8:14). The traffic volume of Branch Road 3 shows a trend of linear growth first, followed by stabilization. The traffic volume on Branch Road 4 shows a periodic pattern.
For the dataset in the fourth column in Table A1 of Appendix A, we initialize model parameters using iterative algorithm outputs as estimates. These parameters were refined via nonlinear least squares optimization [5], minimizing the residual sum of squares through iterative refinement. Following problem specifications, distinct functional forms were implemented for each branch: a constant model for Branch 1, piecewise linear models for Branches 2 and 3, and a Fourier series model (to capture periodic variations) for Branch 4. The Levenberg–Marquardt algorithm [6] is used to fit the function model, where the regularization parameter is set 0.01, since the approximate effect is good. For Branch 4, we implemented a second-order Fourier spectral decomposition [7,8] containing fundamental and second harmonic terms, balancing accuracy with computational efficiency. Software implementation details are seen in Table A2. The branch fitting formulas are shown in Equations (3)–(6).
f 21 ( t ) = 16.5204
f 22 ( t ) = 0.4 t + 12.7760 ,   0 t < 24 22.3760 ,   24 t < 36 0.3903 t + 7.9344 ,   36 t < 60
f 23 ( t ) = 0.4 t + 11.5610 ,   0 t < 32 24.1610 ,   32 t < 60
f 24 ( t ) = 7.4599 2.9964 cos ( 2 π 27.7 t ) 3.1779 sin ( 2 π 27.7 t ) 5.1064 cos ( 4 π 27.7 t ) 6.3322 sin ( 4 π 27.7 t )
We obtain the fitted results and shown in Figure 3, Figure 4, Figure 5, Figure 6 and Figure 7, where RMSE is 3.6526, MAE is 3.0606, MAPE is 86.10%, PSI is 0.0861 under a 3% perturbation of the parameter, SSS is 99.68% with time delay compensation, and RMSE is 3.8152 without time delay compensation. Incorporating a 2 min time delay compensation significantly enhances model accuracy, as the resulting temporal patterns of branch road traffic flows demonstrably align with empirical traffic behavior. Residual analysis via the fast Fourier transform (FFT) method revealed no significant spectral peaks exceeding the statistical threshold (49.6105), confirming that the second-order expansion sufficiently captured inherent periodicity without higher-order terms.
Remark 1. 
Perturbation Sensitivity Index:
P S I = 1 n t n Q ¯ 4 ( δ ) ( t ) Q ¯ 4 ( t )
We applied ±3% perturbations to the parameters of the branch road flow estimation function, recomputed the prediction error for main road traffic flow, and assessed the stability of the model’s output. Results indicate that the perturbation sensitivity index remains within the range of ±2 units across all tested perturbations, demonstrating robust model performance.
Structure Similarity Score:
S S S = 1 3 i = 1 3 1 59 t = 1 59 [ s i g n ( Q ¯ i ( t ) ) = s i g n ( Q ¯ i ( δ ) ( t ) ) ]
The sign sequences (reflecting monotonicity properties) of branch functions are compared before and after perturbation, with structural similarity quantified. Experiments demonstrate that a structure similarity score exceeding 95% indicates that the model robustly preserves essential physical relationships in branch flow dynamics under data disturbances.

2.3.3. Mathematical Model III

According to the historical traffic flow observation records, during the time period of [6:58, 8:58], the traffic flow on Branch Road 1 exhibited a trend of “no flow→ increase → decrease → stability → decrease to no flow”. The traffic volume of Branch Road 2 increased linearly and decreased linearly during the time periods of [6:58, 8:10] and [8:34, 8:58], respectively, and remained stable during the time period of (8:10, 8:34). When C shows a green light, the traffic flow on Branch Road 3 either remains stable or shows a linear changing trend, and the first green light begins to light up at 7:06. When C shows a red light, the traffic volume on Branch Road 3 is 0. Based on the fact that hybrid models have recently performed outstandingly in regards to traffic prediction [8,9], this provides us with many ideas. However, these methods rely on multi-source sensors or other circumstances and cannot be fully applied to scenarios where there are no monitoring devices on branch roads.
For the dataset in the fifth column in Table A1 of Appendix A, we implemented constrained least squares estimation [10] to determine parameter vectors by minimizing the residual sum of the squares. Piecewise linear models are subsequently established for Branches 1, 2, and 3, per problem requirements. When initial parameter adjustments failed to satisfy constraints for traffic flow on Branch 1, we integrated simulated annealing with nonlinear least squares (initial temperature: 1; step size: 0.5, adjusted every 50 iterations) to refine the model. Software implementation details are seen in Table A2. The branch fitting formulas are shown in Equations (9)–(11).
f 31 ( t ) = 0 , 0 t < 8 3.3 t 26.4 , 8 t < 16 0.5 t + 34.4 , 16 t < 26 21.658 , 26 t < 35 5 t + 196.658 , 35 t < 39 0 , 39 t < 60
f 32 ( t ) = 3.909 t + 0.8 , 0 t < 16 63.346 , 16 t < 33 0.884 t + 92.518 , 33 t < 60
f 33 ( t ) = 15.218   , the green light   0   , the red light
This hybrid approach fits the functional relationship well, with results presented in Figure 8, Figure 9 and Figure 10. RMSE is 11.9175, MAE is 9.4187, MAPE is 32.2188%, PSI is 0.4094, SSS is 99.76% under a 3% perturbation of the parameter with time delay compensation, and RMSE is 12.4331 without time delay compensation. The modeling error is primarily attributable to traffic flow discontinuities induced by signal control. Incorporating the 18 min signal cycle significantly enhances model accuracy, while the inferred branch road flow patterns align with empirical traffic characteristics.

2.3.4. Mathematical Model IV

According to the historical traffic flow observation records, in Figure 1c, the traffic volume of Branch Road 2 increased linearly and decreased linearly during the time periods of [6:58, 7:34] and [8:10, 8:58], respectively, and remained stable during the time period of (7:34, 8:10). The red light duration for signal light C is set to 8 min, the green light duration to 10 min, and the yellow light duration is negligible. When C shows a green light, the traffic flow on Branch Road 3 is either stable or shows a linear changing trend. When C shows a red light, the traffic volume on Branch Road 3 is 0. The time when C shows the green light is unknown.
We employ three parameter optimization methods: constrained least squares, a hybrid genetic algorithm–simulated annealing (GA–SA) approach [11,12,13,14,15,16,17,18], and robust principal component analysis (RPCA) [19,20,21]. The hybrid GA–SA model was ultimately selected to characterize branch road traffic flows using the dataset in the sixth column in Table A1 of Appendix A. This hybrid algorithm enhances the classical simulated annealing framework by integrating the population-based search mechanism of genetic algorithms. The resulting optimizer combines probabilistic state transitions with global population search capabilities. In traffic monitoring applications, main road sensors may generate sparse yet high-amplitude errors due to network delays or equipment failures, resulting in sudden data drops. While the GA–SA hybrid fits functional traffic models, RPCA effectively isolates such anomalies while preserving the underlying low-rank traffic matrix structure.
In the GA–SA model, we set the population size to 15, the uniformly sampled mutation rate from 0.5 to 1.0, the crossover rate at 0.7, the initial temperature to 5230, and the restart temperature ratio to 2 × 10 5 , after adjusting the parameters. In RPCA model, we set the regularization coefficient to 1 10 . Software implementation details can be seen in Table A2 The branch fitting formulas are shown in Equations (12)–(14). The GA–SA model displays the best effect, and the result is shown in Figure 11, Figure 12 and Figure 13. Meanwhile the green light first commenced at 7:06 (t = 3). In the GA–SA model, RMSE is 13.6733, MAE is 2.8329, MAPE is 7.42%, PSI is 0.0184, SSS is 99.89% under a 3% perturbation of the parameter with time delay compensation, and RMSE is 4.6824 without time delay compensation. The error indexes and model stability indexes for NLS and RPCA are shown in Table A2 of Appendix B.
f 41 ( t ) = 0 , 0 t < 13 1.21 t 15.972 , 13 t < 27 16.97 , 27 t < 48 4.2425 t + 220.61 , 48 t < 52 0 , 52 t < 60
f 42 ( t ) = 1.4482 t + 14.18 , 0 t < 17 38.68 , 17 t < 35 1.47 t + 90.13 , 35 t < 60
f 43 ( t ) = 25.25 , the green light   0   , the red light

3. Results

According to the expression of Mathematical Model I to Mathematical Model IV, we obtain the traffic flow values on each branch road at moment 7:30 and 8:30, respectively (see Table 1, Table 2, Table 3 and Table 4).
Furthermore, to determine function parameters, sufficient data points surrounding these key time points are required. Therefore, change point detection [22,23] is employed to identify optimal segmentation intervals. Specifically, the PELT algorithm [24] is applied to the main road traffic flow time series to detect significant change points.
Let the main road traffic sequence be y t and find the set of change points Τ = Τ 1 , Τ 2 , , Τ k , such that the residuals of the segmented linear model are minimized, as follows:
m i n k = 0 K F y Τ k : Τ k + 1 + β K ,  
where F is the segmented cost function (e.g., mean square error), and   β   is the penalty coefficient, which controls the number of change points. Figure 14 presents the results for Model II, identifying change points at times t = 0, 4, 19, 25, 37, 40 and observation times 07:00, 07:08, 07:38, 07:50, 08:14, 08:20. The penalty coefficient is set to 3, resulting in the lowest MAE of 3.38. For Mathematical Model III, which is presented in Figure 15, the detected change points occur at t = 3, 8, 12, 17, 21, 26, 30, 35, 39, 44, 48, 53, 57, with observations recorded at 07:06, 07:16, 07:24, 07:34, 07:42, 07:52, 08:00, 08:10, 08:18, 08:28, 08:36, 08:46, 08:54. The penalty coefficient is set to 8, resulting in the lowest MAE of 8.29. Model IV, which is presented in Figure 16, yields change points at t = 3, 8, 12, 17, 19, 21, 26, 30, 35, 39, 44, 48, 49, 53, 57 and observations at 07:06, 07:16, 07:24, 07:34, 07:38, 07:42, 07:52, 08:00, 08:10, 08:18, 08:28, 08:36, 08:38, 08:46, 08:54. The penalty coefficient is set to 3, resulting in the lowest MAE of 10.27. Software implementation details include the PELT algorithm coded in Python with NumPy, ruptures (1.1.9) for signal segmentation and pandas (2.3.0) for data processing.

4. Discussion

Collectively, Models I-IV underpin the development of comprehensive traffic monitoring systems. Crucially, the robust optimization framework derived from Model IV enables practical implementation within smart city infrastructures by
(1)
Rapid identification of incident locations;
(2)
Dynamic generation of optimal rerouting strategies.

5. Conclusions

This paper has four main limitations:
(1)
The strict monotonicity of traffic flow assumed in Assumption 3 may not hold in actual road conditions;
(2)
The fixed signal timing in Model III/IV reduces adaptability to adaptive signal systems;
(3)
The computational complexity of the GA–SA hybrid limits real-time deployment (>2 s/iteration);
(4)
The validation datasets lack extreme weather conditions. Future work will integrate reinforcement learning for dynamic signal optimization.
Nevertheless, The model proposed in this study exhibits high adaptability, featuring multi-class configurations tailored for diverse road structures and complex constraints. Algorithmically, this work introduces three key innovations:
(1)
Periodic fluctuation modeling through the Fourier spectral method.
(2)
Constrained optimization for enforcing continuity in piecewise functions.
(3)
Hybrid global optimization combining genetic algorithms with simulated annealing.
These advancements collectively enhance the model’s explanatory capability and generalization performance. Furthermore, the variable change-point detection algorithm quantitatively identifies critical monitoring moments, providing a cost-efficient framework for practical traffic data collection.

Author Contributions

B.W.: formal analysis, methodology, writing—original draft, and writing—review and editing; S.Z.: formal analysis and software. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The data used in this study are available.

Acknowledgments

The authors would like to thank the manuscript readers for their very professional comments and helpful suggestions.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A

Table A1. Traffic flow on the main roads considered in this paper (obtained from the 2025 May Day MCM (Mathematical Contest in Modeling) in China).
Table A1. Traffic flow on the main roads considered in this paper (obtained from the 2025 May Day MCM (Mathematical Contest in Modeling) in China).
MomentTimeTraffic Flow on Main Road 3 in Figure 1aTraffic Flow on Main Road 5 in Figure 1bTraffic Flow on Main Road 4 in Figure 1cTraffic Flow on
Main Road 4 in Figure 1c
07:0007.0032.50.820.1178
07:0218.5034.1221.6463
07:04210.0035.73.231.0159
07:06311.5037.34.440.5070
07:08413.0038.934.641.4589
07:10514.5040.537.340.3803
07:12616.0053.14045.0280
07:14717.5054.742.723.5751
07:16819.0056.345.427.6601
07:18920.5057.920.62528.5191
07:201022.0059.530.3122.8609
07:221123.5061.139.39554.4147
07:241225.0062.747.8256.3573
07:261326.5064.381.07554.6330
07:281428.0051.987.3559.2022
07:301529.5053.592.78555.9851
07:321631.0055.197.3237.2741
07:341732.5056.7100.89543.2759
07:361834.0071.381.1544.3377
07:381935.5071.983.27546.9259
07:402037.0072.584.2674.7459
07:422138.5073.184.04569.1357
07:442240.0073.7109.9774.9930
07:462341.5074.3106.37575.0219
07:482443.0074.9101.472.3299
07:502544.5075.5101.852.8119
07:522646.0064.5102.253.9451
07:542747.5064.579.252.3878
07:562849.0064.580.455.7438
07:582950.5064.581.681.1195
08:003052.0064.582.886.6484
08:023151.5064.5108.881.2547
08:043251.0064.5110.883.2154
08:063350.5064.5112.881.3694
08:083450.0075.5110.253.7771
08:103549.5075.5107.659.5877
08:123649.0075.576.258.5586
08:143748.5075.571.654.5368
08:163848.0075.56780.8018
08:183947.5075.962.471.8756
08:204047.0076.376.873.5100
08:224146.5076.772.268.9525
08:244246.0063.167.667.9241
08:264345.5063.56344.8616
08:284445.0063.96336.4950
08:304544.5064.34435.4181
08:324644.0078.74431.5647
08:344743.5079.14471.6705
08:364843.0079.54468.6749
08:384942.5079.982.1565.5375
08:405042.0080.382.358.2082
08:425141.5080.782.4560.4376
08:445241.0081.182.617.2408
08:465340.5081.582.7512.3009
08:485440.0070.938.910.9520
08:505539.5071.338.0512.9869
08:525639.0071.737.236.8780
08:545738.5072.136.3531.1231
08:565838.0072.552.532.2821
08:585937.5072.951.6528.5905

Appendix B

Table A2. The error indexes and model stability indexes for each method.
Table A2. The error indexes and model stability indexes for each method.
ModelIIIIIIV
MethodLS-FSMSA-NLSNLSGA–SARPCA
Software implementation detailsNumPy
pandas
SciPy
scikit-learn (1.6.1)
NumPy
pandas
SciPy
NumPy
pandas
SciPy
scikit-learn
NumPy
pandas
SciPy
scikit-learn
NumPy
pandas
scikit-learn
CVXPY (1.6.6)
RMSE3.652611.917510.70043.67335.8200
MAE3.06069.41878.05582.83293.6315
MAPE5.0600%32.2188%20.6800%7.4200%10.5100%
PSI0.08610.40940.12840.01840.0200
SSS99.68%99.76%99.44%99.89%97.96%
RMSE without time delay compensation3.815212.433110.93574.68247.6431

References

  1. Li, A.R.; Xu, Z.L.; Li, W.H.; Chen, Y.Y.; Pan, Y.Y. Urban Signalized Intersection Traffic State Prediction: A Spatial-Temporal Graph Model Integrating the Cell Transmission Model and Transformer. Appl. Sci. 2025, 15, 2377. [Google Scholar] [CrossRef]
  2. Shintani, M. Nonlinear forecasting analysis using diffusion indexes: An application to Japan. J. Money Credit. Bank. 2005, 37, 517–538. [Google Scholar] [CrossRef]
  3. Smalter Hall, A.; Cook, T.R. Macroeconomic Indicator Forecasting with Deep Neural Networks; Technical Report 17–11; Federal Reserve Bank of Kansas City: Kansas City, MO, USA, 2017. [Google Scholar]
  4. Yan, B.; Cao, L.J.; Zhao, C.X. Analysis Method of Transmission Line Parameter Estimation Based on Linear Least Squares Regression and PMU Data. Chin. J. Electron Devices 2024, 47, 1362–1367. (In Chinese) [Google Scholar]
  5. Zamani, V.; Abtahi, S.; Chen, Y.X.; Li, Y. Parameter-input estimation of RC thermal models of buildings using unscented Kalman filter and nonlinear least square method. Indoor Built Environ. 2025, 34, 41–75. [Google Scholar] [CrossRef] [PubMed]
  6. Kumar, M.D.; Jawad, M.; Ramanuja, M.; Ghodhbani, R.; Yook, S.J.; Abdallah, S.A.O. Forecasting heat and mass transfer enhancement in magnetized non-Newtonian nanofluids using Levenberg-Marquardt algorithm: Influence of activation energy and bioconvection. Mech. Time Depend. Mater. 2024, 29, 14. [Google Scholar] [CrossRef]
  7. Lovett, N.; Bhatt, H.P. Efficiently and accurately simulating multi-dimensional M-coupled nonlinear Schrödinger equations with fourth-order time integrators and Fourier pseudo-spectral method. Int. J. Comput. Math. 2025, 102, 653–677. [Google Scholar] [CrossRef]
  8. Zhang, J.; Dong, L.X.; Zhang, Z.R. Second-order scalar auxiliary variable Fourier-spectral method for a liquid thin film coarsening model. Math. Methods Appl. Sci. 2023, 46, 18815–18836. [Google Scholar] [CrossRef]
  9. Venkataraman, S.; Rumpler, R. Urban traffic flow estimation with noise measurements using log-linear regression. Appl. Acoust. 2025, 236, 110745. [Google Scholar] [CrossRef]
  10. Graffelman, J.; Bruce, S.W.; Goudet, J. Estimation of Jacquard’s genetic identity coefficients with bi-allelic variants by constrained least-squares. Heredity 2024, 134, 10–20. [Google Scholar] [CrossRef]
  11. Ma, B.; Li, H.P. Optimal flexible power allocation energy management strategy for hybrid energy storage system with genetic algorithm based model predictive control. Energy 2025, 324, 135958. [Google Scholar] [CrossRef]
  12. Altaha, M.A.; Jarraya, I.; Haddad, L.; Hamdani, T.M.; Chabchoub, H.; Alim, A.M. RLGA-FER: Reinforcement learning based on genetic algorithm for facial expression recognition enhancing. Int. J. Mach. Learn. Cybern. 2024. preprint. [Google Scholar] [CrossRef]
  13. Wang, Y.X.; Huang, Y.; Chen, F. Optimisation of Spare Parts Quality Inspection Cost Based on Simulated Annealing and Genetic Algorithm. Front. Comput. Intell. Syst. 2024, 10, 48–53. [Google Scholar] [CrossRef]
  14. Arellano, M.T.; Vergara, A.B.; Gonzalez, S.P.; Hernández, E.C.H.; Edgar, A.; Franco Ur quiza, E.A. Optimal design of laminates orientation in a composite material by genetics algorithm and simulated annealing. Mech. Adv. Mater. Struct. 2024, 31, 10592–10600. [Google Scholar] [CrossRef]
  15. Wu, B.H.; Xie, R.H.; Xiao, L.Z.; Guo, J.F.; Jin, G.W.; Fu, J.W. Integrated classification method of tight sandstone reservoir based on principal component analysis simulated annealing genetic algorithm—fuzzy cluster means. Pet. Sci. 2023, 20, 2747–2758. [Google Scholar] [CrossRef]
  16. Zhang, D.W.; Li, W.L.; Wang, C.G.; Li, J.H. Simulation research on breakdown diagnosis based on least squares support vector machine optimized by simulated annealing genetic algorithm. Int. J. Model. Simul. Sci. Comput. 2024, 15, 2350046. [Google Scholar] [CrossRef]
  17. Li, S.Z.; Zhou, X.H.; Zhang, X.S.; Wang, Y.H.; Jiang, L.M. Optimization of Tuned Mass Damper for Steel–Concrete Hybrid Wind Turbine Tower Using Genetic Algorithm. Int. J. Struct. Stab. Dyn. 2024. preprint. [Google Scholar] [CrossRef]
  18. Li, H.Z.; Zhang, Z.Y.; Huang, Y.H.; Lin, Z.H.; Lei, Z. Analysis of Tourism Management Based on Genetic Algorithm and Simulated Annealing Algorithm. World Sci. Res. J. 2025, 11, 133–141. [Google Scholar]
  19. Zhang, Y.H.; Zhang, H.F.; Liu, Z.Y.; Zhu, J.; Gu, J.Y.; Wang, X.B.; Zhu, Z.Y.; Tang, Y.J.; Wang, J. Glow and hot pixels removal using improved robust principal component analysis. J. Electron. Imaging 2023, 32, 043012. [Google Scholar] [CrossRef]
  20. Wan, G.H.; He, B.; Schweitzer, H. The art of centering without centering for robust principal component analysis. Data Min. Knowl. Discov. 2023, 38, 699–724. [Google Scholar] [CrossRef]
  21. Likassa, H.T.; Chen, D.-G.; Chen, K.; Wang, Y.; Zhu, W. Robust PCA with Lw,∗ and L2,1 Norms: A Novel Method for Low-Quality Retinal Image Enhancement. J. Imaging 2024, 10, 151. [Google Scholar] [CrossRef]
  22. Kou, A.Q.; Cheng, Y.; Huang, X.Y.; Jin, J. Dynamic replenishment policy for perishable goods using change point detection-based soft actor-critic reinforcement learning. Expert Syst. Appl. 2025, 270, 126556. [Google Scholar] [CrossRef]
  23. Bouman, R.; Schmeitz, L.; Buise, L.; Heres, J.; Shapovalova, Y.; Heskes, T. Acquiring better load estimates by combining anomaly and change point detection in power grid time-series measurements. Sustain. Energy Grids Netw. 2024, 40, 101540. [Google Scholar] [CrossRef]
  24. Wang, X.L.; Lv, M.H. Research on the Initial Arrival Recognition and Judgment Method of Microseismic Signals Based on PELT. Pure Appl. Geophys. 2024, 182, 1263–1278. [Google Scholar] [CrossRef]
Figure 1. The three complex scenarios considered in this paper. (a) Y-shaped road; (b) The 4-branchs road; (c) The 3-branches road.
Figure 1. The three complex scenarios considered in this paper. (a) Y-shaped road; (b) The 4-branchs road; (c) The 3-branches road.
Computation 13 00183 g001
Figure 2. The fitted results of branch 1 in Mathematical Model I.
Figure 2. The fitted results of branch 1 in Mathematical Model I.
Computation 13 00183 g002
Figure 3. The fitted results of Branch Road 2 in Mathematical Model I.
Figure 3. The fitted results of Branch Road 2 in Mathematical Model I.
Computation 13 00183 g003
Figure 4. The fitted results of Branch Road 1 in Mathematical Model II.
Figure 4. The fitted results of Branch Road 1 in Mathematical Model II.
Computation 13 00183 g004
Figure 5. The fitted results of Branch Road 2 in Mathematical Model II.
Figure 5. The fitted results of Branch Road 2 in Mathematical Model II.
Computation 13 00183 g005
Figure 6. The fitted results of Branch Road 3 in Mathematical Model II.
Figure 6. The fitted results of Branch Road 3 in Mathematical Model II.
Computation 13 00183 g006
Figure 7. The fitted results of Branch Road 4 in Mathematical Model II.
Figure 7. The fitted results of Branch Road 4 in Mathematical Model II.
Computation 13 00183 g007
Figure 8. The fitted results of Branch Road 1 in Mathematical Model III.
Figure 8. The fitted results of Branch Road 1 in Mathematical Model III.
Computation 13 00183 g008
Figure 9. The fitted results of Branch Road 2 in Mathematical Model III.
Figure 9. The fitted results of Branch Road 2 in Mathematical Model III.
Computation 13 00183 g009
Figure 10. The fitted results of Branch Road 3 in Mathematical Model III.
Figure 10. The fitted results of Branch Road 3 in Mathematical Model III.
Computation 13 00183 g010
Figure 11. The fitted results of Branch Road 1 in Mathematical Model IV.
Figure 11. The fitted results of Branch Road 1 in Mathematical Model IV.
Computation 13 00183 g011
Figure 12. The fitted results of Branch Road 2 in Mathematical Model IV.
Figure 12. The fitted results of Branch Road 2 in Mathematical Model IV.
Computation 13 00183 g012
Figure 13. The fitted results of Branch Road 3 in Mathematical Model IV.
Figure 13. The fitted results of Branch Road 3 in Mathematical Model IV.
Computation 13 00183 g013
Figure 14. The moments of variation points and the observation moments in Mathematical Model II.
Figure 14. The moments of variation points and the observation moments in Mathematical Model II.
Computation 13 00183 g014
Figure 15. The moments of variation points and the observation moments in Mathematical Model III.
Figure 15. The moments of variation points and the observation moments in Mathematical Model III.
Computation 13 00183 g015
Figure 16. The moments of variation points and the observation moments in Mathematical Model IV.
Figure 16. The moments of variation points and the observation moments in Mathematical Model IV.
Computation 13 00183 g016
Table 1. Numerical values of branch traffic flow in Mathematical Model I.
Table 1. Numerical values of branch traffic flow in Mathematical Model I.
MomentBranch Road 1Branch Road 2
7:3014.515
8:3029.57.5
Table 2. Numerical values of branch traffic flow in Mathematical Model II.
Table 2. Numerical values of branch traffic flow in Mathematical Model II.
MomentBranch Road 1Branch Road 2Branch Road 3Branch Road 4
7:3016.520418.77617.5613.58
8:3016.520425.497924.1615.54
Table 3. Numerical values of branch traffic flow in Mathematical Model III.
Table 3. Numerical values of branch traffic flow in Mathematical Model III.
MomentBranch Road 1Branch Road 2Branch Road 3
7:3023.159.43515.218
8:30052.7380
Table 4. Numerical values of branch traffic flow in Mathematical Model IV.
Table 4. Numerical values of branch traffic flow in Mathematical Model IV.
MomentBranch Road 1Branch Road 2Branch Road 3
7:301.6836.618524.67
8:3016.3439.610
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Wang, B.; Zhu, S. Research on the Branch Road Traffic Flow Estimation and Main Road Traffic Flow Monitoring Optimization Problem. Computation 2025, 13, 183. https://doi.org/10.3390/computation13080183

AMA Style

Wang B, Zhu S. Research on the Branch Road Traffic Flow Estimation and Main Road Traffic Flow Monitoring Optimization Problem. Computation. 2025; 13(8):183. https://doi.org/10.3390/computation13080183

Chicago/Turabian Style

Wang, Bingxian, and Sunxiang Zhu. 2025. "Research on the Branch Road Traffic Flow Estimation and Main Road Traffic Flow Monitoring Optimization Problem" Computation 13, no. 8: 183. https://doi.org/10.3390/computation13080183

APA Style

Wang, B., & Zhu, S. (2025). Research on the Branch Road Traffic Flow Estimation and Main Road Traffic Flow Monitoring Optimization Problem. Computation, 13(8), 183. https://doi.org/10.3390/computation13080183

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop