On the dual approach to the traffic assignment problem

This paper attempts to explore the possibility of solving the traffic assignment problem with elastic demands by way of its dual problem. It is shown that the dual problem can be formulated as a nonsmooth convex optimization problem of which the objective function values and subgradients are conveniently calculated by solving shortest path problems associated with the transportation network. A subgradient algorithm to solve the dual problem is presented and limited computational experience is reported. The computational results are encouraging enough to demonstrate the effectiveness of the proposed approach.     

Urban spatial location advantage: The dual of the transportation problem and its implications for land-use and transport planning

Numerous recent studies have investigated the relationship between the location of jobs and housing in urban areas and how this relates to urban commuting patterns. Few have utilised the dual of the transportation problem of linear programming (TPLP) to provide insights into these relationships Accordingly, this analysis utilises the TPLP to determine dual variable values (shadow prices) for a study area in Dublin, Ireland. The approach determines the pattern of relative location advantage for the peak and off-peak travel periods and for public and private transport for 1991 and 2001. The results are set against the expected results for hypothetical urban structures. The results show that the pattern of relative location advantage has altered sharply over the study period for off-peak trip-making but has remained more or less the same for trip-making in the peak period. For the off-peak period, the pattern of relative location advantage has shifted from the central area to the periphery specifically for private transport trips; for public transport, the pattern has remained focused on the city centre. This indicates that private transport users can react more quickly to changes in the distribution of land-use activities than their public transport counterparts due to the relatively fixed nature of the latter mode. This implies that the public transport network needs to be reorganized to better reflect the revised pattern of trip-making specifically for the off-peak period. The results demonstrate the value of using the approach for providing information about the spatial organisation of land uses within cities and where future development may be targeted.     

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.     

The recoverable robust facility location problem

This work deals with a facility location problem in which location and allocation (transportation) policy is defined in two stages such that a first-stage solution should be robust against the possible realizations (scenarios) of the input data that can only be revealed in a second stage. This solution should be robust enough so that it can be recovered promptly and at low cost in the second stage. In contrast to some related modeling approaches from the literature, this new recoverable robust model is more general in terms of the considered data uncertainty; it can address situations in which uncertainty may be present in any of the following four categories: provider-side uncertainty, receiver-side uncertainty, uncertainty in-between, and uncertainty with respect to the cost parameters.For this novel problem, a sophisticated branch-and-cut framework based on Benders decomposition is designed and complemented by several non-trivial enhancements, including scenario sorting, dual lifting, branching priorities, matheuristics and zero-half cuts. Two large sets of instances that incorporate spatial and demographic information of countries such as Germany and US (transportation) and Bangladesh and the Philippines (disaster management) are introduced. They are used to analyze in detail the characteristics of the proposed model and the obtained solutions as well as the effectiveness, behavior and limitations of the designed algorithm.     

Genetic algorithms approach to the problem of the automated vehicle identification equipment locations

The automated vehicle identification (AVI) equipment location problem entails determination of the best locations for the automated vehicle identification equipment. The paper attempts to solve the AVI equipment location problem as a multi‐objective optimization problem, thus determining the best locations on the basis of several criteria. The developed model is based on genetic algorithms. Testing of the model developed on the greater transportation networks is certainly one of the most important directions for the future research, as much as the development of models based on other metaheuristic approaches (Simulated Annealing, Taboo Search). The results obtained in this stage of the research are promising.     

Modeling and solving discrete network design problem with stochastic user equilibrium

In this paper, we address the discrete network design problem, which determines the addition of new roads to existing transportation network to optimize the transportation system performance. Road users are assumed to follow the traffic assignment principle of stochastic user equilibrium. A mixed‐integer nonlinear nonconvex problem is developed to model this discrete network design problem with stochastic user equilibrium. The original problem is relaxed into a convex mixed‐integer nonlinear program, whose solution provides a lower bound of the original problem. The relaxed problem is then embedded into two proposed global optimization solution algorithms to obtain the global optimal solution of the problem. Copyright © 2016 John Wiley & Sons, Ltd.     

基于改进TOPSIS的城市客运综合交通枢纽评价

