Solving the Median Shortest Path Problem in the Planning and Design of Urban Transportation Networks Using a Vector Labeling Algorithm

This paper proposes an alternative algorithm to solve the median shortest path problem (MSPP) in the planning and design of urban transportation networks. The proposed vector labeling algorithm is based on the labeling of each node in terms of a multiple and conflicting vector of objectives which deletes cyclic, infeasible and extreme-dominated paths in the criteria space imposing cyclic break (CB), path cost constraint (PCC) and access cost parameter (ACP) respectively. The output of the algorithm is a set of Pareto optimal paths (POP) with an objective vector from predetermined origin to destination nodes. Thus, this paper formulates an algorithm to identify a non-inferior solution set of POP based on a non-dominated set of objective vectors that leaves the ultimate decision to decision-makers. A numerical experiment is conducted using an artificial transportation network in order to validate and compare results. Sensitivity analysis has shown that the proposed algorithm is more efficient and advantageous over existing solutions in terms of computing execution time and memory space used.     

Estimating origin‐destination matrices from link volume counts: a simple intercity auto travel demand model for Sri Lanka

The cost of nation wide travel surveys is high. Hence in many developing countries, planners have found it difficult to develop intercity transportation plans due to the non availability of origin‐destination trip matrices. This paper will describe a method for the intercity auto travel estimation for Sri Lanka with link traffic volume data.

The paper outlines the rationale of selecting the district capitals of Sri Lanka as its “cities,” the methodology for selecting the intercity road network, determination of link travel times from express bus schedules and the location of link volume counting positions.

Initially, the total auto travel demand model is formulated with various trip purpose sub‐models. This model is finally modified to a simple demand model with district urban population and travel times between city pairs as the exogenous variables, to overcome statistical estimation difficulties. The final demand model has statistics within the acceptable regions.

The advantages of a simple model are discussed and possible extensions are proposed.     

The dynamic shortest path problem with time-dependent stochastic disruptions

The dynamic shortest path problem with time-dependent stochastic disruptions consists of finding a route with a minimum expected travel time from an origin to a destination using both historical and real-time information. The problem is formulated as a discrete time finite horizon Markov decision process and it is solved by a hybrid Approximate Dynamic Programming (ADP) algorithm with a clustering approach using a deterministic lookahead policy and value function approximation. The algorithm is tested on a number of network configurations which represent different network sizes and disruption levels. Computational results reveal that the proposed hybrid ADP algorithm provides high quality solutions with a reduced computational effort.     

A computational model for the probit‐based dynamic stochastic user optimal traffic assignment problem

This paper focuses on computational model development for the probit‐based dynamic stochastic user optimal (P‐DSUO) traffic assignment problem. We first examine a general fixed‐point formulation for the P‐DSUO traffic assignment problem, and subsequently propose a computational model that can find an approximated solution of the interest problem. The computational model includes four components: a strategy to determine a set of the prevailing routes between each origin–destination pair, a method to estimate the covariance of perceived travel time for any two prevailing routes, a cell transmission model‐based traffic performance model to calculate the actual route travel time used by the probit‐based dynamic stochastic network loading procedure, and an iterative solution algorithm solving the customized fixed‐point model. The Ishikawa algorithm is proposed to solve the computational model. A comparison study is carried out to investigate the efficiency and accuracy of the proposed algorithm with the method of successive averages. Two numerical examples are used to assess the computational model and the algorithm proposed. Results show that Ishikawa algorithm has better accuracy for smaller network despite requiring longer computational time. Nevertheless, it could not converge for larger network. Copyright © 2010 John Wiley & Sons, Ltd.     

Modelling route choice behaviour in a tolled road network with a time surplus maximisation bi-objective user equilibrium model

