期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 257, 期 3, 页码 870-880出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2016.08.019
关键词
Combined modal split and traffic assignment problem; Elastic demand; User equilibrium; Gradient projection; Bi-modal networks
资金
- Basic Science Research Program through the National Research Foundation (NRF) of Korea by the Ministry of Science, ICT & Future Planning [NRF-2016R1C1B2016254, NRF-2010-0029443]
- Research Committee of the Hong Kong Polytechnic University [1-ZE5T]
- Research Grants Council of the Hong Kong Special Administrative Region [15267116]
- Transportation Research Center for Livable Communities (TRCLC)
- Mountain-Plains Consortium (MPC) - U.S. Department of Transportation
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. (C) 2016 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据