Weekly Fleet Assignment Model and Algorithm

A 0-1 integer programming model for weekly fleet assignment was put forward based on linear network and weekly flight scheduling in China. In this model, the objective function is to maximize the total profit of fleet assignment, subject to the constraints of coverage, aircraft flow balance, fleet size, aircraft availability, aircraft usage, flight restriction, aircraft seat capacity, and stopover. Then the branch-and-bound algorithm based on special ordered set was applied to solve the model. At last, a real-world case study on an airline with 5 fleets, 48 aircrafts and 1786 flight legs indicated that the profit increase was $1591276 one week and the running time was no more than 4 min, which shows that the model and algorithm are fairly good for domestic airline.     

飞机排班数学规划模型

分析了国内航空公司普遍采用的单枢纽线性航线结构以及飞机排班工作流程和要求,研究了描述飞机排班问题的数学模型构造方法,引入“航班节”的概念,将一个具体的飞机排班问题归结为三种典型排班模式中的一种,即基于飞机调度指令要求的排班问题、基于最少需用飞机数的排班问题、基于飞机使用均衡要求的排班问题。应用结果表明平均每架飞机分配的航班任务时间与期望飞行时间的偏差仅为4．8min,而且得到飞机排班方案的时间不到23s,因此此飞机排班模式是解决单枢纽线性航线结构下的飞机排班问题的一种有效方法。     

���·�����㷨�ڽ�ͨ�����е�Ӧ��

拍卖算法是由Bertsekas教授提出的一种求解有向网络图最短路径的新算法，已经发展成为求解线性网络流问题的综合算法。应用分析对比法进行研究．介绍了拍卖算法，分析了其特点，与常用的标号设定算法和标号修正算法进行了对比。最短路拍卖算法特别适合于并行计算和大规模稀疏网络的求解，符合现实路网的特点和交通分配的要求，并且便于程序化．通过各种途径对基本算法进行改进、加速，可使计算速度提高数倍。拍卖算法可以快速求出多个起点和一个终点以及一个起点和多个终点的情况，适应不同分配算法的需求。在交通分配中，只要根据需求选择不同的起点集和终点集即可，不必求得所有节点对之间的最短路，避免大量不必要的计算，大大节省计算时间，在交通领域具有广阔的应用前景。     

��Ϣ�����ö��������Ӱ��������

信息化是现代交通发展的特征之一.信息化作用对道路交通配流的影响分析是智能交通的基础.本文在国、内外研究成果的基础上,从交通出行效益、交通量代替作用、理想信息化状态下交通流分布特点以及信息化水平、质量与信息接受水平对配流影响等多角度,将信息化对交通流分布影响进行了机理分析,并提出了在配流过程中考虑信息化因素的建模思路,为进一步量化信息因素对交通的影响作用,实现交通信息化、智能化管理提供依据.     

SUE�����м��ֳ���·��ѡ��ģ�͵ıȽ��о�

对SUE问题中几种常用的路线选择模型进行了分类研究，重点介绍了它们各自的理论基础并比较了其差异，且通过多个算例分析了它们各自的表现效果．结果表明，同一网络中各个模型的表现效果不一定相同，不同网络中同一模型的表现效果也有所差异．这一研究对交通配流中的路线选择问题具有重要的指导意义，表明现有研究中常出现的通过单个选择模型或单个网络得出的结论并不一定可靠，应该根据模型和网络的特点谨慎选择．     

Including passengers’ response to crowding in the Dutch national train passenger assignment model

