Articlehybrid2017

A heuristic method for a congested capacitated transit assignment model with strategies

28 citations0/0 files storedTransportation Research Part B Methodological

No readable copy stored yet — this record is metadata only.

Transportation Planning and Optimization Traffic control and management Railway Systems and Energy Efficiency

Abstract

This paper addresses the problem of solving the congested transit assignment problem with strict capacities. The model under consideration is the extension made by Cominetti and Correa (2001), for which the only solution method capable of resolving large transit networks is the one proposed by Cepeda et al. (2006). This transit assignment model was recently formulated by the authors as both a variational inequality problem and a fixed point inclusion problem. As a consequence of these results, this paper proposes an algorithm for solving the congested transit assignment problem with strict line capacities. The proposed method consists of using an MSA-based heuristic for finding a solution for the fixed point inclusion formulation. Additionally, it offers the advantage of always obtaining capacity-feasible flows with equal computational performance in cases of moderate congestion and with greater computational performance in cases of highly congested networks. A set of computational tests on realistic small- and large-scale transit networks under various congestion levels are reported, and the characteristics of the proposed method are analyzed.

Citations in this library

Stored only when both papers are in the corpus — 28 citations exist upstream.

References

1951A Stochastic Approximation Method 1989Optimal strategies: A new assignment model for transit networks 1954Multidimensional Stochastic Approximation Methods 1993Transit Assignment for Congested Public Transport Systems: An Equilibrium Model 1988Equilibrium traffic assignment for large scale transit networks 1975Common Bus Lines 2005A frequency-based assignment model for congested transit networks with strict capacity constraints: characterization and computation of equilibria 2007Method of Successive Weighted Averages (MSWA) and Self-Regulated Averaging Schemes for Solving Stochastic User Equilibrium Problem

Cited by

2022Hyperbush Algorithm for Strategy-Based Equilibrium Traffic Assignment Problems 2022Strategy-based transit stochastic user equilibrium model with capacity and number-of-transfers constraints 2018A robust optimization approach for itinerary planning with deadline 2021A new transit assignment model based on line and node strategies 2022A Calculation Method of Passenger Flow Distribution in Large-Scale Subway Network Based on Passenger–Train Matching Probability

Imported from OpenAlex (CC0) — nothing here is generated.