The representation and implementation of time-dependent inundation in large-scale microscopic evacuation simulations

Multi-agent simulation has increasingly been used for transportation simulation in recent years. With current techniques, it is possible to simulate systems consisting of several million agents. Such multi-agent simulations have been applied to whole cities and even large regions. In this paper it is demonstrated how to adapt an existing multi-agent transportation simulation framework to large-scale pedestrian evacuation simulation. The underlying flow model simulates the traffic-based on a simple queue model where only free speed, bottleneck capacities, and space constraints are taken into account. The queue simulation, albeit simple, captures the most important aspects of evacuations such as the congestion effects of bottlenecks and the time needed to evacuate the endangered area. In the case of an evacuation simulation the network has time-dependent attributes. For instance, large-scale inundations or conflagrations do not cover all the endangered area at once.These time-dependent attributes are modeled as network change events. Network change events are modifying link parameters at predefined points in time. The simulation framework is demonstrated through a case study for the Indonesian city of Padang, which faces a high risk of being inundated by a tsunami.     

Development of a Secondary Crash Identification Algorithm and occurrence pattern determination in large scale multi-facility transportation network

Secondary crash (SC) occurrences are non-recurrent in nature and lead to significant increase in traffic delay and reduced safety. National, state, and local agencies are investing substantial amount of resources to identify and mitigate secondary crashes in order to reduce congestion, related fatalities, injuries, and property damages. Though a relatively small portion of all crashes are secondary, their identification along with the primary contributing factors is imperative. The objective of this study is to develop a procedure to identify SCs using a static and a dynamic approach in a large-scale multimodal transportation networks. The static approach is based on pre-specified spatiotemporal thresholds while the dynamic approach is based on shockwave principles. A Secondary Crash Identification Algorithm (SCIA) was developed to identify SCs on networks. SCIA was applied on freeways using both the static and the dynamic approach while only static approach was used for arterials due to lack of disaggregated traffic flow data and signal-timing information. SCIA was validated by comparison to observed data with acceptable results from the regression analysis. SCIA was applied in the State of Tennessee and results showed that the dynamic approach can identify SCs with better accuracy and consistency. The methodological framework and processes proposed in this paper can be used by agencies for SC identification on networks with minimal data requirements and acceptable computational time.     

Distributed computing approaches for large‐scale probit‐based stochastic user equilibrium problems

Applications of probit‐based stochastic user equilibrium (SUE) principle on large‐scale networks have been largely limited because of the overwhelming computational burden in solving its stochastic network loading problem. A two‐stage Monte Carlo simulation method is recognized to have satisfactory accuracy level when solving this stochastic network loading. This paper thus works on the acceleration of the Monte Carlo simulation method via using distributed computing system. Three distributed computing approaches are then adopted on the workload partition of the Monte Carlo simulation method. Wherein, the first approach allocates each processor in the distributed computing system to solve each trial of the simulation in parallel and in turns, and the second approach assigns all the processors to solve the shortest‐path problems in one trial of the Monte Carlo simulation concurrently. The third approach is a combination of the first two, wherein both different trials of the Monte Carlo simulation as well as the shortest path problems in one trial are solved simultaneously. Performances of the three approaches are comprehensively tested by the Sioux‐Falls network and then a randomly generated network example. It shows that computational time for the probit‐based SUE problem can be largely reduced by any of these three approaches, and the first approach is found out to be superior to the other two. The first approach is then selected to calculate the probit‐based SUE problem on a large‐scale network example. Copyright © 2011 John Wiley & Sons, Ltd.     

Data-driven fuel consumption estimation: A multivariate adaptive regression spline approach

Providing guidance and information to drivers to help them make fuel-efficient route choices remains an important and effective strategy in the near term to reduce fuel consumption from the transportation sector. One key component in implementing this strategy is a fuel-consumption estimation model. In this paper, we developed a mesoscopic fuel consumption estimation model that can be implemented into an eco-routing system. Our proposed model presents a framework that utilizes large-scale, real-world driving data, clusters road links by free-flow speed and fits one statistical model for each of cluster. This model includes predicting variables that were rarely or never considered before, such as free-flow speed and number of lanes. We applied the model to a real-world driving data set based on a global positioning system travel survey in the Philadelphia-Camden-Trenton metropolitan area. Results from the statistical analyses indicate that the independent variables we chose influence the fuel consumption rates of vehicles. But the magnitude and direction of the influences are dependent on the type of road links, specifically free-flow speeds of links. A statistical diagnostic is conducted to ensure the validity of the models and results. Although the real-world driving data we used to develop statistical relationships are specific to one region, the framework we developed can be easily adjusted and used to explore the fuel consumption relationship in other regions.     