In this paper, we propose a novel approach to model route choice behaviour in a tolled road network with a bi-objective approach, assuming that all users have two objectives: (1) minimise travel time; and (2) minimise toll cost. We assume further that users have different preferences in the sense that for any given path with a specific toll, there is a limit on the time that an individual would be willing to spend. Different users can have different preferences represented by this indifference curve between toll and time. Time surplus is defined as the maximum time minus the actual time. Given a set of paths, the one with the highest (or least negative) time surplus will be the preferred path for the individual. This will result in a bi-objective equilibrium solution satisfying the time surplus maximisation bi-objective user equilibrium (TSmaxBUE) condition. That is, for each O–D pair, all individuals are travelling on the path with the highest time surplus value among all the efficient paths between this O–D pair.We show that the TSmaxBUE condition is a proper generalisation of user equilibrium with generalised cost function, and that it is equivalent to bi-objective user equilibrium. We also present a multi-user class version of the TSmaxBUE condition and demonstrate our concepts with illustrative examples.     

Estimating freeway route travel time distributions with consideration to time‐of‐day,inclement weather,and traffic incidents

This paper develops an efficient probabilistic model for estimating route travel time variability, incorporating factors of time‐of‐day, inclement weather, and traffic incidents. Estimating the route travel time distribution from historical link travel time data is challenging owing to the interactions among upstream and downstream links. Upon creating conditional probability function for each link travel time, we applied Monte Carlo simulation to estimate the total travel time from origin to destination. A numerical example of three alternative routes in the City of Buffalo shows several implications. The study found that weather conditions, except for snow, incur minor impact on off‐peak and weekend travel time, whereas peak travel times suffer great variations under different weather conditions. On top of that, inclement weather exacerbates route travel time reliability, even when mean travel time increases moderately. The computation time of the proposed model is linearly correlated to the number of links in a route. Therefore, this model can be used to obtain all the origin to destination travel time distributions in an urban region. Further, this study also validates the well‐known near‐linear relation between the standard deviation of travel time per unit distance and the corresponding mean value under different weather conditions. Copyright © 2016 John Wiley & Sons, Ltd.     

Finding time‐robust fuel‐efficient paths for a call‐taxi in a stochastic city road network

Intra‐city commuting is being revolutionized by call‐taxi services in many developing countries such as India. A customer requests a taxi via phone, and it arrives at the right time and at the right location for the pick‐up. This mode of intra‐city travel has become one of the most reliable and convenient modes of transportation for customers traveling for business and non‐business purposes. The increased number of vehicles on city roads and raising fuel costs has prompted a new type of transportation logistics problem of finding a fuel‐efficient and quickest path for a call‐taxi through a city road network, where the travel times are stochastic. The stochastic travel time of the road network is induced by obstacles such as the traffic signals and intersections. The delay and additional fuel consumption at each of these obstacles are calculated that are later imputed to the total travel time and fuel consumption of a path. A Monte‐Carlo simulation‐based approach is proposed to identify unique fuel‐efficient paths between two locations in a city road network where each obstacle has a delay distribution. A multi‐criteria score is then assigned to each unique path based on the probability that the path is fuel efficient, the average travel time of the path and the coefficient of variation of the travel times of the path. Copyright © 2016 John Wiley & Sons, Ltd.     

An improved Dial's algorithm for logit-based traffic assignment within a directed acyclic network

Abstract

Dial's algorithm is one of the most effective and popular procedures for a logit-type stochastic traffic assignment, as it does not require path enumeration over a network. However, a fundamental problem associated with the algorithm is its simple definition of ‘efficient paths’, which sometimes produces unrealistic flow patterns. In this paper, an improved algorithm based on the route extension coefficient is proposed in order to circumvent this problem, in which ‘efficient paths’ simultaneously consider link travel cost and minimum travel cost. Path enumeration is still not required and a similar computing efficiency with the original algorithm is guaranteed. A limitation of the algorithm is that it can only be applied to a directed acyclic network because a topological sorting algorithm is used to decide the order of the sequential calculation. A numerical example based on the Beijing subway network illustrates the effectiveness of the proposed algorithm. It is found that it is able to exclude most unrealistic paths, but include all reasonable paths when compared with path enumeration and the original Dial's algorithm.     