城市客运综合交通枢纽规划方案的优劣对城市综合交通系统的建设发展具有重大影响。为了提高城市客运综合交通枢纽规划方案评价的客观性和准确性,结合城市客运综合交通枢纽客流衔接换乘的系统分析,从多维角度出发构建了城市客运综合交通枢纽规划方案评价的多层次指标体系,在遵循方案评价基本原理及城市客运综合交通枢纽特点的基础上,提出了基于改进逼近理想点排序法的评价方法,用于城市客运综合交通枢纽方案的评价,建立城市客运综合交通枢纽综合评价模型。     

国家级综合运输枢纽型城市发展策略研究

以南京市为例,从枢纽型城市整体构建、综合运输通道系统、综合运输枢纽集疏运体系、保障策略四个方面综合提出构建国家级综合运输型城市的发展策略。     

Counting the different efficient paths for transportation networks and its applications

This paper deals with an interesting problem about how to efficiently compute the number of different efficient paths between an origin‐destination pair for a transportation network because these efficient paths are the possible paths used by drivers to some extent. Based on a novel triangle operation derived, it first presents a polynomial‐time combinatorial algorithm that can obtain the number of different simple paths between any two nodes for an acyclic network as well as the total travel cost of these paths. This paper proceeds to develop a combinatorial algorithm with polynomial‐time complexity for both counting the different efficient paths between an origin‐destination pair and calculating the total travel cost of these paths. As for applications, this paper shows that the preceding two algorithms can yield the lower and upper bounds for the number of different simple paths between an origin‐destination pair, while it has already be recognized that a polynomial‐time algorithm getting such a number does not exist for a general network. Furthermore, the latter algorithm can be applied for developing a heuristic method for the traffic counting location problem arising from the origin‐destination matrix estimation problems.     

Discrete choice with spatial correlation: A spatial autoregressive binary probit model with endogenous weight matrix (SARBP-EWM)

Discrete choice modeling is widely applied in transportation studies. However, the need to consider correlation between observations creates a challenge. In spatial econometrics, a spatial lag term with a pre-defined weight matrix is often used to capture such a correlation. In most previous studies, the weight matrix is assumed to be exogenous. However, this assumption is invalid in many cases, leading to biased and inconsistent parameter estimates. Although some attempts have been made to address the endogenous weight matrix issue, none has focused on discrete choice modeling. This paper fills an existing gap by developing a Spatial Autoregressive Binary Probit Model with Endogenous Weight Matrix (SARBP-EWM). The SARBP-EWM model explicitly considers the endogeneity by using two equations whose error terms are correlated. Markov Chain Monte Carlo (MCMC) method is used to estimate the model. Model validation with simulated data shows that the model parameters can converge to their true values and the endogenous weight matrix can be reliably recovered. The model is then applied to a simplified firm relocation choice problem, assuming that similar size firms influence one another. The model quantifies the peer effect, and takes into consideration other independent variables including industry type and population density. The estimation results suggest that peer influence among firms indeed affect their relocation choices. The application results offer important insights into business location choice and can inform future policy making. The sample size for applying the model is currently limited to hundreds of observations. This paper contributes to the existing literature on discrete choice modeling and spatial econometrics. It provides a new tool to discover spatial correlations that are hidden in a wide range of transportation issues, such as land development, location choice, and various travel behavior. Those hidden spatial correlations are otherwise difficult to identify and estimation results may be biased. Establishing a new model that explicitly considers endogenous weight matrix and applying the model to a real life transportation issue represent a significant contribution to the body of literature.     

Origin–destination synthesis for aviation network data: examining hub operations in the domestic and international US markets

Hub‐and‐spoke networking is a key feature of current aviation markets in which hubs, as connecting points, function to consolidate and redistribute flows. This indicates that observation of traffic on a segment does not necessarily convey information about the origin to destination routing of passenger journeys because of the unavoidable detours in the system. This paper examines the heterogeneity of the flow composition in domestic and international US markets, which in turn allows us to observe the variation of operations across major hubs. A modified Route Flow Estimator for origin–destination synthesis (or origin–destination matrix estimation) is designed to decompose the segment traffic into itinerary‐based passenger trips. Several public and commercial databases, which are easily accessible, are exploited (and reconciled) for the model in order to (i) generate possible trip itineraries using those segment markets, and (ii) link data‐driven operational conditions with the underlying segment flows. The results are validated with US domestic trip observations and empirical knowledge related to the air transportation system. Then, the variability of the hub operations is examined based on sensitivity tests using the model parameters. From the resolution of itinerary‐based estimates, we observe that major airports' hub operations are spatially uneven, particularly with respect to domestic and international connecting passengers. Copyright © 2017 John Wiley & Sons, Ltd.     