Emission rates of intermodal rail/road and road-only transportation in Europe: A comprehensive simulation study

Intermodal rail/road transportation combines advantages of both modes of transport and is often seen as an effective approach for reducing the environmental impact of freight transportation. This is because it is often expected that rail transportation emits less greenhouse gases than road transportation. However, the actual emissions of both modes of transport depend on various factors like vehicle type, traction type, fuel emission factors, payload utilization, slope profile or traffic conditions. Still, comprehensive experimental results for estimating emission rates from heavy and voluminous goods in large-scale transportation systems are hardly available so far. This study describes an intermodal rail/road network model that covers the majority of European countries. Using this network model, we estimate emission rates with a mesoscopic model within and between the considered countries by conducting a large-scale simulation of road-only transports and intermodal transports. We show that there are high variations of emission rates for both road-only transportation and intermodal rail/road transportation over the different transport relations in Europe. We found that intermodal routing is more eco-friendly than road-only routing for more than 90% of the simulated shipments. Again, this value varies strongly among country pairs.     

Large-scale road network vulnerability analysis: a sensitivity analysis based approach

Traditionally, an assessment of transport network vulnerability is a computationally intensive operation. This article proposes a sensitivity analysis-based approach to improve computational efficiency and allow for large-scale applications of road network vulnerability analysis. Various vulnerability measures can be used with the proposed method. For illustrative purposes, this article adopts the relative accessibility index (AI), which follows the Hansen integral index, as the network vulnerability measure for evaluating the socio-economic effects of link (or road segment) capacity degradation or closure. Critical links are ranked according to the differences in the AIs between normal and degraded networks. The proposed method only requires a single computation of the network equilibrium problem. The proposed technique significantly reduces computational burden and memory storage requirements compared with the traditional approach. The road networks of the Sioux Falls city and the Bangkok metropolitan area are used to demonstrate the applicability and efficiency of the proposed method. Network manager(s) or transport planner(s) can use this approach as a decision support tool for identifying critical links in road networks. By improving these critical links or constructing new bypass roads (or parallel paths) to increase capacity redundancy, the overall vulnerability of the networks can be reduced.     

A bi-level model of dynamic traffic signal control with continuum approximation

This paper proposes a bi-level model for traffic network signal control, which is formulated as a dynamic Stackelberg game and solved as a mathematical program with equilibrium constraints (MPEC). The lower-level problem is a dynamic user equilibrium (DUE) with embedded dynamic network loading (DNL) sub-problem based on the LWR model (Lighthill and Whitham, 1955; Richards, 1956). The upper-level decision variables are (time-varying) signal green splits with the objective of minimizing network-wide travel cost. Unlike most existing literature which mainly use an on-and-off (binary) representation of the signal controls, we employ a continuum signal model recently proposed and analyzed in Han et al. (2014), which aims at describing and predicting the aggregate behavior that exists at signalized intersections without relying on distinct signal phases. Advantages of this continuum signal model include fewer integer variables, less restrictive constraints on the time steps, and higher decision resolution. It simplifies the modeling representation of large-scale urban traffic networks with the benefit of improved computational efficiency in simulation or optimization. We present, for the LWR-based DNL model that explicitly captures vehicle spillback, an in-depth study on the implementation of the continuum signal model, as its approximation accuracy depends on a number of factors and may deteriorate greatly under certain conditions. The proposed MPEC is solved on two test networks with three metaheuristic methods. Parallel computing is employed to significantly accelerate the solution procedure.     

Enhancing stated preference surveys in transportation research: the contribution of geographic information systems

In this paper we argue that visualization, data management and computational capabilities of geographic information systems (GIS) can assist transportation stated preference research in capturing the contextual complexity of many transportation decision environments by providing respondents with maps and other spatial and non-spatial information in graphical form that enhance respondents' understanding of decision scenarios. We explore the multiple inherent contributions of GIS to transportation stated preference data collection and propose a framework for a GIS-based stated preference survey instrument. We also present the design concepts of two survey prototypes and their GIS implementation for a sample travel mode choice problem.     

Computing dynamic user equilibria for large-scale transportation networks

