The dynamic optimization of the departure times of metro users during rush hour in an agent-based simulation: A Case study in Shenzhen, China

4Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

As serious traffic problems have increased throughout the world, various types of studies, especially traffic simulations, have been conducted to investigate this issue. Activity-based traffic simulation models, such as MATSim (Multi-Agent Transport Simulation), are intended to identify optimal combinations of activities in time and space. It is also necessary to examine commuting-based traffic simulations. Such simulations focus on optimizing travel times by adjusting departure times, travel modes or travel routes to present travel suggestions to the public. This paper examines the optimal departure times of metro users during rush hour using a newly developed simulation tool. A strategy for identifying relatively optimal departure times is identified. This study examines 103,637 person agents (passengers) in Shenzhen, China, and reports their average departure time, travel time and travel utility, as well as the numbers of person agents who are late and miss metro trips in every iteration. The results demonstrate that as the number of iterations increases, the average travel time of these person agents decreases by approximately 4 min. Moreover, the latest average departure time with no risk of being late when going to work is approximately 8:04, and the earliest average departure time with no risk of missing metro trips when getting off work is approximately 17:50.

Cite

CITATION STYLE

APA

Xi, Y., Du, Q., He, B., Ren, F., Zhang, Y., & Ye, X. (2017). The dynamic optimization of the departure times of metro users during rush hour in an agent-based simulation: A Case study in Shenzhen, China. Applied Sciences (Switzerland), 7(11). https://doi.org/10.3390/app7111102

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free