Transportation mode detection – an in-depth review of applicability and reliability

The wide adoption of location-enabled devices, together with the acceptance of services that leverage (personal) data as payment, allows scientists to push through some of the previous barriers imposed by data insufficiency, ethics and privacy skepticism. The research problems whose study require hard-to-obtain data (e.g. transportation mode detection, service contextualisation, etc.) have now become more accessible to scientists because of the availability of data collecting outlets. One such problem is the detection of a user's transportation mode. Different fields have approached the problem of transportation mode detection with different aims: Location-Based Services (LBS) is a field that focuses on understanding the transportation mode in real-time, Transportation Science is a field that focuses on measuring the daily travel patterns of individuals or groups of individuals, and Human Geography is a field that focuses on enriching a trajectory by adding domain-specific semantics. While different fields providing solutions to the same problem could be viewed as a positive outcome, it is difficult to compare these solutions because the reported performance indicators depend on the type of approach and its aim (e.g. the real-time availability of LBS requires the performance to be computed on each classified location). The contributions of this paper are three fold. First, the paper reviews the critical aspects desired by each research field when providing solutions to the transportation mode detection problem. Second, it proposes three dimensions that separate three branches of science based on their main interest. Finally, it identifies important gaps in research and future directions, that is, proposing: widely accepted error measures meaningful for all disciplines, methods robust to new data sets and a benchmark data set for performance validation.     

Truck capacity analysis in a cross‐dock transportation network considering direct shipment

In a transportation network, decision making parameters may change and may cause the optimum value of objective function to vary in a specific range. Therefore, managers try to identify the effects of these changes by sensitive analysis to find appropriate solutions. In this paper, first, a model for cross‐dock transportation network considering direct shipment is presented, and then an algorithm based on branch and bound algorithm and dual price concept for sensitive analysis is developed. When managers encounter problems such as budget limit, they may decide to change the capacity of trucks as a procedure to reduce the transportation costs of the network. The algorithm provides a useful lower bound on the solutions of the problems and makes it easy for the managers to eliminate inappropriate options of truck capacities, which cannot lead to cost reduction. To verify the algorithm, an example will be given at the end of the paper. Copyright © 2013 John Wiley & Sons, Ltd.     

An integrated model of facility location and transportation network design

Network location models have been used extensively for siting public and private facilities. In this paper, we investigate a model that simultaneously optimizes facility locations and the design of the underlying transportation network. Motivated by the simple observation that changing the network topology is often more cost-effective than adding facilities to improve service levels, the model has a number of applications in regional planning, distribution, energy management, and other areas. The model generalizes the classical simple plant location problem. We show how the model can be solved effectively. We then use the model to analyze two potential transportation planning scenarios. The fundamental question of resource allocation between facilities and links is investigated, and a detailed sensitivity analysis provides insight into the model's usefulness for aiding budgeting and planning decisions. We conclude by identifying promising research directions.     

A logit-based model for measuring the effects of transportation infrastructure on land value

Mutual interactions between transportation and land use have long been debated. Despite progress made in computational technology, the study of these interactions is not adequately developed. The most important aspect of such interactions is given by the changes in land values due to changes in transportation infrastructures. We consider the behavioural features of these interactions along with the constraints on the land and/or zoning restrictions and propose a reliable model for the first time to predict land value changes with respect to changes in transportation facilities and accessibility. The proposed model is a logit-based mathematical programming methodology where the relative price of land is predicted with respect to transportation accessibility, neighbourhood amenities, location premium, availability of land, and zoning regulations. A real-world case study is used to exhibit the applicability of the proposed methodology and demonstrate the efficacy of the algorithms and procedures.     

Mathematical programming models for airport site selection

