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.     

System energy optimisation strategies for metros with regeneration

Energy and environmental sustainability in transportation are becoming ever more important. In Europe, the transportation sector is responsible for about 30% of the final end use of energy. Electrified railway systems play an important role in contributing to the reduction of energy usage and CO₂ emissions compared with other transport modes. For metro-transit systems with frequently motoring and braking trains, the effective use of regenerated braking energy is a significant way to reduce the net energy consumption. Although eco-driving strategies have been studied for some time, a comprehensive understanding of how regeneration affects the overall system energy consumption has not been developed. This paper proposes a multi-train traction power network modelling method to determine the system energy flow of the railway system with regenerating braking trains. The initial results show that minimising traction energy use is not the same as minimising the system energy usage in a metro system. An integrated optimisation method is proposed to solve the system energy-saving problem, which takes train movement and electrical power flow into consideration. The results of a study of the Beijing Yizhuang metro line indicate that optimised operation could reduce the energy consumption at the substations by nearly 38.6% compared to that used with the existing ATO operation.     

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.     

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.     

Closed-form multiclass cell transmission model enhanced with overtaking,lane-changing,and first-in first-out properties

A novel multiclass macroscopic model is proposed in this article. In order to enhance first-in, first-out property (FIFO) and transmission function in the multiclass traffic modeling, a new multiclass cell transmission model with FIFO property (herein called FM-CTM) is extended from its prior multiclass cell transmission model (M-CTM). Also, to enhance its analytical compactness and resultant computational convenience, FM-CTM is formulated in this paper as a set of closed-form matrix equations. The objective is to improve the accuracy of traffic state estimation by enforcing FIFO property when a fast vehicle cannot overtake a slow vehicle due to a limitation of a single-lane road. Moreover, the proposed model takes into account a different priority for vehicles of each class to move forward through congested road conditions, and that makes the flow calculation independent from their free-flow speeds. Some hypothetical and real-world freeway networks with a constant or varying number of lanes are selected to verify FM-CTM by comparing with M-CTM and the conventional CTM. Observed densities of VISSIM and real-world dataset of I-80 are selected to compare with the simulated densities from the three CTMs. The numerical results show that FM-CTM outperforms the other two models by 15% of accuracy measures in most cases. Therefore, the proposed model is expected to be well applicable to the road network with a mixed traffic and varying number of lanes.     

Toward using social media to support ridesharing services: challenges and opportunities

Ridesharing has been attracting increasing attention from both academia and industry. One of the challenges posed by the study of ridesharing is to identify the most valuable information for improving the ridesharing decisions taken by participants. Another challenge is to use harvesting techniques to extract specific types of travel-related information. Many methods have been developed by the community in order to solve these issues. However, due to a lack of information sharing between different transit authorities and the difficulty of identifying subjective perceptions of the experience of ridesharing, understanding and evaluating how social media data might support or obstruct goals for mobility, safety and environmental sustainability in ridesharing is a difficult task. In this survey, we first analyze the literature on ridesharing with a focus on the properties and model of service, and introduce a framework to describe the major components required for a ridesharing service. Then, we illustrate the potential value of information extracted from social media and present the rationale for harvesting travel-related data. Finally, we detail some possible directions and different approaches for using social media data, and highlight their assets and drawbacks.     

河北省内河水上交通安全管理探析

河北省内河许多水域安全基础设施简陋,缺乏必要的安全保障措施,已严重影响水上交通安全管理工作的正常进行．进而在一定程度上制约地方经济发展。通过对当前河北省内河水上交通安全现状的研究,系统分析我省内河水上交通安全管理的特点。并在法制法规、资金筹措、制度建设等方面提出观点和建议。     

简述信息化管理在交通工程安全管理中的应用

交通工程安全管理工作开展时,为全面提升交通工程安全管理水平与效能,应当合理应用信息化管理技术,建构现代化交通工程安全管理体系与模式,不断推动我国交通事业高质量发展.本文就信息化管理在交通工程安全管理工作中的实际应用进行分析探讨.     

基于GIS的港口防台应急辅助决策与指挥系统研究

台风防御是我国东南沿海各港口＂三防＂工作的重中之重。分析了目前我国港口防台工作的不足之处,提出了利用地理信息技术解决目前存在的问题,设计并开发了港口防台应急辅助决策与指挥系统。在软件整体架构设计、功能模块设计、数据设计等方面进行了研究,并介绍了＂厦门港防台应急指挥系统＂的应用情况。     

A new logit‐artificial neural network ensemble for mode choice modeling: a case study for border transport

Logit model is one of the statistical techniques commonly used for mode choice modeling, while artificial neural network (ANN) is a very popular type of artificial intelligence technique used for mode choice modeling. Ensemble learning has evolved to be very effective approach to enhance the performance for many applications through integration of different models. In spite of this advantage, the use of ANN‐based ensembles in mode choice modeling is under explored. The focus of this study is to investigate the use of aforementioned techniques for different number of transportation modes and predictor variables. This study proposes a logit‐ANN ensemble for mode choice modeling and investigates its efficiency in different situations. Travel between Khobar‐Dammam metropolitan area of Saudi Arabia and Kingdom of Bahrain is selected for mode choice modeling. The travel on this route can be performed mainly by air travel or private vehicle through King Fahd causeway. The results show that the proposed ensemble gives consistently better accuracies than single models for multinomial choice problems irrespective of number of input variables. Copyright © 2015 John Wiley & Sons, Ltd.