References of "Transportation Research. Part B, Methodological"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailIncorporating trip chaining within online demand estimation
Cantelmo, Guido; Qurashi, Moeid; Prakash, Arun et al

in Transportation Research. Part B, Methodological (2019)

Time-dependent Origin–Destination (OD) demand flows are fundamental inputs for Dy- namic Traffic Assignment (DTA) systems and real-time traffic management. This work in- troduces a novel state-space ... [more ▼]

Time-dependent Origin–Destination (OD) demand flows are fundamental inputs for Dy- namic Traffic Assignment (DTA) systems and real-time traffic management. This work in- troduces a novel state-space framework to estimate these demand flows in an online con- text. Specifically, we propose to explicitly include trip-chaining behavior within the state- space formulation, which is solved using the well-established Kalman Filtering technique. While existing works already consider structural information and recursive behavior within the online demand estimation problem, this information has been always considered at the OD level. In this study, we introduce this structural information by explicitly representing trip-chaining within the estimation framework. The advantage is twofold. First, all trips belonging to the same tour can be jointly calibrated. Second, given the estimation during a certain time interval, a prediction of the structural deviation over the whole day can be obtained without the need to run additional simulations. The effectiveness of the proposed methodology is demonstrated first on a toy network and then on a large real-world net- work. Results show that the model improves the prediction performance with respect to a conventional Kalman Filtering approach. We also show that, on the basis of the estimation of the morning commute, the model can be used to predict the evening commute without need of running additional simulations. [less ▲]

Detailed reference viewed: 25 (0 UL)
Full Text
Peer Reviewed
See detailQuasi-dynamic traffic assignment with spatial queueing, control and blocking back
Smith, Mike; Huang, Wei; Viti, Francesco UL et al

in Transportation Research. Part B, Methodological (2019)

This paper introduces a steady-state, fixed (or inelastic) demand equilibrium model with explicit link-exit capacities, explicit bottleneck or queueing delays and explicit bounds on queue storage ... [more ▼]

This paper introduces a steady-state, fixed (or inelastic) demand equilibrium model with explicit link-exit capacities, explicit bottleneck or queueing delays and explicit bounds on queue storage capacities. The model is a quasi-dynamic model. The link model at the heart of this quasi-dynamic equilibrium model is a spatial queueing model, which takes account of the space taken up by queues both when there is no blocking back and also when there is blocking back. The paper shows that if this quasi-dynamic model is utilised then for any feasible demand there is an equilibrium solution, provided (i) queue storage capacities are large or (ii) prices are used to help impose capacity restrictions; the prices either remove queueing delays entirely or just reduce spatial queues sufficiently to ensure that blocking back does not occur at equilibrium. Similar results, but now involving the P0 control policy (introduced in Smith (1979a, 1987)) and two new variations of this policy (i.e., the spatial P0 control policy, and the biased spatial P0 control policy) are obtained. In these results, the control policies allow green-times to vary in response to prices as well as spatial queueing delays. These three policies are also tested on a small simple network. In these tests, the biased spatial version of P0 is much the best in reducing equilibrium delays (on this simple network). The paper further illustrates how the spatial queueing model works on simple networks with different merge models; it is demonstrated that equilibrium may be prevented by certain (fixed ratio) merge models. It is also shown in this case that equilibrium may be imposed on just the controlled area itself by a variety of (merge model, gating strategy) combinations. Opportunities for developing such combined gating and merging control strategies are finally discussed. [less ▲]

Detailed reference viewed: 25 (0 UL)
Full Text
Peer Reviewed
See detailControllability of transportation networks
Rinaldi, Marco UL

in Transportation Research. Part B, Methodological (2018), 118

Network-wide traffic control policies determine the optimal values for the different kinds of controllers equipped on a transportation network, with the objective of reducing de- lays and congestion ... [more ▼]

