Abstract
The typical method to couple activity-based demand generation (ABDG) and dynamic traffic assignment (DTA) is time-dependent origin-destination (O-D) matrices. With that coupling method, the individual traveler's information gets lost. Delays at one trip do not affect later trips. However, it is possible to retain the full agent information from the ABDG by writing out all agents' plans, instead of the O-D matrix. A plan is a sequence of activities, connected by trips. Because that information typically is already available inside the ABDG, this is fairly easy to achieve. Multiagent simulation (MATSim) takes such plans as input. It iterates between the traffic flow simulation (sometimes called network loading) and the behavioral modules. The currently implemented behavioral modules are route finding and time adjustment. Activity resequencing or activity dropping are conceptually clear but not yet implemented. Such a system will react to a time-dependent toll by possibly rearranging the complete day; in consequence, it goes far beyond DTA (which just does route adaptation). This paper reports on the status of the current Berlin implementation. The initial plans are taken from an ABDG, originally developed by Kutter; to the authors' knowledge, this is the first time traveler-based information (and not just O-D matrices) is taken from an ABDG and used in a MATSim. The simulation results are compared with real-world traffic counts from about 100 measurement stations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Transportation Research Record: Journal of the Transportation Research Board
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.