期刊
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES
卷 68, 期 -, 页码 447-461出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.trc.2016.05.003
关键词
Traffic assignment; Network equilibrium; Electric vehicles; Range anxiety; Trip chains; Combined activity-travel choices
资金
- China Recruitment Program of Global Experts [2013-007312-0069]
- Research Fund for the Doctoral Program of Higher Education of China [2013-007312-0069]
- National Natural Science Foundation of China [71471111]
- University of New South Wales
This paper proposes and analyzes a distance-constrained traffic assignment problem with trip chains embedded in equilibrium network flows. The purpose of studying this problem is to develop an appropriate modeling tool for characterizing traffic flow patterns in emerging transportation networks that serve a massive adoption of plug-in electric vehicles. This need arises from the facts that electric vehicles suffer from the range anxiety issue caused by the unavailability or insufficiency of public electricity-charging infrastructures and the far-below-expectation battery capacity. It is suggested that if range anxiety makes any impact on travel behaviors, it more likely occurs on the trip chain level rather than the trip level, where a trip chain here is defined as a series of trips between two possible charging opportunities (Tamor et al., 2013). The focus of this paper is thus given to the development of the modeling and solution methods for the proposed traffic assignment problem. In this modeling paradigm, given that trip chains are the basic modeling unit for individual decision making, any traveler's combined travel route and activity location choices under the distance limit results in a distance-constrained, node-sequenced shortest path problem. A cascading labeling algorithm is developed for this shortest path problem and embedded into a linear approximation framework for equilibrium network solutions. The numerical result derived from an illustrative example clearly shows the mechanism and magnitude of the distance limit and trip chain settings in reshaping network flows from the simple case characterized merely by user equilibrium. (C) 2016 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据