TY - JOUR
T1 - An improvement in MATSim computing time for large-scale travel behaviour microsimulation
AU - Zhuge, Chengxiang
AU - Bithell, Mike
AU - Shao, Chunfu
AU - Li, Xia
AU - Gao, Jian
N1 - Publisher Copyright:
© 2019, The Author(s).
PY - 2021/2
Y1 - 2021/2
N2 - Coupling activity-based models with dynamic traffic assignment appears to form a promising approach to investigating travel demand. However, such an integrated framework is generally time-consuming, especially for large-scale scenarios. This paper attempts to improve the performance of these kinds of integrated frameworks through some simple adjustments using MATSim as an example. We focus on two specific areas of the model—replanning and time stepping. In the first case we adjust the scoring system for agents to use in assessing their travel plans to include only agents with low plan scores, rather than selecting agents at random, as is the case in the current model. Secondly, we vary the model time step to account for network loading in the execution module of MATSim. The city of Baoding, China is used as a case study. The performance of the proposed methods was assessed through comparison between the improved and original MATSim, calibrated using Cadyts. The results suggest that the first solution can significantly decrease the computing time at the cost of slight increase of model error, but the second solution makes the improved MATSim outperform the original one, both in terms of computing time and model accuracy; Integrating all new proposed methods takes still less computing time and obtains relatively accurate outcomes, compared with those only incorporating one new method.
AB - Coupling activity-based models with dynamic traffic assignment appears to form a promising approach to investigating travel demand. However, such an integrated framework is generally time-consuming, especially for large-scale scenarios. This paper attempts to improve the performance of these kinds of integrated frameworks through some simple adjustments using MATSim as an example. We focus on two specific areas of the model—replanning and time stepping. In the first case we adjust the scoring system for agents to use in assessing their travel plans to include only agents with low plan scores, rather than selecting agents at random, as is the case in the current model. Secondly, we vary the model time step to account for network loading in the execution module of MATSim. The city of Baoding, China is used as a case study. The performance of the proposed methods was assessed through comparison between the improved and original MATSim, calibrated using Cadyts. The results suggest that the first solution can significantly decrease the computing time at the cost of slight increase of model error, but the second solution makes the improved MATSim outperform the original one, both in terms of computing time and model accuracy; Integrating all new proposed methods takes still less computing time and obtains relatively accurate outcomes, compared with those only incorporating one new method.
KW - Activity-based model
KW - Agent-based model
KW - Computing time
KW - Dynamic traffic assignment
KW - Large-scale simulation
KW - MATSim
KW - Varying time step-based approach
UR - http://www.scopus.com/inward/record.url?scp=85073788569&partnerID=8YFLogxK
U2 - 10.1007/s11116-019-10048-0
DO - 10.1007/s11116-019-10048-0
M3 - Article
AN - SCOPUS:85073788569
SN - 0049-4488
VL - 48
SP - 193
EP - 214
JO - Transportation
JF - Transportation
IS - 1
ER -