A hybrid deep learning based traffic flow prediction method and its understanding

Deep neural networks (DNNs) have recently demonstrated the capability to predict traffic flow with big data. While existing DNN models can provide better performance than shallow models, it is still an open issue of making full use of spatial-temporal characteristics of the traffic flow to improve their performance. In addition, our understanding of them on traffic data remains limited. This paper proposes a DNN based traffic flow prediction model (DNN-BTF) to improve the prediction accuracy. The DNN-BTF model makes full use of weekly/daily periodicity and spatial-temporal characteristics of traffic flow. Inspired by recent work in machine learning, an attention based model was introduced that automatically learns to determine the importance of past traffic flow. The convolutional neural network was also used to mine the spatial features and the recurrent neural network to mine the temporal features of traffic flow. We also showed through visualization how DNN-BTF model understands traffic flow data and presents a challenge to conventional thinking about neural networks in the transportation field that neural networks is purely a “black-box” model. Data from open-access database PeMS was used to validate the proposed DNN-BTF model on a long-term horizon prediction task. Experimental results demonstrated that our method outperforms the state-of-the-art approaches.     

Connectivity analysis of the global shipping network by eigenvalue decomposition

ABSTRACT

Maritime shipping necessitates flexible and cost-effective port access worldwide through the global shipping network. This paper presents an efficient method to identify major port communities, and analyses the network connectivity of the global shipping network based on community structure. The global shipping network is represented by a signless Laplacian matrix which can be decomposed to generate its eigenvectors and corresponding eigenvalues. The largest gaps between the eigenvalues were then used to determine the optimal number of communities within the network. The eigenvalue decomposition method offers the advantage of detecting port communities without relying on a priori assumption about the number of communities and the size of each community. By applying this method to a dataset collected from seven world leading liner shipping companies, we found that the ports are clustered into three communities in the global container shipping network, which is consistent with the major container trade routes. The sparse linkages between port communities indicate where access is relatively poor.     

客车捎带模式下高铁快捷货物输送方案研究

以提高高铁快运当日达产品的时效性、收益率为核心,对既有载客动车组捎带模式下的快捷货物输送方案进行优化。借助时空网络以列车运行成本与时间惩罚费用之和最小为目标,同时满足货主时限、列车容量以及列车停站方案等约束,建立输送方案优化模型,通过匈牙利算法,并借助Matlab的Yalmip工具箱求解模型。以兰州西站至天水南站、宝鸡南站及西安北站部分时间段的快捷货物运输需求为背景进行算例分析,验证模型的有效性。结果表明合理估算列车装载容量及货物的延迟时限对输送方案的选择起重要作用。     

Competitiveness of container terminal operating companies in South Korea and the industry–university–government network

Burgeoning container port facilities have fostered intensified competition among container terminal operating companies (CTOCs). However, despite research into their survival strategies which identified antecedents of competitiveness including hard factors such as facilities, available cargo and cargo processing ability, softer factors spanning human resource management, networks and strategic alliances with universities and government agencies in industry–university–government (I–U–G) networks have been overlooked. This study aims to examine both hard and softer antecedents of competitiveness as perceived by 152 professionals in South Korean CTOCs; empirical relationships among these antecedents, I–U–G networks, and competitiveness itself; and the significance of the I–U–G network in establishing and improving competitiveness. Posited antecedents of competitiveness included human resources, facilities, service quality, customer orientation, reputation, and government support policy as independent variables; the I–U–G network as a moderating variable; and competitiveness as a dependent variable. Empirical structural relationships revealed that excepting government support policy, each variable significantly affected CTOC competitiveness. Further, the I–U–G network moderated the relationships between the antecedents of competitiveness and competitiveness. Because an effective I–U–G network was pivotal in controlling CTOC competitiveness, improved competitiveness requires not only differentiation of human resources, facilities, service quality, customer orientation, and reputation factors but also I–U–G network developments.     

考虑空车调配协调的货物列车开行方案优化研究

为实现空车调配与货物列车开行方案协调优化，结合基本运行图架构与车流径路，构建货运时空服务拓展网络。考虑配空与装卸取送、集编发等环节的时间接续要求，节点与区段不对流空车要求，以重车流全程运送与空车配送等广义总费用最少为目标，建立整数规划弧路模型。针对既有算法设计局限性，结合重车或空车配空的时间接续要求，提出将不同的 k 短路重车流方案与空车配空方案相关联的改进可行解构造方法，设计混合差分进化求解算法。实例研究表明，考虑空车调配进行重车、空车流组织协调优化，能够减少空车走行费用，及时满足装车需求，有效保证作业车流配合中转车流集结编组及时挂线，提高方案可实施性。     

Capturing correlation with a mixed recursive logit model for activity-travel scheduling

Representing activity-travel scheduling decisions as path choices in a time–space network is an emerging approach in the literature. In this paper, we model choices of activity, location, timing and transport mode using such an approach and seek to estimate utility parameters of recursive logit models. Relaxing the independence from irrelevant alternatives (IIA) property of the logit model in this setting raises a number of challenges. First, overlap in the network may not fully characterize perceptual correlation between paths, due to their interpretation as activity schedules. Second, the large number of states that are needed to represent all possible locations, times and activity combinations imposes major computational challenges to estimate the model. We combine recent methodological developments to build on previous work by Blom Västberg et al. (2016) and allow to model complex and realistic correlation patterns in this type of network. We use sampled choices sets in order to estimate a mixed recursive logit model in reasonable time for large-scale, dense time-space networks. Importantly, the model retains the advantage of fast predictions without sampling choice sets. In addition to estimation results, we present an extensive empirical analysis which highlights the different substitution patterns when the IIA property is relaxed, and a cross-validation study which confirms improved out-of-sample fit.     

Optimal design of electric vehicle public charging system in an urban network for Greenhouse Gas Emission and cost minimization

In this paper, we address the optimization problem of allocation of Electric Vehicle (EV) public fast charging stations over an urban grid network. The objective is to minimize Greenhouse Gas Emissions (GHG) under multiple constraints including a limited agency budget, accessibility of charging stations in every possible charging request and charging demands during peak hours. Additionally, we address bi-criteria problems to consider user costs as the second objective. A convex parsimonious model that depends on relatively few assumptions and input parameters is proposed and it is shown to be useful for obtaining conceptual insights for high-level planning. In a parametric study using a hypothetical urban network model generated based on realistic parameters, we show that GHG emissions decrease with agency budget, and that the reductions vary depending on multiple factors related to EV market and EV technologies. The optimal solutions found from the bi-criteria problems are shown to be close to the solution minimizing GHG emissions only, meaning that the emission minimizing policy can also minimize user costs.     

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

针对现有交通流预测方法未充分考虑多断面车流演变规律，提出基于时延特性建模的时空相关性计算方法. 该方法采用对不同断面、不同时刻交通流的分布相似性度量，对输入的车辆到达数据序列进行切割构建时空相似度矩阵，得到相邻断面之间的时延参数. 基于时延特性建模，将多断面之间的流量信息进行融合，使用长短时记忆(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.