基于时延特性建模的多断面短时交通流预测

针对现有交通流预测方法未充分考虑多断面车流演变规律，提出基于时延特性建模的时空相关性计算方法. 该方法采用对不同断面、不同时刻交通流的分布相似性度量，对输入的车辆到达数据序列进行切割构建时空相似度矩阵，得到相邻断面之间的时延参数. 基于时延特性建模，将多断面之间的流量信息进行融合，使用长短时记忆(LSTM)网络进行流量预测. 通过对实际路段数据的预测和结果分析，验证所提方法的有效性和实用性.     

How the environmental impact affects the design of logistics networks based on cost minimization

The degree of centralization of the logistics network is one of the important strategic decisions to take. This issue has often been studied but mainly from a cost minimization focus. This research studies the influence of incorporating the environmental impact in logistics network design models, comparing the results with those obtained considering cost minimization only. A fuzzy biobjective optimization model is used to carry out a number of experiments. By weighting the relative importance of the two objectives, the differences with respect to the base cost minimization solution can be ascertained. Our results show that in general more material is moved through warehouses when the environmental impact is considered and more decentralized facilities are opened.     

Generating lane-based intersection maps from crowdsourcing big trace data

Lane-based road information plays a critical role in transportation systems, a lane-based intersection map is the most important component in a detailed road map of the transportation infrastructure. Researchers have developed various algorithms to detect the spatial layout of intersections based on sensor data such as high-definition images/videos, laser point cloud data, and GPS traces, which can recognize intersections and road segments; however, most approaches do not automatically generate Lane-based Intersection Maps (LIMs). The objective of our study is to generate LIMs automatically from crowdsourced big trace data using a multi-hierarchy feature extraction strategy. The LIM automatic generation method proposed in this paper consists of the initial recognition of road intersections, intersection layout detection, and lane-based intersection map-generation. The initial recognition process identifies intersection and non-intersection areas using spatial clustering algorithms based on the similarity of angle and distance. The intersection layout is composed of exit and entry points, obtained by combining trajectory integration algorithms and turn rules at road intersections. The LIM generation step is finally derived from the intersection layout detection results and lane-based road information, based on geometric matching algorithms. The effectiveness of our proposed LIM generation method is demonstrated using crowdsourced vehicle traces. Additional comparisons and analysis are also conducted to confirm recognition results. Experiments show that the proposed method saves time and facilitates LIM refinement from crowdsourced traces more efficiently than methods based on other types of sensor data.     

基于传播模型的非机动车违规过街行为研究

为研究信号交叉口非机动车违规过街行为，选取西安市的7个信号交叉口，通过视频拍摄获取资料，应用复杂网络来分析非机动车网络的结构特征和演化规律.建立了交叉口非机动车网络，基于SI模型的基本思想，提出了非机动车违规过街行为的传播模型.并通过python程序进行模拟分析，在不同的网络结构和不同的传播率下，获取了非机动车违规过街的行为趋势.结果表明：随着等待时间的增加，一旦有骑行者闯红灯，更多的骑行者将加入到违规过街的行列；在内向度和外向度方面，电动自行车均高于普通自行车；非机动车违规行为随着传播率及非机动车流量的增加而增加.     

Dynamic demand estimation and prediction for traffic urban networks adopting new data sources

Nowadays, new mobility information can be derived from advanced traffic surveillance systems that collect updated traffic measurements, both in fixed locations and over specific corridors or paths. Such recent technological developments point to challenging and promising opportunities that academics and practitioners have only partially explored so far.The paper looks at some of these opportunities within the Dynamic Demand Estimation problem (DDEP). At first, data heterogeneity, accounting for different sets of data providing a wide spatial coverage, has been investigated for the benefit of off-line demand estimation. In an attempt to mimic the current urban networks monitoring, examples of complex real case applications are being reported where route travel times and route choice probabilities from probe vehicles are exploited together with common link traffic measurements.Subsequently, on-line detection of non-recurrent conditions is being recorded, adopting a sequential approach based on an extension of the Kalman Filter theory called Local Ensemble Transformed Kalman Filter (LETKF).Both the off-line and the on-line investigations adopt a simulation approach capable of capturing the highly nonlinear dependence between the travel demand and the traffic measurements through the use of dynamic traffic assignment models. Consequently, the possibility of using collected traffic information is enhanced, thus overcoming most of the limitations of current DDEP approaches found in the literature.     

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.     

A traffic-condition-based route guidance strategy for a single destination road network

Most of existing route guidance strategies achieves user optimal equilibrium by comparing travel time. Measuring travel time, however, might be uneasy on an urban road network. To contend with the issue, the paper mainly considers easily obtained inflow and outflow of a link and road capacity as input, and proposes a route guidance strategy for a single destination road network based on the determination of free-flow or congested conditions on alternative routes. An extended strategy for a complex network and a feedback approximation for avoiding forecast are further explored. Weaknesses of the strategy are also explicitly analyzed. To test the strategy, simulation investigations are conducted on two networks with multiple parallel routes. The results indicate that the strategy is able to provide stable splitting rates and to approximate user optimal equilibrium in different conditions, in particular when traffic demand is high. This strategy has potential to be applied in an urban road network due to its simplicity and easily obtained input data. The strategy is also applicable for single destination if some alternatives and similar routes are available.     

Obsolete Maps and Coastal Management: Case Studies from Northwest Ireland

On dynamic coastal sites, subject to rapid and sometimes unpredictable shoreline changes, management problems can be aggravated if legally authoritative maps are obsolete. These difficulties are illustrated by two case studies from County Donegal in northwest Ireland. The first case study outlines the problems that arise where statutory functional area boundaries are based on a near century-old map. The second case study deals with the problems of planning development on a site where a customized map only a few years old has been rendered obsolete by rapid coastal erosion. Other problems are caused by the inappropriate use of maps. Suggestions are made to mitigate the effects of outdated maps.     

基于GOOSE机制的城市轨道交通中压环网继电保护方案优化

针对目前城市轨道交通中压环网继电保护存在的问题,提出了基于GOOSE(面向通用对象的变电站事件)机制的中压环网的继电保护优化方案,有效地解决了传统过流保护级差配合困难的问题.该方案是以GOOSE光纤以太网为基础,以闭锁逻辑为核心的数字通信电流保护方案.将GOOSE信号进行分类,并对中压供电环网系统各种可能出现的故障进行动作行为分析.最后,通过RTDS(动态数字仿真系统)仿真试验,证明该方案在各种故障情况下,都能保证继电保护的选择性、速动性、灵敏性和可靠性.