A demand model with departure time choice for within-day dynamic traffic assignment
Introduction
The dynamic analysis of transportation networks gathered increasing attention through the past years. The static models, traditionally used in this field, are in fact unable to represent relevant phenomena, such as demand variations over time and temporary over saturation of network elements. On the other hand, dynamic models are more complex than static ones: on the supply side, they require to ensure temporal consistency, besides spatial consistency, among system variables (for instance, see Cascetta, 2001); on the demand side, choice of the time when to travel has to be modelled explicitly in order to achieve a correct representation of users’ travel behaviour (Mahmassani and Chang, 1986, Van Vuren et al., 1998, Mahmassani and Liu, 1999).
Different approaches to the latter problem can be found in the literature. One of them is to regard departure time choice as a discrete choice among temporal intervals and use static assignment to characterize the utility of each interval, as in Daly et al. (1990); models based on this approach yield a rough representation of travel demand during day time as a sequence of static equilibriums.
An alternative approach, relying on a more realistic representation of dynamic travel times, can be found in De Palma et al. (1983) and Ben-Akiva et al. (1986) where a within-day dynamic stochastic equilibrium model and a doubly dynamic stochastic model, respectively, are presented. Travel, departure time and path choices are addressed through a mixed discrete/continuous nested Logit model and travel times are determined by means of a deterministic queuing model; however, both models are applied only to single origin destination pair idealized networks.
Another approach is based on the hypothesis that departure time and path choices are made jointly, so that, for each origin–destination pair, a discrete choice set is defined whose finite number of alternatives is equal to the number of departure intervals multiplied by the number of paths (Arnott et al., 1990, Cascetta et al., 1992); models based on this approach require explicit path enumeration and the introduction of a diachronic graph, as in Van der Zijpp and Lindveld (2000), so they can be hardly applied to congested urban networks.
An extensive analysis of departure time choice for shopping trips is presented in Bhat (1998) and Bhat and Steed (2002). In the first paper, a discrete choice model is proposed, able to represent correlation among adjacent departure time periods. In the second paper, a continuous-time model of departure time is proposed, accommodating time-varying coefficients. Both papers however does not investigate path choice, since travel times and cost are assumed exogenously.
In a recent paper by Bellei et al. (2005) the within-day road dynamic traffic assignment (DTA) was regarded as a stochastic dynamic user equilibrium. A new fixed point formulation of the problem in terms of time-continuous real valued temporal profiles of arc flows and arc performances (travel times and generalized costs) was presented, where the concept of network loading map, yielding arc flows for given demand flows consistently with certain arc performances, was extended to the dynamic case, thus avoiding the introduction of both the dynamic network loading as a sub-problem, and the explicit path enumeration. OD flows temporal profiles were taken as given. An implicit path enumeration algorithm was thus proposed for the Logit case.
Based on the above modelling framework, two more papers, namely Gentile et al. (2002) and Gentile et al. (2003), focused on a new dynamic transit supply model relying on a frequency based approach; the introduction of a diachronic graph is thus avoided and implicit path enumeration is allowed. This model is able to represent both intra and inter modal congestion effects (i.e. interaction among cars and bus flows). In order to define a multimodal within-day DTA, a dynamic mode choice model was introduced in these papers, while demand flows were assumed to be rigid with respect to any other choice dimension.
In this paper a mixed discrete/continuous nested Logit dynamic demand model with five choice levels is presented, where, besides the usual to travel or not to travel (generation), destination, mode and path choices, the departure time choice is introduced. The model is conceived to extend previous work to the most general case of elastic demand multimodal within-day DTA. With reference to departure time choice, the proposed demand model adopts a continuous approach, thus not requiring to enumerate explicitly the desired departure time intervals. The resulting within-day DTA model is then capable of representing both supply and demand dynamic phenomena concerning congested multimodal urban networks, and leads to a fixed point formulation that can be solved by an efficient implicit path MSA algorithm applicable to real networks.
Section snippets
The choice and demand models
In modelling travel demand we follow the behavioural approach based on random utility theory, where it is assumed that each user is a rational decision-maker who, when making his travel choice: (a) considers a positive, finite number of mutually exclusive travel alternatives constituting his choice set J; (b) associates to each travel alternative j of his choice set a perceived utility, not known with certainty, and thus regarded by the analyst as a random variable Uj; and (c) selects the
Supply and equilibrium models
In analogy with the static case, the within-day DTA, regarded as a dynamic user equilibrium, can be consistently formalized through a fixed point problem expressed in terms of the temporal profiles of arc flows and transit frequencies, by combining the arc performance function with the network loading map (NLM) and thus avoiding to introduce the DNL. To this purpose, the NLM is here extended to the case of elastic demand with departure time choice, as depicted in Fig. 2.
In the following
Algorithm
In order to implement the proposed DTA model, the period of analysis is divided into I time intervals identified by the sequence of instants (τ0, …, τi, … , τI). In the following we assume to approximate the generic temporal profile x through either a piece-wise constant or a piece-wise linear function defined by the values taken at such instants, so that for the two cases we have respectively:
Numerical application
The network of Sioux Falls, consisting of 76 directed arcs and 24 centroids, has been considered for a numerical application. In order to investigate the effectiveness of the proposed departure time choice model and algorithm, we compare the results of two DTA on this network, performed considering both rigid and elastic departure time choice.
The period of analysis, 6 hours long, was subdivided in 36 time intervals 10 minutes long; the known daily demand has been distributed consistently with
Conclusions
The purpose of this paper was to provide a modelling framework for the simulation of elastic demand in the context of within-day dynamic traffic assignment. To this end, a multimodal within-day dynamic traffic assignment model is presented with a Nested Logit demand model considering combined travel, destination, mode, departure time, and route choices. With specific reference to departure time choice, a continuous version of the logit model is adopted, so that enumerating explicitly the
References (17)
- et al.
Departure time and route choice for the morning commute
Transportation Research A
(1990) - et al.
A within-day dynamic traffic assignment model for urban road networks
Transportation Research B
(2005) Analysis of travel mode and departure time choice for urban shopping trips
Transportation Research B
(1998)- et al.
A continuous-time model of departure time choice for urban shopping trips
Transportation Research B
(2002) - et al.
Experiments with departure time choice dynamics of urban commuters
Transportation Research B
(1986) - et al.
Dynamic of commuting decision behaviour under advanced traveller information systems
Transportation Research C
(1999) - et al.
Postoptimizing equilibrium flows on large scale networks
European Journal of Operational Research
(1996) - et al.
Dynamic model of peak period traffic congestion with elastic arrival rates
Transportation Science
(1986)
Cited by (25)
A double time-scale passenger assignment model for high-speed railway networks with continuum capacity approximation
2021, Transportation Research Part E: Logistics and Transportation ReviewCitation Excerpt :At the end of Section 2, we list the major assumptions for the HSR passenger flow assignment problem. Many studies in the literature (e.g., Szeto and Lo, 2004; Bellei et al., 2006; Su et al., 2016) have considered desired departure times for passengers. In this paper, besides the desired departure time, the ticket booking times of passengers are also considered, which will determine the orders of ticket booking.
Simulation of rerouting phenomena in Dynamic Traffic Assignment with the Information Comply Model
2019, Transportation Research Part B: MethodologicalCitation Excerpt :To this end we extend the framework for macroscopic within-day DTA presented in Gentile (2016). The methodology presented in this paper is built mainly on our previous research on DTA (Bellei et al., 2005; Bellei et al., 2006; Gentile et al., 2007; Gentile, 2015), which exploits implicit path enumeration through a sequential approach to route choice (Gentile and Papola, 2006; Long et al., 2013) and the Link Transmission Model (Yperman, 2007; Gentile, 2010; Nezamuddin and Boyles, 2015) as a simulation engine on the supply side. After pointing out the limitations of the classic DTA to represent rerouting, we identify a suitable way to include the phenomenon in the model structure.
Itinerary choice and advance ticket booking for high-speed-railway network services
2018, Transportation Research Part C: Emerging TechnologiesSolving a Dynamic User Equilibrium model based on splitting rates with Gradient Projection algorithms
2016, Transportation Research Part B: MethodologicalCitation Excerpt :to prove that, in the case of deterministic route choices, the Dynamic User Equilibrium based on arc conditional probabilities formulated as a Variational Inequality problem is equivalent to that based on path probabilities. This paper builds up on the research (Bellei et al., 2005, 2006; Gentile et al., 2005, 2007) that brought to the model called DUE (Dynamic User Equilibrium), which is the tool for macroscopic dynamic assignment available in the VISUM software package (Gentile et al., 2006), with the aim of improving convergence to equilibrium wrt MSA. The sub-models of the supply side (arc model, node model) can be combined in two different ways to produce arc travel times starting from arc flows.
Capacity-oriented passenger flow control under uncertain demand: Algorithm development and real-world case study
2016, Transportation Research Part E: Logistics and Transportation ReviewCitation Excerpt :Considering a station as a facility network, total volume and AP variables are not sufficient to assign passengers to each O–D and each route. It is supposed to be a bi-level programming problem where the upper level is system optimization and the lower level is user equilibrium and heuristic algorithms are usually adopted to solve because it belongs to a non-convex and NP hard problem (Yang et al., 2000; Bellei et al., 2006; Tang et al., 2008; Chen and Kasikitwiwat, 2011; Trozzi et al., 2013; Chen et al., 2015; Wang et al., 2015). So, we divide this complex problem into two tractable sub-problems.
Incorporating departure time choice into high-occupancy/toll (HOT) algorithm evaluation
2015, Transportation Research Procedia