Network-wide traffic control policies determine the optimal values for the different kinds of controllers equipped on a transportation network, with the objective of reducing de- lays and congestion, improving safety and reaching a target Level of Service. While models and algorithms for these problems have been extensively studied in literature, little at- tention has been devoted to investigating whether/how different locations, kinds (pricing controllers, traffic lights, ...) and amounts of controllers in a network affect the overall performance of network-wide schemes. In this work, we adapt the control-theoretical approach of controllability of complex networks to the specific instance of transportation networks, considering both propaga- tion/spillback dynamics and users’ behavior in terms of route choice. Thanks to the newly developed methodology, we then provide exact solutions to the Full Controllability Pric- ing Controller Location Problem for transportation networks. Comparing different pricing controller location policies through two artificial test cases, we empirically demonstrate how indeed the amount and kind of controllers in a network strongly affect the level of performance reachable by network-wide control policies, specifically in terms of Total Cost minimization. [less ▲]

Detailed reference viewed: 40 (4 UL)
Full Text
Peer Reviewed
See detailIncorporating activity duration and scheduling utility into equilibrium-based Dynamic Traffic Assignment
Cantelmo, Guido UL; Viti, Francesco UL

in Transportation Research. Part B, Methodological (2018)

This paper deals with the problem of jointly modelling activity scheduling and duration within a Dynamic Traffic Assignment (DTA) problem framework. Although the last decades witnessed an intense effort ... [more ▼]

This paper deals with the problem of jointly modelling activity scheduling and duration within a Dynamic Traffic Assignment (DTA) problem framework. Although the last decades witnessed an intense effort in developing utility-based departure time choice models, relatively little has been done for understanding how the different assumptions on the utility model affect the model outputs. This problem is the main focus of this paper, which evaluates the effect of explicitly incorporating activity scheduling and duration within a generic user equilibrium DTA formulation. While using utility functions to model the positive component of the utility is a quite common procedure, the object of this paper is to show that a generic utility-based framework behaves as trip-based, activity-based, tour-based, or schedule-based if specific assumptions are specified. By establishing a set of properties, we quantify the amount of utility lost due to traffic congestion and how this affects activity (re-)scheduling and duration decisions. This allows predicting the effect of using a different assumption on the evolution of the transport system – and more specifically the departure time choice model. Conclusions support the idea that, under specific conditions, complex user behaviour can be approximated through a simplified model, and that the ratio between utility at origin and destination can be used to identify systematic biases within an existing DTA model – such as anticipating the rush hour. We also propose a novel utility function suited for modelling different activities, which can be used for modelling activities with a different duration. The mathematical model used to evaluate the effect of scheduling and duration into the equilibrium-based Dynamic Traffic Assignment is a simple bottleneck model. While this model has been recently re-formulated in order to capture the interaction between morning/evening commute, this paper further generalizes it in order to account for all type of activities. [less ▲]

Detailed reference viewed: 45 (3 UL)
Full Text
Peer Reviewed
See detailEconomies of scale in recoverable robust maintenance location routing for rolling stock
Arts, Joachim UL; Tönissen, Denise

in Transportation Research. Part B, Methodological (2018), 117

We consider the problem of locating maintenance facilities in a railway setting. Different facility sizes can be chosen for each candidate location and for each size there is an associated annual facility ... [more ▼]

We consider the problem of locating maintenance facilities in a railway setting. Different facility sizes can be chosen for each candidate location and for each size there is an associated annual facility costs that can capture economies of scale in facility size. Because of the strategic nature of facility location, the opened facilities should be able to handle the current maintenance demand, but also the demand for any of the scenarios that can occur in the future. These scenarios capture changes such as changes to the line plan and the introduction of new rolling stock types. We allow recovery in the form of opening additional facilities, closing facilities, and increasing the facility size for each scenario. We provide a two-stage robust programming formulation. In the first-stage, we decide where to open what size of facility. In the second-stage, we solve a NP-hard maintenance location routing problem. We reformulate the problem as a mixed integer program that can be used to make an efficient column-and-constraint generation algorithm. To show that our algorithm works on practical sized instances, and to gain managerial insights, we perform a case study with instances from the Netherlands Railways. A counter intuitive insight is that economies of scale only play a limited role and that it is more important to reduce the transportation cost by building many small facilities, rather than a few large ones to profit from economies of scale. [less ▲]

Detailed reference viewed: 66 (6 UL)