In this paper, we present an approach for determining dynamic user equilibria. The method is suitable for disaggregated microscopic and mesoscopic simulation-based models. It is a modification of the convex-simplex method, which disposes with the line search step, and controls the subset of travelers to be re-routed at each step while updating the link travel times after each assignment. To guarantee finite termination, a suitable stopping criterion is adopted. The proposed method is implemented within TRANSIMS, the Transportation Analysis and Simulation System, as a two-stage process that employs a combined use of link performance functions and a microsimulator in order to design a framework suitable for application to real transportation systems. To demonstrate this capability, we apply the developed methodology to a large-scale network, Bignet, which is part of the transportation city network of Portland, Oregon; and a medium-scale network, Blacksburg, Virginia; and provide some comparative analyses. Our results exhibit that an improved distribution of travelers is obtained while consuming less than 17–33% of the effort required by the current version of TRANSIMS.     

Network-oriented household activity pattern problem for system optimization

The recently emerging trend of self-driving vehicles and information sharing technologies, made available by private technology vendors, starts creating a revolutionary paradigm shift in the coming years for traveler mobility applications. By considering a deterministic traveler decision making framework at the household level in congested transportation networks, this paper aims to address the challenges of how to optimally schedule individuals’ daily travel patterns under the complex activity constraints and interactions. We reformulate two special cases of household activity pattern problem (HAPP) through a high-dimensional network construct, and offer a systematic comparison with the classical mathematical programming models proposed by Recker (1995). Furthermore, we consider the tight road capacity constraint as another special case of HAPP to model complex interactions between multiple household activity scheduling decisions, and this attempt offers another household-based framework for linking activity-based model (ABM) and dynamic traffic assignment (DTA) tools. Through embedding temporal and spatial relations among household members, vehicles and mandatory/optional activities in an integrated space-time-state network, we develop two 0–1 integer linear programming models that can seamlessly incorporate constraints for a number of key decisions related to vehicle selection, activity performing and ridesharing patterns under congested networks. The well-structured network models can be directly solved by standard optimization solvers, and further converted to a set of time-dependent state-dependent least cost path-finding problems through Lagrangian relaxation, which permit the use of computationally efficient algorithms on large-scale high-fidelity transportation networks.     

Measuring marginal congestion costs of urban transportation: Do networks matter?

In determining the marginal cost of congestion, economists have traditionally relied upon directly measuring traffic congestion on network links, disregarding any “network effects,” since the latter are difficult to estimate. While for simple networks the comparison of the network-based congestion costs with the link-based ones can be done within a theoretical framework, it is important to know whether such network effects in real large-scale networks are quantitatively significant.In this paper we use a strategic transportation planning model (START) to compare marginal congestion costs computed link-by-link with measures taking into account network effects. We find that while in aggregate network effects are not significant, congestion measured on a single link is a poor predictor of total congestion costs imposed by travel on that link. Also, we analyze the congestion proliferation effect on the network to see how congestion is distributed within an urban area.     

A Modeling Framework for Bus Rapid Transit Operations Evaluation and Service Planning

Abstract

In this paper, we present a dynamic traffic assignment-simulation modeling framework (DYNASMART-P) to support the evaluation and planning of Bus Rapid Transit (BRT) services in urban transportation networks. The model represents the different characteristics associated with BRT operations such as: exclusive right-of-way lanes, limited-stop service, signal prioritization at congested intersections, and enhanced bus stops to reduce passenger boarding times. A set of simulation experiments is conducted using the model to study the impact of introducing a hypothetical BRT service in the Knoxville area in the State of Tennessee. In these experiments, the different operational characteristics of BRT are evaluated in terms of potential impact on transit ridership and on the interacting auto traffic. The results illustrate the advantages of BRT for increasing transit ridership and improving overall system performance.     

Recursive estimation of average vehicle time headway using single inductive loop detector data

Vehicle time headway is an important traffic parameter. It affects roadway safety, capacity, and level of service. Single inductive loop detectors are widely deployed in road networks, supplying a wealth of information on the current status of traffic flow. In this paper, we perform Bayesian analysis to online estimate average vehicle time headway using the data collected from a single inductive loop detector. We consider three different scenarios, i.e. light, congested, and disturbed traffic conditions, and have developed a set of unified recursive estimation equations that can be applied to all three scenarios. The computational overhead of updating the estimate is kept to a minimum. The developed recursive method provides an efficient way for the online monitoring of roadway safety and level of service. The method is illustrated using a simulation study and real traffic data.     

An Internet-based geographic information system that integrates data,models and users for transportation applications

This paper is concerned with the development of an Internet-based geographic information system (GIS) that brings together spatio-temporal data, models and users in a single efficient framework to be used for a wide range of transportation applications – planning, engineering and operational. The functional requirements of the system are outlined taking into consideration the various enabling technologies, such as Internet tools, large-scale databases and distributed computing systems. Implementation issues as well as the necessary models needed to support the system are briefly discussed.     