Transit passengers’ response to crowded conditions has been studied empirically, yet is limitedly included in transport models currently used in the design of policy and infrastructure investments. This has consequences for the practical applicability of these models in studies on, for instance, timetabling, train capacity management strategies, project appraisal, and passenger satisfaction. Here we propose four methods to include the effect of crowding, based on existing studies on passengers’ perception and response as well as often-used crowding indicators. These four alternative methods are implemented in the train passenger assignment procedure of the Dutch national transport model, and evaluated with respect to their impacts on the model results for the Dutch railway network. The four methods relate to four different ways in which an additive trip penalty and/or time-multiplier can be incorporated in the train utility function for different travel purposes, to capture the disutility of crowding as measured by the load factor. The analyses of the test case favor the hybrid method using both a boarding penalty (capturing seat availability upon boarding) and a time-multiplier (capturing physical comfort and safety throughout the trip). This method produces consistent results, while the additional computational effort that it imposes is acceptable. Further empirical underpinning is needed to conclusively show which of these methods best captures passengers’ response behavior quantitatively (for different travel purposes and conditions).     

System optimal dynamic traffic assignment: Properties and solution procedures in the case of a many-to-one network

Thanks to its high dimensionality and a usually non-convex constraint set, system optimal dynamic traffic assignment remains one of the most challenging problems in transportation research. This paper identifies two fundamental properties of the problem and uses them to design an efficient solution procedure. We first show that the non-convexity of the problem can be circumvented by first solving a relaxed problem and then applying a traffic holding elimination procedure to obtain the solution(s) of the original problem. To efficiently solve the relaxed problem, we explore the relationship between the relaxed problems based on different traffic flow models (PQ, SQ, CTM) and a minimal cost flow (MCF) problem for a special space-expansion network. It is shown that all the four problem formulations produce the same minimal system cost and share one common solution which does not involve inside queues in the network. Efficient solution algorithms such as the network simplex method can be applied to solve the MCF problem and identify such an optimal traffic pattern. Numerical examples are also presented to demonstrate the efficiency of the proposed solution procedure.     

Implementing first-in–first-out in the cell transmission model for networks

In traffic assignment models with time-varying flows (dynamic network loading or dynamic traffic assignment), overtaking behaviour is normally not included in the model and, in that case, it is important that the model at least approximates first-in–first-out (FIFO), to prevent deviations from FIFO that are arbitrary or unrealistic or not physically possible. For the cell transmission model (CTM) it has recently been shown that the usual recommended method for preserving FIFO will ensure FIFO for each cell taken separately but does not fully ensure FIFO in the transition between cells and hence does not fully ensure FIFO for sequences of cells or for links or for routes. As a result, deviations from FIFO can easily occur and cumulate along the links or routes. In view of that, we define and analyse three different levels of satisfaction or approximation of FIFO, together with corresponding methods for achieving them. Two of these are existing methods and one is new. We develop, analyse and compare the three methods and the extent to which each of them adheres to FIFO for sequences of cells and links or routes. Also, for two of the methods we present a more detailed algorithm for applying them within the CTM. The paper is concerned with how to implement FIFO in the CTM and not with testing for FIFO or measuring deviations from FIFO.     

An improved Dial's algorithm for logit-based traffic assignment within a directed acyclic network

Abstract

Dial's algorithm is one of the most effective and popular procedures for a logit-type stochastic traffic assignment, as it does not require path enumeration over a network. However, a fundamental problem associated with the algorithm is its simple definition of ‘efficient paths’, which sometimes produces unrealistic flow patterns. In this paper, an improved algorithm based on the route extension coefficient is proposed in order to circumvent this problem, in which ‘efficient paths’ simultaneously consider link travel cost and minimum travel cost. Path enumeration is still not required and a similar computing efficiency with the original algorithm is guaranteed. A limitation of the algorithm is that it can only be applied to a directed acyclic network because a topological sorting algorithm is used to decide the order of the sequential calculation. A numerical example based on the Beijing subway network illustrates the effectiveness of the proposed algorithm. It is found that it is able to exclude most unrealistic paths, but include all reasonable paths when compared with path enumeration and the original Dial's algorithm.     

简述视频监控系统在地铁通信中的集成与施工经验

为了使读者更多了解视频监控系统在地铁中的应用,简要讲述地铁通信中视频监控系统的集成方案选取、互联互通、录像存储、视频传输及相关施工方面的经验。