Incremental Traffic Assignment: A Perturbation Approach

Kupiszewska, D; Vliet, Dirck Van

doi:10.1108/9780585474182-015

Cited by 4 publications

(6 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There is another type of algorithm which is based on modifying the search direction of the F-W algorithm but operates in the space of path f lows. The social pressure algorithm developed by Kupiszewska and Van Vliet (1998) lies under this category. It retains the simple structure of F-W algorithm but improves the rate of convergence by using a social pressure factor.…”

Section: Literature Reviewmentioning

confidence: 99%

“…n λ is the step size which lies between 0 and 1 and is obtained through a line search procedure that minimizes the value of Z(x). Translating this in terms of a path-based approach, the flow update process for the F-W algorithm can be represented as (Kupiszewska and Van Vliet, 1998):…”

Section: Conceptual Basis For the Spsamentioning

confidence: 99%

“…Consequently, f low transfer starts oscillating between the paths of an O-D pair, especially near convergence, leading to the poor performance of the F-W algorithm. The social pressure algorithm (Kupiszewska and Van Vliet, 1998) was devised to overcome this drawback.…”

Section: Conceptual Basis For the Spsamentioning

confidence: 99%

“…The social pressure concept is based on the idea that drivers traveling on relatively expensive paths are more strongly inclined to shift paths than those with travel times closer to the minimum cost paths. The social pressure factor (Kupiszewska and Van Vliet, 1998) for a path is defined as the difference of cost of the path from the minimum cost for the O-D pair. In this paper, it is termed as the "path shift-propensity factor" to link it to the real-world meaning, mathematically: (1 ) rs rs n n k k rs n rs n rs rs n k k n l l l k…”

Section: Conceptual Basis For the Spsamentioning

confidence: 99%

See 3 more Smart Citations

Slope-Based Path Shift Propensity Algorithm for the Static Traffic Assignment Problem

Kumar¹,

Peeta²

2014

IJTTE

View full text Add to dashboard Cite

This paper presents a path-based traffic assignment algorithm for solving the static deterministic user equilibrium traffic assignment problem. It uses the concepts of the path shift-propensity factor and the sensitivity of path costs with respect to path flows in the flow update process, and is labeled as the slope-based path shift-propensity algorithm (SPSA). It seeks to enable faster convergence, incorporates behavioral realism in the flow update process, and maintains simplicity of execution for easy deployment in practice. The behavioral rationale behind the proposed algorithm is explained. The mathematical exposition of the algorithm and its proof of convergence are articulated. Numerical experiments are conducted using test networks to benchmark the performance of SPSA. The computational performance of the SPSA is compared with those of two versions of the recently developed path-based algorithm labeled slope-based multipath algorithm (SMPA), the widely-used Frank-Wolfe (F-W) algorithm, and a variant of the F-W algorithm labeled the social pressure algorithm (SPA). They illustrate that the rate of convergence of the SPSA is very close to that of the SMPA and significantly better than those of the F-W algorithm and the SPA. One version of the SMPA performs better than the SPSA in terms of convergence, though the latter is easier to implement and hence a potential substitute for SMPA in practice. Further, the results vindicate the notion that the SPSA is a feasible deployment option under the computational capabilities available today.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Conceptual Basis For the Spsamentioning

confidence: 99%

Section: Conceptual Basis For the Spsamentioning

confidence: 99%

Section: Conceptual Basis For the Spsamentioning

confidence: 99%

See 2 more Smart Citations

Slope-Based Path Shift Propensity Algorithm for the Static Traffic Assignment Problem

Kumar¹,

Peeta²

2014

IJTTE

View full text Add to dashboard Cite

show abstract

“…Bekhor and Toledo (2005)), the Path Equilibrator (Dafermos and Sparrow, 1969), the Disaggregate Simplicial Decomposition (DSD, Larsson and Patriksson, 1992), the Gradient Projection (GP, Jayakrishnan et al, 1994;Chen et al, 2002b), the Social Pressure (Kupiszewska and van Vliet, 1998), the Projected Gradient (Florian et al, 2009) and the slope-based multipath flow update (Kumar and Peeta, 2010) methods. Components of these DUE solution algorithms may be modified to fit into Step 2 by applying them to the transformed costs rather than the actual costs in the inner direction finding step.…”

Section: The Restricted Master Problem Phasementioning

confidence: 99%

Stochastic user equilibrium with equilibrated choice sets: Part II – Solving the restricted SUE for the logit family

Rasmussen

Watling

Prato

et al. 2015

Transportation Research Part B: Methodological

View full text Add to dashboard Cite

We propose a new class of path-based solution algorithms to solve the Restricted Stochastic User Equilibrium (RSUE), as introduced in Watling et al (2014). The class allows a flexible specification of how the choice sets are 'systematically' grown by considering congestion effects and how the flows are allocated among routes. The specification allows adapting traditional pathbased stochastic user equilibrium flow allocation methods (designed for pre-specified choice sets) to the generic solution algorithm. We also propose a cost transformation function and show that by using this we can, for certain Logit-type choice models, modify existing path-based Deterministic User Equilibrium solution methods to fit the RSUE solution algorithm. The transformation function also leads to a two-part relative gap measure for consistently monitoring convergence to a RSUE solution. Numerical tests are reported on two real-life cases, in which we explore convergence patterns and choice set composition and size, for alternative specifications of the RSUE solution algorithm.

show abstract

A Post-processing Technique for the Four-step Travel Demand Modeling Executed Through a Feedback Loop

Kumar¹,

Peeta²

2013

Procedia - Social and Behavioral Sciences

View full text Add to dashboard Cite

Incremental Traffic Assignment: A Perturbation Approach

Cited by 4 publications

References 0 publications

Slope-Based Path Shift Propensity Algorithm for the Static Traffic Assignment Problem

Slope-Based Path Shift Propensity Algorithm for the Static Traffic Assignment Problem

Stochastic user equilibrium with equilibrated choice sets: Part II – Solving the restricted SUE for the logit family

A Post-processing Technique for the Four-step Travel Demand Modeling Executed Through a Feedback Loop

Contact Info

Product

Resources

About