Three mathematical programming models are developed in this paper, using different criteria, for the airport site selection problem in developing countries. Estimation of parameters, based on Turkish data, and the sensitivity analyses are presented. The first is a typical set covering model used to determine the minimum number of airports required for a given population of passengers. The other two are location-allocation type models used to find the optimal airport location patterns, the number of passengers to be bussed to cities having airports, and the optimal frequencies of transportation modes between the city pairs.     

On the estimation of trip matrices in the case of missing and uncertain data

The problem of missing data in the base (calibration) year is of major importance when applying the gravity model in transportation planning, because base year data are used for calibration of the model. In this article, this problem is tackled by solving an optimization problem for the prediction year for values of the entropy level and the proportions of trips in a given stratification of the cells of the trip matrix estimated in the base year. The problem of uncertain data in the prediction year is handled by replacing equality constraints for the marginal totals in the prediction year by interval constraints. Computational results are given for trip data from the Linköping area.     

A fuzzy method for predicting the demand for rail freight transportation

The demand for rail freight transportation is a continuously changing process over space and time and is affected by many quantitative and qualitative factors. In order to develop a more rational transport planning process to be followed by railway organizations, there is a need to accurately forecast freight demand under a dynamic and uncertain environment. In conventional linear regression analysis, the deviations between the observed and the estimated values are supposed to be due to observation errors. In this paper, taking a different perspective, these deviations are regarded as the fuzziness of the system's structure. The details of fuzzy linear regression method are put forward and discussed in the paper. Based on an analyzes of the characteristics of the rail transportation problem, the proposed model was successfully applied to a real example from China. The results of that application are also presented here.     

Heterogeneous sensor location model for path reconstruction

A new traffic sensor location problem is developed and solved by strategically placing both passive and active sensors in a transportation network for path reconstruction. Passive sensors simply count vehicles, while active sensors can recognize vehicle plates but are more expensive. We developed a two-stage heterogeneous sensor location model to determine the most cost-effective strategies for sensor deployment. The first stage of the model adopts the path reconstruction model defined by Castillo et al. (2008b) to determine the optimal locations of active sensors in the network. In the second stage, an algebraic framework is developed to strategically replace active sensors so that the total installation cost can be reduced while maintaining path flow observation quality. Within the algebraic framework, a scalar product operator is introduced to calculate path flows. An extension matrix is generated and used to determine if a replacement scheme is able to reconstruct all path flows. A graph model is then constructed to determine feasible replacement schemes. The problem of finding the optimal replacement scheme is addressed by utilizing the theory of maximum clique to obtain the upper bound of the number of replaced sensors and then revising this upper bound to generate the optimal replacement scheme. A polynomial-time algorithm is proposed to solve the maximum clique problem, and the optimal replacement scheme can be obtained accordingly. Three numerical experiments show that our proposed two-stage method can reduce the total costs of transportation surveillance systems without affecting the system monitor quality. The locations of the active sensors play a more critical role than the locations of the passive sensors in the number of reconstructed paths.     

A bilevel flow model for hazmat transportation network design

In this work we consider the following hazmat transportation network design problem. A given set of hazmat shipments has to be shipped over a road transportation network in order to transport a given amount of hazardous materials from specific origin points to specific destination points, and we assume there are regional and local government authorities that want to regulate the hazmat transportations by imposing restrictions on the amount of hazmat traffic over the network links. In particular, the regional authority aims to minimize the total transport risk induced over the entire region in which the transportation network is embedded, while local authorities want the risk over their local jurisdictions to be the lowest possible, forcing the regional authority to assure also risk equity. We provide a linear bilevel programming formulation for this hazmat transportation network design problem that takes into account both total risk minimization and risk equity. We transform the bilevel model into a single-level mixed integer linear program by replacing the second level (follower) problem by its KKT conditions and by linearizing the complementary constraints, and then we solve the MIP problem with a commercial optimization solver. The optimal solution may not be stable, and we provide an approach for testing its stability and for evaluating the range of its solution values when it is not stable. Moreover, since the bilevel model is difficult to be solved optimally and its optimal solution may not be stable, we provide a heuristic algorithm for the bilevel model able to always find a stable solution. The proposed bilevel model and heuristic algorithm are experimented on real scenarios of an Italian regional network.