A traffic flow simulator for short‐term travel time forecasting

This paper presents an off‐line forecasting system for short‐term travel time forecasting. These forecasts are based on the historical traffic count data provided by detectors installed on Annual Traffic Census (ATC) stations in Hong Kong. A traffic flow simulator (TFS) is developed for short‐term travel time forecasting (in terms of offline forecasting), in which the variation of perceived travel time error and the fluctuations of origin‐destination (O‐D) demand are considered explicitly. On the basis of prior O‐D demand and partial updated detector data, the TFS can estimate the link travel times and flows for the whole network together with their variances and covariances. The short‐term travel time forecasting by O‐D pair can also be assessed and the O‐D matrix can be updated simultaneously. The application of the proposed off‐line forecasting system is illustrated by a numerical example in Hong Kong.     

Network equilibrium for congested multi‐mode networks with elastic demand

This paper proposes an elastic demand network equilibrium model for networks with transit and walking modes. In Hong Kong, the multi‐mode transit system services over 90% of the total journeys and the demand on it is continuously increasing. Transit and walking modes are related to each other as transit passengers have to walk to and from transit stops. In this paper, the multi‐mode elastic‐demand network equilibrium problem is formulated as a variational inequality problem where the combined mode and route choices are modeled in a hierarchical logit structures and the total travel demand for each origin‐destination pair is explicitly given by an elastic demand function. In addition, the capacity constraint for transit vehicles and the effects of bi‐directional flows on walkways are considered in the proposed model. All these congestion effects are taken into account for modeling the travel choices. A solution algorithm is developed to solve the multi‐mode elastic‐demand network equilibrium model. It is based on a Block Gauss‐Seidel decomposition approach coupled with the method of successive averages. A numerical example is used to illustrate the application of the proposed model and solution algorithm.     

Short‐term travel time forecasts for transport information system in hong kong

In this paper, a case study is carried out in Hong Kong for demonstration of the Transport Information System (TIS) prototype. A traffic flow simulator (TFS) is presented to forecast the short‐term travel times that can be served as a predicted travel time database for the TIS in Hong Kong. In the TFS, a stochastic deviation coefficient is incorporated to simulate the minute‐by‐minute fluctuation of traffic flows within the peak hour period. The purposes of the case study are: 1) to show the applicability of the TFS for larger‐scale road network; and 2) to illustrate the short‐term forecasting of path travel times in practice. The results of the case study show that the TFS can be applied to real network effectively. The predicted travel times are compared with the observed travel times on the selected paths for an OD pair. The results show that the observed path travel times fall in the 90% confidence interval of the predicted path travel times.     

International experience with speed limits during and prior to the energy crisis of 1973–4

This paper presents an artificial neural network (ANN) based method for estimating route travel times between individual locations in an urban traffic network. Fast and accurate estimation of route travel times is required by the vehicle routing and scheduling process involved in many fleet vehicle operation systems such as dial‐a‐ride paratransit, school bus, and private delivery services. The methodology developed in this paper assumes that route travel times are time‐dependent and stochastic and their means and standard deviations need to be estimated. Three feed‐forward neural networks are developed to model the travel time behaviour during different time periods of the day‐the AM peak, the PM peak, and the off‐peak. These models are subsequently trained and tested using data simulated on the road network for the City of Edmonton, Alberta. A comparison of the ANN model with a traditional distance‐based model and a shortest path algorithm is then presented. The practical implication of the ANN method is subsequently demonstrated within a dial‐a‐ride paratransit vehicle routing and scheduling problem. The computational results show that the ANN‐based route travel time estimation model is appropriate, with respect to accuracy and speed, for use in real applications.     

An algorithm for finding reasonable paths in transit networks

