Using Incomplete Information for Complete Weight Annotation of Road Networks -- Extended Version

We are witnessing increasing interests in the effective use of road networks. For example, to enable effective vehicle routing, weighted-graph models of transportation networks are used, where the weight of an edge captures some cost associated with traversing the edge, e.g., greenhouse gas (GHG) emissions or travel time. It is a precondition to using a graph model for routing that all edges have weights. Weights that capture travel times and GHG emissions can be extracted from GPS trajectory data collected from the network. However, GPS trajectory data typically lack the coverage needed to assign weights to all edges. This paper formulates and addresses the problem of annotating all edges in a road network with travel cost based weights from a set of trips in the network that cover only a small fraction of the edges, each with an associated ground-truth travel cost. A general framework is proposed to solve the problem. Specifically, the problem is modeled as a regression problem and solved by minimizing a judiciously designed objective function that takes into account the topology of the road network. In particular, the use of weighted PageRank values of edges is explored for assigning appropriate weights to all edges, and the property of directional adjacency of edges is also taken into account to assign weights. Empirical studies with weights capturing travel time and GHG emissions on two road networks (Skagen, Denmark, and North Jutland, Denmark) offer insight into the design properties of the proposed techniques and offer evidence that the techniques are effective.Comment: This is an extended version of "Using Incomplete Information for Complete Weight Annotation of Road Networks," which is accepted for publication in IEEE TKD

Methodology for an integrated modelling of macro and microscopic processes in urban transport demand

The paper presents the theoretical formulation and the underlying assumptions for an activity-based approach of transport demand modelling. Starting with the definition of a time hierarchy of decision-making in the urban environment, rules are formulated that dictate the general hierarchic structure of individuals’ choices in the urban system. The temporal scale defines decisions for activities and their daily sequence, the geographical scale decisions associated to destination choice processes. We build activity plans (number and daily sequence of activities) from an empirical data set and calculate trip paths (time-spatial trajectories including transport modes and travel destinations) assuming consumers to maximize their utility in the decision-making process. First results of the translation of the theoretical model into a real-world application are shown for the city of Santiago, Chile

Activity-based model development to support transport planning in the Stockholm region

The environment in which transportation analysis and infrastructure planning take place has changed dramatically during the last years. The focus is now, to a considerable extent, on how to transform the transportation system in a direction that could be sustainable in the long run, rather than on planning for infrastructure investment to meet new demand. At the same time information technology penetrates all sectors of the society. This will change how the transportation system will be used by travellers and conveyers, both directly, through new products and services, and, indirectly, through a spatial reorganisation of many activities that govern the transport demand. In such a situation it must be questioned whether the analytical tools that may have functioned reasonably well in the past, also are appropriate, or possible to adapt, to be useful for the issues we will face in the future. A survey is made of ideas for model development for travel analysis with an emphasis on activity based models based on an international literature review. The study treats tools for the whole chain from location decisions to network effects. The main focus is on such development that is of interest for a medium-sized city like Stockholm. It stresses demands that might be raised on modelling tools with a background in the planning issues that can expected to be central within the next ten-year period. Different ideas for model development, and existing models that could be considered for implementation, are evaluated with respect to their usefulness for planning, need for resources, demand for competence and data, and obstacles of implementation. Finally, we are suggesting some specific model development that should be tested in Stockholm, including a pilot study concerning the implementation of an activity-based model.

Updating of travel behavior parameters and estimation of vehicle trip-chain data based on plate scanning

This article proposes a maximum-likelihood method to update travel behavior model parameters and estimate vehicle trip chain based on plate scanning. The information from plate scanning consists of the vehicle passing time and sequence of scanned vehicles along a series of plate scanning locations (sensor locations installed on road network). The article adopts the hierarchical travel behavior decision model, in which the upper tier is an activity pattern generation model, and the lower tier is a destination and route choice model. The activity pattern is an individual profile of daily performed activities. To obtain reliable estimation results, the sensor location schemes for predicting trip chaining are proposed. The maximum-likelihood estimation problem based on plate scanning is formulated to update model parameters. This problem is solved by the expectation-maximization (EM) algorithm. The model and algorithm are then tested with simulated plate scanning data in a modified Sioux Falls network. The results illustrate the efficiency of the model and its potential for an application to large and complex network cases

A freight origin-destination synthesis model with mode choice

This paper develops a novel procedure to conduct a Freight Origin-Destination Synthesis (FODS) that jointly estimates the trip distribution, mode choice, and the empty trips by truck and rail that provide the best match to the observed freight traffic counts. Four models are integrated: (1) a gravity model for trip distribution, (2) a binary logit model for mode choice, (3) a Noortman and Van Es’ model for truck, and (4) a Noortman and Van Es’ model for rail empty trips. The estimation process entails an iterative minimization of a nonconvex objective function, the summation of squared errors of the estimated truck and rail traffic counts with respect to the five model parameters. Of the two methods tested to address the nonconvexity, an interior point method with a set of random starting points (Multi-Start algorithm) outperformed the Ordinary Least Squared (OLS) inference technique. The potential of this methodology is examined using a hypothetical example of developing a nationwide freight demand model for Bangladesh. This research improves the existing FODS techniques that use readily available secondary data such as traffic counts and link costs, allowing transportation planners to evaluate policy outcomes without needing expensive freight data collection. This paper presents the results, model validation, limitations, and future scope for improvements

Ambulance Emergency Response Optimization in Developing Countries

The lack of emergency medical transportation is viewed as the main barrier to the access of emergency medical care in low and middle-income countries (LMICs). In this paper, we present a robust optimization approach to optimize both the location and routing of emergency response vehicles, accounting for uncertainty in travel times and spatial demand characteristic of LMICs. We traveled to Dhaka, Bangladesh, the sixth largest and third most densely populated city in the world, to conduct field research resulting in the collection of two unique datasets that inform our approach. This data is leveraged to develop machine learning methodologies to estimate demand for emergency medical services in a LMIC setting and to predict the travel time between any two locations in the road network for different times of day and days of the week. We combine our robust optimization and machine learning frameworks with real data to provide an in-depth investigation into three policy-related questions. First, we demonstrate that outpost locations optimized for weekday rush hour lead to good performance for all times of day and days of the week. Second, we find that significant improvements in emergency response times can be achieved by re-locating a small number of outposts and that the performance of the current system could be replicated using only 30% of the resources. Lastly, we show that a fleet of small motorcycle-based ambulances has the potential to significantly outperform traditional ambulance vans. In particular, they are able to capture three times more demand while reducing the median response time by 42% due to increased routing flexibility offered by nimble vehicles on a larger road network. Our results provide practical insights for emergency response optimization that can be leveraged by hospital-based and private ambulance providers in Dhaka and other urban centers in LMICs