Please use this identifier to cite or link to this item:
Title: Solving the combined modal split and traffic assignment problem with two types of transit impedance function
Authors: Ryu, S
Chen, A 
Choi, K
Keywords: Bi-modal networks
Combined modal split and traffic assignment problem
Elastic demand
Gradient projection
User equilibrium
Issue Date: 2017
Publisher: Elsevier
Source: European journal of operational research, 2017, v. 257, no. 3, p. 870-880 How to cite?
Journal: European journal of operational research 
Abstract: The gradient projection (GP) algorithm has been shown as a successful path-based algorithm for solving various traffic assignment problems. In this paper, the GP algorithm is adapted for solving the combined modal split and traffic assignment (CMSTA) problem, which can be viewed as an elastic demand traffic equilibrium problem (EDTEP) with two modes. Using the excess-demand formulation of EDTEP, the CMSTA problem is reformulated and solved by a modified GP algorithm. Numerical results based on a real bi-modal network in the city of Winnipeg, Canada are provided to demonstrate the efficiency and robustness of the modified path-based GP algorithm for solving the CMSTA problem. In addition, the CMSTA problem is investigated with two types of impedance function for the transit mode and with different degrees of dispersion for the modal split function. The computational results show the modified GP algorithm outperforms the classical Evan's algorithm for both types of transit impedance function, and it can be as efficient as the original GP algorithm for solving the traffic assignment problem with fixed demand.
ISSN: 0377-2217
EISSN: 1872-6860
DOI: 10.1016/j.ejor.2016.08.019
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Oct 23, 2018


Last Week
Last month
Citations as of Oct 19, 2018

Page view(s)

Last Week
Last month
Citations as of Oct 22, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.