In this paper, reasonable paths in transit networks are defined as possible paths that satisfy the acceptable time criterion and transfer‐walk criterion. A recursive algorithm for finding all of the reasonable paths in a transit network that does not involve a rapid increase in program run‐time with network size is presented. Realistic transit networks in Hong Kong and Guangzhou were selected as case studies of the different phases of the development of a trip planning system. Transport planning practitioners and potential users were invited to test the system to evaluate its performance. The results of the prototype evaluation were satisfactory, and the viability of the system as a useful tool for supporting decision‐making has been confirmed by the positive feedback that was obtained from survey questionnaires.     

Estimating time dependent O‐D trip tables during peak periods

Intelligent transportation systems (ITS) have been used to alleviate congestion problems arising due to demand during peak periods. The success of ITS strategies relies heavily on two factors: 1) the ability to accurately estimate the temporal and spatial distribution of travel demand on the transportation network during peak periods, and, 2) providing real‐time route guidance to users. This paper addresses the first factor. A model to estimate time dependent origin‐destination (O‐D) trip tables in urban areas during peak periods is proposed. The daily peak travel period is divided into several time slices to facilitate simulation and modeling. In urban areas, a majority of the trips during peak periods are work trips. For illustration purposes, only peak period work trips are considered in this paper. The proposed methodology is based on the arrival pattern of trips at a traffic analysis zone (TAZ) and the distribution of their travel times. The travel time matrix for the peak period, the O‐D trip table for the peak period, and the number of trips expected to arrive at each TAZ at different work start times are inputs to the model. The model outputs are O‐D trip tables for each time slice in the peak period. 1995 data for the Las Vegas metropolitan area are considered for testing and validating the model, and its application. The model is reasonably robust, but some lack of precision was observed. This is due to two possible reasons: 1) rounding‐off, and, 2) low ratio of total number of trips to total number of O‐D pair combinations. Hence, an attempt is made to study the effect of increasing this ratio on error estimates. The ratio is increased by multiplying each O‐D pair trip element with a scaling factor. Better estimates were obtained. Computational issues involved with the simulation and modeling process are discussed.     

A new generalized travel cost based connectivity metric applied to Scandinavian airports

This article proposes a new, generalized travel cost based method to operationalize network accessibility provided by airports. The approach is novel as it integrates features of network topology with multiple quality aspects of scheduled air transport services into one metric. The method estimates generalized travel costs for the full set of feasible travel paths between an airport and all network destinations. Rooftop modeling accounts for schedule delay and isolates the most cost-efficient travel paths per O-D relation. Respecting the assumed arrival time preference of passengers and adjusting for destination importance, connectivity scores are derived. The method is then applied to explore changes in the global connectivity pattern of Scandinavian airports from 2004 to 2018. The results suggest distinct spatial differences throughout the network, but less pronounced in size than suggested by popularly applied connectivity measures. Findings also highlight the importance of the geographical location as a determinate of an airport’s connectivity.     

Designing heterogeneous sensor networks for estimating and predicting path travel time dynamics: An information-theoretic modeling approach

With a particular emphasis on the end-to-end travel time prediction problem, this paper proposes an information-theoretic sensor location model that aims to minimize total travel time uncertainties from a set of point, point-to-point and probe sensors in a traffic network. Based on a Kalman filtering structure, the proposed measurement and uncertainty quantification models explicitly take into account several important sources of errors in the travel time estimation/prediction process, such as the uncertainty associated with prior travel time estimates, measurement errors and sampling errors. By considering only critical paths and limited time intervals, this paper selects a path travel time uncertainty criterion to construct a joint sensor location and travel time estimation/prediction framework with a unified modeling of both recurring and non-recurring traffic conditions. An analytical determinant maximization model and heuristic beam-search algorithm are used to find an effective lower bound and solve the combinatorial sensor selection problem. A number of illustrative examples and one case study are used to demonstrate the effectiveness of the proposed methodology.     

Traffic signal timing problems with environmental and equity considerations

