Trip generation and distribution: the inconsistency problem and a possible remedy

There are many shortcomings commonly associated with the conventional urban transportation modeling process. This paper focuses on one of the more important problems — the inconsistency between trip generation and distribution components — and suggests a possible way of alleviating it. The suggested approach involves sorting out the independent effects on tripmaking of origin, destination and travel cost characteristics, and introducing accessibility measures explicitly into the modeling process. The resulting modeling framework can be used to obtain consistent estimates of trip generation and distribution quantities which are responsive to changes in the transportation and spatial systems.     

铁路旅客旅行换乘方案优选算法

为给铁路旅客选择合理的旅行方案提供参考,以旅行目标值与换乘目标值之和最小作为目标函数值,考虑旅客从起点站出发、最终到达终到站、在中转站进出平衡的约束条件,建立旅客旅行换乘方案选择问题的数学模型。分别给出旅行时间、换乘次数、票价、距离、到发时刻和综合指数6种目标权值的确定方法,提出最短路法和列车匹配法2种求解方法。最短路法是通过构造并简化旅客运输网络,求出网络上若干条次短路,再根据各条次短路上列车的接续,构造列车换乘方案网络图,根据该网络的目标权值确定最短路,得到最优换乘方案。列车匹配法是根据列车运行图信息直接搜索发、到站的接续列车集合,求其两列车对应的重合停车站,根据重合停车站集合的情况选择迭代步数,剔除显然不利方案,构成换乘方案,根据方案的权值进行比选,得到最优换乘方案。对2种算法均用C#编程实现,并用现有的全路客票数据进行检算。计算结果表明:2种算法均能得到最优换乘方案;列车匹配法所用计算时间比最短路法少160 ms。     

A Variable Time-Discretization Strategies-Based,Time-Dependent Shortest Path Algorithm for Dynamic Traffic Assignment

Within the simulation-based dynamic traffic assignment (SBDTA) model, the time-dependent shortest path (TDSP) algorithm plays a crucial role in the path-set update procedure by solving for the current optimal auxiliary solution (shortest path). Common types of TDSP algorithms require temporal discretization of link/node time/cost data, and the discretization could affect the solution quality of TDSP and of the overall SBDTA as well. This article introduces two variable time-discretization strategies applicable to TDSP algorithms. The strategies are aimed at determining the optimal time discretization for time-dependent links/nodes travel time data. The first proposed strategy produces a specific discretization interval for each link. The second proposed strategy generates time-varying intervals for the same link over the analysis period. The proposed strategies are implemented in a link-based time-dependent A* algorithm in a SBDTA model DynusT and tested with two numerical experiments on two traffic networks. The results show that the proposed discretization methods achieve the research goal—to flexibly and scalably balance the memory usage and run time for SBDTA without degrading the convergence. This property is rather important when dealing with a large real-world network with a long analysis period.     

交通管制条件下城市道路网络模型及分配算法研究

城市道路网络模型及其算法是城市道路网络分析和分配的基础。本文首先分析了交通管制条件下原有城市道路网络模型和算法的不足,在此基础上提出一种改进模型和算法,并给出算例。这种改进的模型和算法能较好地满足实际分配的要求,在交通规划、交通管理和交通流模拟中都有着十分广阔的应用前景,且已经被成功地应用于郑州市综合交通规划中。     

Design and development of interactive trip planning for web-based transit information systems

This article presents a Web-based transit information system design that uses Internet Geographic Information Systems (GIS) technologies to integrate Web serving, GIS processing, network analysis and database management. A path finding algorithm for transit network is proposed to handle the special characteristics of transit networks, e.g., time-dependent services, common bus lines on the same street, and non-symmetric routing with respect to an origin/destination pair. The algorithm takes into account the overall level of services and service schedule on a route to determine the shortest path and transfer points. A framework is created to categorize the development of transit information systems on the basis of content and functionality, from simple static schedule display to more sophisticated real time transit information systems. A unique feature of the reported Web-based transit information system is the Internet-GIS based system with an interactive map interface. This enables the user to interact with information on transit routes, schedules, and trip itinerary planning. Some map rendering, querying, and network analysis functions are also provided.     

受限路网中汽车行驶最优路径算法及优化实现

实际交通网络不仅包含路网的拓扑关系，还存在大量交通禁行限制。考虑了交通连通性约束所建立的受限路网模型能够更精确地反映实际交通网络。文中提出一种能够在受限路网中寻路的最优路径算法，并具体讨论了算法的优化实现。应用表明该算法可靠高效，可用于实际受限交通网络最优路径规划。     

Stochastic eco-routing in a signalized traffic network

In this paper, an eco-routing algorithm is developed for vehicles in a signalized traffic network. The proposed method incorporates a microscopic vehicle emission model into a Markov decision process (MDP). Instead of using GPS-based vehicle trajectory data, which are used by many existing eco-routing algorithm, high resolution traffic data including vehicle arrival and signal status information are used as primary inputs. The proposed method can work with any microscopic vehicle model that uses vehicle trajectories as inputs and gives related emission rates as outputs. Furthermore, a constrained eco-routing problem is proposed to deal with the situation where multiple costs present. This is done by transferring the original MDP based formulation to a linear programming formulation. Besides the primary cost, additional costs are considered as constraints. Two numerical examples are given using the field data obtained from City of Pasadena, California, USA. The eco-routing algorithm for single objective is compared against the traditional shortest path algorithm, Dijkstra’s algorithm. Average reductions of CO emission around 20% are observed.     

Airline crew pairing with fatigue: Modeling and analysis

Crew fatigue is one of the main causes of airline accidents. Regulatory authorities such as the Federal Aviation Agency constantly introduce new fatigue regulations, often in the form of hard constraints on the length of duty and rest periods. The complex nature of travel-related fatigue, however, makes it difficult to account for it indirectly through such constraints. Recent studies show that fatigue depends on human factors such as the homeostatic process and the circadian body clock as well as time-zone differences. In this work, we explicitly account for fatigue in crew pairing optimization through the Three Process Model of Alertness, one of the most comprehensive fatigue models available in the literature. We provide a mathematical model for the crew pairing problem that incorporates fatigue and solve it using a column generation approach. Numerical analysis on two real data sets reveals that the proposed approach is able to reduce the crew fatigue levels substantially with minimal impact on cost. In particular, it is shown that hard constraints on fatigue may still lead to high fatigue levels and that jet-lag and time-zone differences have a major impact. The results of the tests also show that some of the rules and regulations in practice may be omitted if the fatigue is accounted for directly.     

Algorithms to find shortest and alternative paths in free flow and congested traffic regimes

Location-based systems can be very helpful to mobile users if they are able to suggest shortest paths to destination taking into account the actual traffic conditions. This would allow to inform the drivers not only about the current shortest paths to destination but also about alternative, timely computed paths to avoid being trapped in the traffic jams signaled by cyber-physical-social systems. To this aim, the paper proposes a set of algorithms that solve very fast the All Pair Shortest Paths problem in both the free flow and congested traffic regimes, for road networks of medium-large size, thus enabling location-based systems to deal with emergencies and critical traffic conditions in city and metropolitan areas, whose transport networks typically range from some hundreds to many thousands of nodes, respectively. The paths to avoid being trapped in the traffic jams are computed by using a simulation of the shockwave propagation, instead of historical data. A parallel version of the algorithms is also proposed to solve the All Pair Shortest Paths problem for metropolitan areas with very large road networks. A time performance analysis of the proposed algorithms for transport networks of various size is carried out.