Integrated models of land use and transportation for the autonomous vehicle revolution

ABSTRACT

The advent of the autonomous vehicle (AV) will affect not only the transportation system, but also future patterns of land development. Integrated land use and transportation models will be critical tools in assessing the path forward with this technology. Key questions with respect to land use impacts of AVs arise from potential changes in sensitivity to travel and reduced demand for parking. It is an open question whether AVs will induce urban sprawl, or whether spatial economies of agglomeration will mitigate any reductions in travel time sensitivity. The deployment of shared fleets of AVs would likely reduce parking demand, producing yet to be explored impacts on property development within existing urban footprints. We perform a critical assessment of currently operational models and their ability to represent the adoption of AVs. We identify the representation of time in such models as a vital component requiring additional development to model this new technology. Existing model applications have focused on the discrete addition of new infrastructure or policy at a fixed point in time, whereas AV adoption will occur incrementally through time. Stated adaptation surveys are recommended as tools to quantify preferences and develop relevant model inputs. It is argued that existing models that assume comparatively static equilibrium have been convenient in the past, but are insufficient to model technology adoption. In contrast, dynamic model frameworks lack sufficient structure to maintain reasonability under large perturbations from base conditions. The ongoing advancement of computing has allowed models to move away from being mechanistic aggregate tools, towards behaviourally rich depictions of individual persons and firms. However, much work remains to move from projections of existing conditions into the future, to the evolution of the spatial economy as it evolves through time in response to new technologies and exogenous stresses. Principles from complex and evolutionary systems theory will be important in the development of models with the capacity to consider such dynamics.     

Electric vehicle charging station locations: Elastic demand,station congestion,and network equilibrium

Battery-only electric vehicles (BEVs) generally offer better air quality through lowered emissions, along with energy savings and security. The issue of long-duration battery charging makes charging-station placement and design key for BEV adoption rates. This work uses genetic algorithms to identify profit-maximizing station placement and design details, with applications that reflect the costs of installing, operating, and maintaining service equipment, including land acquisition. Fast electric vehicle charging stations (EVCSs) are placed across a congested city's network subject to stochastic demand for charging under a user-equilibrium traffic assignment. BEV users’ station choices consider endogenously determined travel times and on-site charging queues. The model allows for congested-travel and congested-station feedback into travelers’ route choices under elastic demand and BEV owners’ station choices, as well as charging price elasticity for BEV charging users.Boston-network results suggest that EVCSs should locate mostly along major highways, which may be a common finding for other metro settings. If 10% of current EV owners seek to charge en route, a user fee of $6 for a 30-min charging session is not enough for station profitability under a 5-year time horizon in this region. However, $10 per BEV charging delivers a 5-year profit of $0.82 million, and 11 cords across 3 stations are enough to accommodate a near-term charging demand in this Boston-area application. Shorter charging sessions, higher fees, and/or allowing for more cords per site also increase profits generally, everything else constant. Power-grid and station upgrades should keep pace with demand, to maximize profits over time, and avoid on-site congestion.     

Experiment of boundedly rational route choice behavior and the model under satisficing rule

In this paper, we study the boundedly rational route choice behavior under the Simon’s satisficing rule. A laboratory experiment was carried out to verify the participants’ boundedly rational route choice behavior. By introducing the concept of aspiration level which is specific to each person, we develop a novel model of the problem in a parallel-link network and investigate the properties of the boundedly rational user equilibrium (BRUE) state. Conditions for ensuring the existence and uniqueness of the BRUE solution are derived. A solution method is proposed to find the unique BRUE state. Extensions to general networks are conducted. Numerical examples are presented to demonstrate the theoretical analyses.     

On a link-based day-to-day traffic assignment model

In this paper, we perform a rigorous analysis on a link-based day-to-day traffic assignment model recently proposed in He et al. (2010). Several properties, including the invariance set and the constrained stability, of this dynamical process are established. An extension of the model to the asymmetric case is investigated and the stability result is also established under slightly more restrictive assumptions. Numerical experiments are conducted to demonstrate the findings.     

隆林新洲养护站边坡稳定性分析

文章利用SLOPE／W模块,基于确定值方法和可靠度理论的极限平衡法．对隆林新洲养护站边坡在不采取支挡措施和采用锚索抗滑桩支挡措施情况下,如何保持边坡稳定性进行了对比分析。     

Optimal joint distance and time toll for cordon-based congestion pricing

This paper addresses the optimal toll design problem for the cordon-based congestion pricing scheme, where both a time-toll and a nonlinear distance-toll (i.e., joint distance and time toll) are levied for each network user’s trip in a pricing cordon. The users’ route choice behaviour is assumed to follow the Logit-based stochastic user equilibrium (SUE). We first propose a link-based convex programming model for the Logit-based SUE problem with a joint distance and time toll pattern. A mathematical program with equilibrium constraints (MPEC) is developed to formulate the optimal joint distance and time toll design problem. The developed MPEC model is equivalently transformed into a semi-infinite programming (SIP) model. A global optimization method named Incremental Constraint Method (ICM) is designed for solving the SIP model. Finally, two numerical examples are used to assess the proposed methodology.     

基于荣乌高速烟威段的生态建设和修复技术研究

高速公路建设的迅速发展在带来很高的社会效益和经济效益的同时,对路域自然环境、对生态平衡造成的影响日益突出。本文以荣乌高速烟威段实施的绿化工程为案例,对路堑边坡、路侧裸地、受损湿地生态系统修复技术进行了探讨和研究。     

扩底抗拔桩极限承载力半经验半理论计算方法与试验验证

文章考虑了土体力学特性,以及桩身材料性质、桩长与桩径(含扩底直径)、桩顶埋深、桩顶卸载与加载、群桩效应等诸多因素的影响,结合工程经验给出了计算扩底抗拔桩极限承载力的半经验半理论方法;根据扩底抗拔桩破坏面位置不同,将扩底抗拔桩破坏模式分为三类(即破坏面延伸至地表的整体剪切破坏、破坏面介于地表与扩孔段之间的局部剪切破坏与破坏面位于扩孔段附近的冲剪破坏),推导出了整体剪切破坏模式的极限平衡状态方程;并依据扩底抗拔桩轴对称条件与土体抗拉强度小的力学特征,给出了求解整体破坏面的微分筒数值解法;利用经验法估算了局部剪切破坏、冲剪破坏模式下的端阻力,进而给出了任意土层中扩底抗拔桩承载力计算步骤与方法;最后,结合一足尺试验的计算分析与承载力测试比较,验证了计算方法的可靠性与精确度。     

Path-constrained traffic assignment: A trip chain analysis under range anxiety

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.     

Schedule-based transit assignment model with vehicle capacity and seat availability

In this paper, we propose a new schedule-based equilibrium transit assignment model that differentiates the discomfort level experienced by sitting and standing passengers. The notion of seat allocation has not been considered explicitly and analytically in previous schedule-based frameworks. The model assumes that passengers use strategies when traveling from their origin to their destination. When loading a vehicle, standing on-board passengers continuing to the next station have priority to get available seats and waiting passengers are loaded on a First-Come-First-Serve (FCFS) principle. The stimulus of a standing passenger to sit increases with his/her remaining journey length and time already spent on-board. When a vehicle is full, passengers unable to board must wait for the next vehicle to arrive. The equilibrium conditions can be stated as a variational inequality involving a vector-valued function of expected strategy costs. To find a solution, we adopt the method of successive averages (MSA) that generates strategies during each iteration by solving a dynamic program. Numerical results are also reported to show the effects of our model on the travel strategies and departure time choices of passengers.