Traffic signal timings in a road network can not only affect total user travel time and total amount of traffic emissions in the network but also create an inequity problem in terms of the change in travel costs of users traveling between different locations. This paper proposes a multi‐objective bi‐level programming model for design of sustainable and equitable traffic signal timings for a congested signal‐controlled road network. The upper level of the proposed model is a multi‐objective programming problem with an equity constraint that maximizes the reserve capacity of the network and minimizes the total amount of traffic emissions. The lower level is a deterministic network user equilibrium problem that considers the vehicle delays at signalized intersections of the network. To solve the proposed model, an approach for normalizing incommensurable objective functions is presented, and a heuristic solution algorithm that combines a penalty function approach and a simulated annealing method is developed. Two numerical examples are presented to show the effects of reserve capacity improvement and green time proportion on network flow distribution and transportation system performance and the importance of incorporating environmental and equity objectives in the traffic signal timing problems. Copyright © 2013 John Wiley & Sons, Ltd.     

Estimating the most likely space–time paths,dwell times and path uncertainties from vehicle trajectory data: A time geographic method

Global Positioning System and other location-based services record vehicles’ spatial locations at discrete time stamps. Considering these recorded locations in space with given specific time stamps, this paper proposes a novel time-dependent graph model to estimate their likely space–time paths and their uncertainties within a transportation network. The proposed model adopts theories in time geography and produces the feasible network–time paths, the expected link travel times and dwell times at possible intermediate stops. A dynamic programming algorithm implements the model for both offline and real-time applications. To estimate the uncertainty, this paper also develops a method based on the potential path area for all feasible network–time paths. This paper uses a set of real-world trajectory data to illustrate the proposed model, prove the accuracy of estimated results and demonstrate the computational efficiency of the estimation algorithm.     

A stochastic multimodal reliable network design problem under adverse weather conditions

This paper formulates a network design problem (NDP) for finding the optimal public transport service frequencies and link capacity expansions in a multimodal network with consideration of impacts from adverse weather conditions. The proposed NDP aims to minimize the sum of expected total travel time, operational cost of transit services, and construction cost of link capacity expansions under an acceptable level of variance of total travel time. Auto, transit, bus, and walking modes are considered in the multimodal network model for finding the equilibrium flows and travel times. In the proposed network model, demands are assumed to follow Poisson distribution, and weather‐dependent link travel time functions are adopted. A probit‐based stochastic user equilibrium, which is based on the perceived expected travel disutility, is used to determine the multimodal route of the travelers. This model also considers the strategic behavior of the public transport travelers in choosing their routes, that is, common‐line network. Based on the stochastic multimodal model, the mean and variance of total travel time are analytical estimated for setting up the NDP. A sensitivity‐based solution algorithm is proposed for solving the NDP, and two numerical examples are adopted to demonstrate the characteristics of the proposed model. Copyright © 2014 John Wiley & Sons, Ltd.     

Travel time estimation from sparse floating car data with consistent path inference: A fixed point approach

Estimation of urban network link travel times from sparse floating car data (FCD) usually needs pre-processing, mainly map-matching and path inference for finding the most likely vehicle paths that are consistent with reported locations. Path inference requires a priori assumptions about link travel times; using unrealistic initial link travel times can bias the travel time estimation and subsequent identification of shortest paths. Thus, the combination of path inference and travel time estimation is a joint problem. This paper investigates the sensitivity of estimated travel times, and proposes a fixed point formulation of the simultaneous path inference and travel time estimation problem. The methodology is applied in a case study to estimate travel times from taxi FCD in Stockholm, Sweden. The results show that standard fixed point iterations converge quickly to a solution where input and output travel times are consistent. The solution is robust under different initial travel times assumptions and data sizes. Validation against actual path travel time measurements from the Google API and an instrumented vehicle deployed for this purpose shows that the fixed point algorithm improves shortest path finding. The results highlight the importance of the joint solution of the path inference and travel time estimation problem, in particular for accurate path finding and route optimization.