A mesoscopic model for large-scale simulation of pedestrian dynamics

A mesoscopic pedestrian model is proposed, considering pedestrians as individuals and describing their movement by means of aggregate density-flow relationships. The model builds on a stochastic process, describing transition rates among adjacent sites on a lattice. Each lattice can contain several pedestrians. The approach is minimal and fast to simulate, and, by construction, capable of capturing population heterogeneity as well as variability in walking behaviour and en-route path choice. The model is more efficient than microscopic models, and potentially more accurate than macroscopic ones. We calibrate and validate the model using real data and carry out several numerical experiments to present its key properties and possible applications for simulation of large-scale scenarios.     

Complementarity formulations for the cell transmission model based dynamic user equilibrium with departure time choice, elastic demand and user heterogeneity

In this paper we formulate the dynamic user equilibrium problem with an embedded cell transmission model on a network with a single OD pair, multiple parallel paths, multiple user classes with elastic demand. The formulation is based on ideas from complementarity theory. The travel time is estimated based on two methods which have different transportation applications: (1) maximum travel time and (2) average travel time. These travel time functions result in linear and non-linear complementarity formulations respectively. Solution existence and the properties of the formulations are rigorously analyzed. Extensive computational experiments are conducted to demonstrate the benefits of the proposed formulations on various test networks.     

Platooning for sustainable freight transportation: an adoptable practice in the near future?

ABSTRACT

Platooning is an emerging transportation practice that has the potential to solve the problems of the burgeoning transportation industry. A platoon is a group of vehicles, with vehicle to vehicle communication, that travel closely behind one another such that the platoon can accelerate, brake and cruise together. Platoons can improve road safety, be energy efficient and reduce costs. Its complete socio-economic benefits include congestion mitigation, smoother traffic flow, better lane usage and throughput, incentives for green logistics and driver safety. The long-term effect of platooning on road transportation, if extensively deployed, would be better organised traffic flow and efficient tracking of vehicles on the road ushering a multilevel positive impact on the industry. In this study, we attempt to answer the critical question of whether platooning is an adoptable practice in the near future and discuss an agenda to take platooning closer to implementation on the ground by highlighting the opportunities for future research. We also present a conceptual framework to help researchers, academicians, policy makers and practitioners for the adoption of platooning into the transportation industry.     

A mesoscopic integrated urban traffic flow-emission model

Due to the noticeable environmental and economical problems caused by traffic congestion and by the emissions produced by traffic, analysis and control of traffic is essential. One of the various traffic analysis approaches is the model-based approach, where a mathematical model of the traffic system is developed/used based on the governing physical rules of the system. In this paper, we propose a framework to interface and integrate macroscopic flow models and microscopic emission models. As a result, a new mesoscopic integrated flow-emission model is obtained that provides a balanced trade-off between high accuracy and low computation time. The proposed approach considers an aggregated behavior for different groups of vehicles (mesoscopic) instead of considering the behavior of individual vehicles (microscopic) or the entire group of vehicles (macroscopic). A case study is done to evaluate the proposed framework, considering the performance of the resulting mesoscopic integrated flow-emission model. The traffic simulation software SUMO combined with the microscopic emission model VT-micro is used as the comparison platform. The results of the case study prove that the proposed approach provides excellent results with high accuracy levels. In addition, the mesoscopic nature of the integrated flow-emission model guarantees a low CPU time, which makes the proposed framework suitable for real-time model-based applications.     

Multi-agent simulation of individual mobility behavior in carpooling

Carpooling is an emerging alternative transportation mode that is eco-friendly and sustainable as it enables commuters to save time, travel resource, reduce emission and traffic congestion. The procedure of carpooling consists of a number of steps namely; (i) create a motive to carpool, (ii) communicate this motive with other agents, (iii) negotiate a plan with the interested agents, (iv) execute the agreed plans, and (v) provide a feedback to all concerned agents. In this paper, we present a conceptual design of an agent-based model (ABM) for the carpooling a that serves as a proof of concept. Our model for the carpooling application is a computational model that is used for simulating the interactions of autonomous agents and to analyze the effects of change in factors related to the infrastructure, behavior and cost. In our carpooling application, we use agent profiles and social networks to initiate our agent communication model and then employ a route matching algorithm, and a utility function to trigger the negotiation process between agents. We developed a prototype of our agent-based carpooling application based on the work presented in this paper and carried out a validation study of our results with real data collected in Flanders, Belgium.