多类型信息下的网络交通流演化模型

交通信息发布机构提供描述信息和规范信息给不同的出行者，描述信息接收者依据信息和经验更新路径行程时间认知，根据认知选择路径；规范信息接收者仅根据经验更新认知.规范信息遵从者选择推荐路径，非遵从者依据认知选择路径.两类信息遵从率都取决于信息准确度.依据非线性动力学理论分析了模型性质，研究表明，模型不动点存在但是不一定唯一，不动点状态与信息混合使用情况有关.数值试验结果表明，模型不动点与随机用户均衡点不同，以恰当比例混合使用两类信息可提高交通流稳定性.     

考虑拥堵空间排队与溢出的道路网静态交通流分配

为刻画拥堵空间排队与溢出现象对交通流分配的影响，提出考虑拥堵空间排队与溢出的道路网静态交通流分配问题，并构建相关的求解算法，用于描述交通需求在起讫点移动过程中路网整体的宏观运行状态。首先，丰富和完善考虑拥堵空间排队与溢出的静态交通流分配的相关假设，提出次生瓶颈、拥堵干扰与渗透和分段化路段阻抗等基本概念和理论，来刻画拥堵交通瓶颈、拥堵空间排队等交通现象；其次，建立网络瓶颈识别算法和空间排队回溯算法，基于此构建考虑拥堵空间排队和溢出的增量分配算法，用于求解交通流分配的结果；最后，通过使用一个具有说明型的算例进行对比分析。研究结果表明：建立的瓶颈识别、排队回溯和增量分配算法可以识别路网中的瓶颈位置及其拥堵排队区域，并可计算得到各路段上的分段分配流量；与点排队只影响瓶颈路段的运行状况和均一的路段分配结果相比，可有效描述路网整体的宏观运行状态以及由于拥堵空间排队所导致的拥堵干扰与渗透现象；不同于“时间片”的伪动态交通流分配模型，新建算法的分配结果是“全时段”与“整体性”的路网宏观运行状态，包含了拥堵瓶颈的具体位置和空间排队的干扰与渗透情况；一般拥堵点排队模型和基于“时间片”的拥堵空间排队模型难以刻画拥堵干扰与渗透现象以及路网整体的宏观运行状态，故所建立的分配方法是对传统拥堵交通流分配的丰富和发展。     

应用交通仿真软件PARAMICS验证交通分配模型

为了考察交通分配模型能够在多大程度上反映现实的交通状况，需要对交通分配模型进行验证，本文阐述了利用微观交通仿软件PARAMICS对交通分配模型进行验证的研究思路。通过建模工具Modeller提供的图形界面，研究者不但能够非常直观地观察交通分配模型的效果，而且可以利用其分析工具Analyser对结果全面分析。因此RARAMICS是一个验证交通分配模型性能优良的平台。     

Development and calibration of a long-distance passenger traffic assignment model

This paper studies the assignment of long-distance passenger traffic on a highway corridor network. First, we propose a traditional model for the long-distance traffic assignment considering interactions with local commuter traffic. It addresses the effect of local networks on highway corridors. An iterative algorithm is developed to solve for the exact solution. Then, to address the potential computational issues that arise therein, a decomposition method is proposed by introducing a new concept of corridor elasticity. An assignment procedure for long-distance passenger traffic is developed accordingly. Numerical tests show that the proposed decomposition method makes significant improvements in computational performance at a small loss of optimality. This decomposition method well approximates the exact assignment from the traditional formulation, especially when the highway corridors are near-saturation. The proposed decomposition method appears practical for application.     

Tradable network permits: A new scheme for the most efficient use of network capacity

Akamatsu et al. (2006) proposed a new transportation demand management scheme called “tradable bottleneck permits” (TBP), and proved its efficiency properties for a single bottleneck model. This paper explores the properties of a TBP system for general networks. An equilibrium model is first constructed to describe the states under the TBP system with a single OD pair. It is proved that equilibrium resource allocation is efficient in the sense that the total transportation cost in a network is minimized. It is also shown that the “self-financing principle” holds for the TBP system. Furthermore, theoretical relationships between TBP and congestion pricing (CP) are discussed. It is demonstrated that TBP has definite advantages over CP when demand information is not perfect, whereas both TBP and CP are equivalent for the perfect information case. Finally, it is shown that the efficiency result also holds for more general demand conditions.     

Solving the gate assignment problem through the Fuzzy Bee Colony Optimization

In the field of Swarm Intelligence, the Bee Colony Optimization (BCO) has proven to be capable of solving high-level combinatorial problems, like the Flight-Gate Assignment Problem (FGAP), with fast convergence performances. However, given that the FGAP can be often affected by uncertainty or approximation in data, in this paper we develop a new metaheuristic algorithm, based on the Fuzzy Bee Colony Optimization (FBCO), which integrates the concepts of BCO with a Fuzzy Inference System. The proposed method assigns, through the multicriteria analysis, airport gates to scheduled flights based on both passengers’ total walking distance and use of remote gates, to find an optimal flight-to-gate assignment for a given schedule. Comparison of the results with the schedules of real airports has allowed us to show the characteristics of the proposed concepts and, at the same time, it stressed the effectiveness of the proposed method.     

Integrated airline planning: Robust update of scheduling and fleet balancing under demand uncertainty

The airline schedule planning problem is defined as the sequence of decisions that need to be made to obtain a fully operational flight schedule. Historically, the airline scheduling problem has been sequentially solved. However, there have already been many attempts in order to obtain airline schedules in an integrated way. But due to tractability issues it is nowadays impossible to determine a fully operative and optimal schedule with an integrated model which accounts for all the key airline related aspects such as competitive effects, stochastic demand figures and uncertain operating conditions. Airlines usually develop base schedules, which are obtained much time in advance to the day of operations and not accounting for all the related uncertainty. This paper proposes a mathematical model in order to update base schedules in terms of timetable and fleet assignments while considering stochastic demand figures and uncertain operating conditions, and where robust itineraries are introduced in order to ameliorate miss-connected passengers. The proposed model leads to a large-scale problem which is difficult to be solved. Therefore, a novel improved and accelerated Benders decomposition approach is proposed. The analytical work is supported with case studies involving the Spanish legacy airline, IBERIA. The presented approach shows that the number of miss-connected passengers may be reduced when robust planning is applied.     

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.     

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.     

An integrated framework for embedding large-scale dynamic traffic assignment models in advanced traveler information systems

In recent years, increasing attention has been drawn to the development of various applications of intelligent transportation systems (ITS), which are credited with the amelioration of traffic conditions in urban and regional environments. Advanced traveler information systems (ATIS) constitute an important element of ITS by providing potential travelers with information on the network's current performance both en-route and pre-trip. In order to tackle the complexity of such systems, derived from the difficulty of providing real-time estimations of current as well as forecasts of future traffic conditions, a series of models and algorithms have been initiated. This paper proposes the development of an integrated framework for real-time ATIS and presents its application on a large-scale network, that of Thessaloniki, Greece, concluding with a discussion on development and implementation challenges as well as on the advantages and limitations of such an effort.