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.     

基于BP网络的球鼻首参数化优化

本文以某集装箱船为研究对象,对降速航行后的球鼻首进行优化。采用Catia建立船体三维模型,为了产生不同形状的球鼻首,选取球鼻特征参数来描述其基本结构;采用拉丁超立方试验抽样方法得到12组不同形状的球鼻首,提出运用非线性拟合能力较强的BP网络构建球鼻首参数和阻力系数之间的关系模型;采用遗传算法对训练后的网络进行极值寻优。结果显示,优化船型的阻力系数显著降低,说明该方法对球鼻首的优化有一定的借鉴意义。     

Large-scale dynamic transportation network simulation: A space-time-event parallel computing approach

This paper describes a computationally efficient parallel-computing framework for mesoscopic transportation simulation on large-scale networks. By introducing an overall data structure for mesoscopic dynamic transportation simulation, we discuss a set of implementation issues for enabling flexible parallel computing on a multi-core shared memory architecture. First, we embed an event-based simulation logic to implement a simplified kinematic wave model and reduce simulation overhead. Second, we present a space-time-event computing framework to decompose simulation steps to reduce communication overhead in parallel execution and an OpenMP-based space-time-processor implementation method that is used to automate task partition tasks. According to the spatial and temporal attributes, various types of simulation events are mapped to independent logical processes that can concurrently execute their procedures while maintaining good load balance. We propose a synchronous space-parallel simulation strategy to dynamically assign the logical processes to different threads. The proposed method is then applied to simulate large-scale, real-world networks to examine the computational efficiency under different numbers of CPU threads. Numerical experiments demonstrate that the implemented parallel computing algorithm can significantly improve the computational efficiency and it can reach up to a speedup of 10 on a workstation with 32 computing threads.     

Forecasting current and next trip purpose with social media data and Google Places

Trip purpose is crucial to travel behavior modeling and travel demand estimation for transportation planning and investment decisions. However, the spatial-temporal complexity of human activities makes the prediction of trip purpose a challenging problem. This research, an extension of work by Ermagun et al. (2017) and Meng et al. (2017), addresses the problem of predicting both current and next trip purposes with both Google Places and social media data. First, this paper implements a new approach to match points of interest (POIs) from the Google Places API with historical Twitter data. Therefore, the popularity of each POI can be obtained. Additionally, a Bayesian neural network (BNN) is employed to model the trip dependence on each individual’s daily trip chain and infer the trip purpose. Compared with traditional models, it is found that Google Places and Twitter information can greatly improve the overall accuracy of prediction for certain activities, including “EatOut”, “Personal”, “Recreation” and “Shopping”, but not for “Education” and “Transportation”. In addition, trip duration is found to be an important factor in inferring activity/trip purposes. Further, to address the computational challenge in the BNN, an elastic net is implemented for feature selection before the classification task. Our research can lead to three types of possible applications: activity-based travel demand modeling, survey labeling assistance, and online recommendations.     

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.