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.     

Can ports increase traffic while reducing inputs? Technical efficiency of Spanish Port Authorities using a directional distance function approach

The focus of this paper is on the productive efficiency of ports. We estimate a directional technology distance function using parametric techniques to analyze the production technology and technical efficiency of a set of Spanish Port Authorities observed over the period 1993–2012. Technical inefficiency is conceived as the ability of ports to simultaneously expand a given output and contract variable inputs while maintaining quasi-fixed inputs and other outputs constant. Thus, for containerized cargo we address the following question: Given the amount of quasi-fixed inputs used by the firm and given the volume of the other outputs (liquids, solids, non-containerized cargo and passenger traffic), could ports increase their containerized merchandise while simultaneously reducing their variable inputs? Similar questions are asked for solid bulk and non-containerized general cargo. Our results show evidence of technical inefficiency among the ports in our sample. In particular, if the ports operated efficiently, we find that containerized cargo could be expanded by an average of over 6.4%, with an equivalent reduction in variable inputs. Solid bulk cargo and general non-containerized cargo could be increased by 4.1% and 6.1% respectively, with corresponding reductions in variable inputs. An implication of our results is that there is ample scope for specialization on the part of ports with no increase in infrastructure costs. Given that large investments in infrastructure have been made in Spanish port over the last decade, this opens the possibility of moving towards a management model based on taking advantage of existing capacity rather than new investments.     

Bush-based sensitivity analysis for approximating subnetwork diversion

Subnetwork analysis is often used in traffic assignment problems to reduce the size of the network being analyzed, with a corresponding decrease in computation time. This is particularly important in network design, second-best pricing, or other bilevel problems in which many equilibrium runs must be solved as a subproblem to a master optimization program. A fixed trip table based on an equilibrium path flow solution is often used, but this ignores important attraction and diversion effects as drivers (globally) change routes in response to (local) subnetwork changes. This paper presents an approach for replacing a regional network with a smaller one, containing all of the subnetwork, and zones. Artificial arcs are created to represent “all paths” between each origin and subnetwork boundary node, under the assumption that the set of equilibrium routes does not change. The primary contribution of the paper is a procedure for estimating a cost function on these artificial arcs, using derivatives of the equilibrium travel times between the end nodes to create a Taylor series. A bush-based representation allows rapid calculation of these derivatives. Two methods for calculating these derivatives are presented, one based on network transformations and resembling techniques used in the analysis of resistive circuits, and another based on iterated solution of a nested set of linear equations. These methods are applied to two networks, one small and artificial, and the other a regional network representing the Austin, Texas metropolitan area. These demonstrations show substantial improvement in accuracy as compared to using a fixed table, and demonstrate the efficiency of the proposed approach.     

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.     

Integrated planning of static and dynamic charging infrastructure for electric vehicles

This paper investigates the optimal deployment of static and dynamic charging infrastructure considering the interdependency between transportation and power networks. Static infrastructure means plug-in charging stations, while the dynamic counterpart refers to electrified roads or charging lanes enabled by charging-while-driving technology. A network equilibrium model is first developed to capture the interactions among battery electric vehicles’ (BEVs) route choices, charging plans, and the prices of electricity. A mixed-integer bi-level program is then formulated to determine the deployment plan of charging infrastructure to minimize the total social cost of the coupled networks. Numerical examples are provided to demonstrate travel and charging plans of BEV drivers and the competitiveness of static and dynamic charging infrastructure. The numerical results on three networks suggest that (1) for individual BEV drivers, the choice between using charging lanes and charging stations is more sensitive to parameters including value of travel time, service fee markup, and battery size, but less sensitive to the charging rates and travel demand; (2) deploying more charging lanes is favorable for transportation networks with sparser topology while more charging stations can be more preferable for those denser networks.     

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.     

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.     

基于Fisk运量随机配流的交通信息最优发布水平确定研究

本文借助Fisk运量随机配流模型建立一个简单二层规划模型来研究交通信息的最优发布水平，通过模型分析得出一些重要结论。在非拥挤交通网络中，信息发布不产生外部效果，信息系统应发布全部信息；在严重拥挤的交通网络中，产生正的外部效果，信息系统应发布全部信息；在一般拥挤网络中，可能产生正的外部效果，也可能产生负的外部效果，应根据具体情况选择合适的信息发布水平。     

高压齿轮泵浮动侧板的动态平衡机理

针对高压齿轮泵浮动侧板磨损问题,在解析齿轮泵内部流场的基础上重点研究了浮动侧板反推力作用点变化规律和导致侧板产生倾覆力矩的关键因素。以某型号高压大排量齿轮泵为模型,运用CFD软件解析齿轮泵内部流场并根据侧板结构特点建立压紧力和反推力的求解微分方程,求得一个轮齿啮合周期内的侧板倾覆力矩变化规律,同时通过建立齿轮泵工作腔压力测试系统对该理论分析结果进行验证,额定工况下：试验值与理论值误差为4.18%,当轮齿转角φ=14°时倾覆力矩达到最大值Ms=82.16N?m。该研究为高压大排量齿轮泵浮动侧板倾覆力矩计算和侧板结构优化设计提供了理论基础和技术支撑。     

铁路综合视频监控系统设计的用户需求研究

结合武汉铁路局京广北线综合视频监控系统工程设计,整理、归纳并对用户需求进行研究,仅供工程设计参考。