Bregman's balancing method

In this paper we observe that most of the independently discovered balancing methods, used in transportation planning and in other fields, are in fact special cases of a method of Bregman. Examples include the usual Kruithof or Furness method, the Evans-Kirby three dimensional balancing procedure, the Murchland multiproportional balancing procedure, the Osborne or Grad method for preconditioning matrices, the Jefferson-Scott procedure for gravity models with inequality constraints, and the method considered by Macgill for partially constrained gravity models. The convergence of all of these methods follows from Bregman's general result.     

A note on the calculation and calibration of doubly constrained trip distribution models

The use of growth factor models for trip distribution has given way in the past to the use of more complex synthetic models. Nevertheless growth factor models are still used, for example in modelling external trips, in small area studies, in input-output analysis, and in category analysis. In this article a particular growth factor model, the Furness, is examined. Its application and functional form are described together with the method of iteration used in its operation. The expected information statistic is described and interpreted and it is shown that the Furness model predicts a trip distribution which, when compared with observed trips, has the minimum expected information subject to origin and destination constraints. An equivalent entropy maximising derivation is described and the two methods compared to show how the Furness iteration can be used in gravity models with specified deterrence functions. A trip distribution model explicitly incorporating information from observed trips, is then derived.It is suggested that if consistency is to be maintained between iteration, calibration, and the derivation of gravity models, then expected information should be used as the calibration statistic to measure goodness of fit. The importance of consistency in this respect is often overlooked.Lastly, the limitations of the models are discussed and it is suggested that it may be better to use the Furness iteration rather than any other, since it is more fully understood. In particular its ease of calculation makes it suitable for use in small models computed by hand.     

A modification to Kruithof's double-factor method

A modification of Kruithof's double-factor algorithm (sometimes called the Furness iterative method) that takes into account zones which lie outside the boundary of a traffic network is examined analytically. Basically the revised algorithm allows certain rows and columns of the base traffic matrix to be only proportionally scaled while the remaining rows and columns which have pre-specified row and column totals are scaled in the usual biproportional way. This paper shows that all the properties (such as uniqueness, reversibility, existence) which hold for the traditional biproportional transformation also hold for the modified transformation under certain positivity assumptions.     

Convergence of the Frank-Wolfe method for certain bounded variable traffic assignment problems

In two recent papers published in Transportation Research, Daganzo presented a modification of the Frank-Wolfe algorithm to solve certain link capacitated traffic assignment problems satisfying certain conditions. In order to show convergence of the modified algorithm, the assumption was made that the integral of the volume delay formula for each link tends to infinity as the link flow approaches the link capacity. In this paper we give a Theorem which establishes convergence of the modified algorithm under much weaker conditions. This result is then used to show convergence if the objective function of the assignment model is sufficiently large (not necessarily infinite) when the link flows are at capacity. Thus the modified method is applicable to a broader class of assignment problems. Two numerical examples illustrate (a) when the method converges and when it does not, and (b) that our Theorem provides a weaker condition for convergence of the method.     

On the convergence of iterative methods for the distribution balancing problem

A general distribution balancing problem, specified by the given outflows and inflows and the factorial form of its solution, is formulated. Solution uniqueness and boundedness is discussed—primarily in graph theoretical terms. An entropy maximisation problem, subject to general linear constraints, is transformed into an unconstrained optimisation problem by application of standard duality theory, and a relevant general convergence theorem for iterative solution methods is given. The optimum solution in a special case is identified with the flow solution. When expressed in flow variables, the dual objective has a unique and bounded optimum solution and is an appropriate unifying concept for measuring the rate of convergence of different solution methods. By regarding the balancing procedure as an iterative optimisation method, a new and simple proof of its convergence is given, together with some asymptotic results, which are also compared with those of Newton's method. It is pointed out that there are two different forms of Newton's method, according to the choice of variables—untransformed or transformed— in the original distribution balancing problem. When Newton's method is applied to the whole system of equations simultaneously, the trajectory of iterates is observed to depend on this variable choice. For the transformed variables it is noticed that the convergence with the balancing procedure is quicker than with Newton's method applied to the outflow- and inflow- equations, alternately. To guarantee global convergence with Newton's method and to increase the rate a supplementary linear search routine is recommended.     

广梧高速公路隧道二衬合理支护时机确定方法

文章以广梧高速公路为工程背景,介绍采用以隧道拱顶下沉及周边收敛的收敛速率作为判定标准的经验法,来确定隧道围岩的二衬合理支护时机。通过现场实际监测结果分析,确定了Ⅱ、Ⅲ、Ⅳ、Ⅴ级围岩相应的收敛趋于稳定时的掌子面推进时间与距离,为这四种级别围岩的二衬合理支护时机的确定提供依据。     

Trial and error method for optimal tradable credit schemes: The network case

Recent studies on the new congestion reduction method―tradable credit scheme rely on the full information of speed‐flow relationship, demand function, and generalized cost. As analytical travel demand, functions are difficult to establish in practice. This paper develops a trial and error method for selecting optimal credit schemes for general networks in the absence of demand functions. After each trial of tradable credit scheme, the credit charging scheme and total amount of credits to be distributed are updated by both observed link flows at traffic equilibrium and revealed credit price at market equilibrium. The updating strategy is based on the method of successive averages and its convergence is established theoretically. Our numerical experiments demonstrate that the method of successive averages based trial and error method for tradable credit schemes has a lower convergence speed in comparison with its counterpart for congestion pricing and could be enhanced by exploring more efficient methods that make full use of credit price information. Copyright © 2013 John Wiley & Sons, Ltd.     

Norm approximation method for handling traffic count inconsistencies in path flow estimator

Path flow estimator (PFE) is a one-stage network observer proposed to estimate path flows and hence origin–destination (O–D) flows from traffic counts in a transportation network. Although PFE does not require traffic counts to be collected on all network links when inferring unmeasured traffic conditions, it does require all available counts to be reasonably consistent. This requirement is difficult to fulfill in practice due to errors inherited in data collection and processing. The original PFE model handles this issue by relaxing the requirement of perfect replication of traffic counts through the specification of error bounds. This method enhances the flexibility of PFE by allowing the incorporation of local knowledge, regarding the traffic conditions and the nature of traffic data, into the estimation process. However, specifying appropriate error bounds for all observed links in real networks turns out to be a difficult and time-consuming task. In addition, improper specification of the error bounds could lead to a biased estimation of total travel demand in the network. This paper therefore proposes the norm approximation method capable of internally handling inconsistent traffic counts in PFE. Specifically, three norm approximation criteria are adopted to formulate three L_p-PFE models for estimating consistent path flows and O–D flows that simultaneously minimize the deviation between the estimated and observed link volumes. A partial linearization algorithm embedded with an iterative balancing scheme and a column generation procedure is developed to solve the three L_p-PFE models. In addition, the proposed L_p-PFE models are illustrated with numerical examples and the characteristics of solutions obtained by these models are discussed.     

A generalized partite-graph method for transportation data association

There are many problems in transportation which involve reconstructing the associations between different entities. For example, data points related to a vehicle from different sensors could be matched to reconstruct the trajectories of vehicles. Or, in population synthesis for microsimulation, lists of persons, dwellings, and vehicles could be generated individually from source data and then matched into synthetic households. There are numerous other examples. The unifying theme is a desire to construct realistic unit-level associations from aggregate or anonymized data. The problem demands a method that is behaviorally consistent and operationally efficient to handle large datasets. We adapt concepts from graph theory to formulate this class of problems as a k-partite graph. This approach is generic and can incorporate expectations of behavior in the form of edge weights. A Dijkstra algorithm based solution is proposed for a subset of k-partite graphs which permits a direct comparison with pair-wise matching and applied to a case study of bicycle tracklets. We then propose an iterative improvement algorithm as a generic method and apply it to a complete k-partite graph in a population synthesis case study. The first case study shows that the k-partite algorithm outperforms the previously used pair-wise matching algorithms. The second case study demonstrates the generality of the proposed algorithm to all k-partite graphs and shows that the generic method is fast and scalable to large problems. As a whole, this paper aims to show that k-partite methods are behaviorally consistent, efficient, and potentially applicable to a wide variety of transportation data association problems.     

Variances and covariances for origin-destination flows when estimated by log-linear models

An expression is derived for the variances and covariances of the logarithms of origin- destination flows when estimated by one of a family of log-linear models. Among this family is the Furness growth factor model, the gravity model, the Willumsen model and the Van Zuylen-Bell model. Variances and covariances for the logarithms of the parameters incorporating prior information and for the values of the constraints with which the fitted values must conform are transformed linearly into approximate variances and covariances for the logarithms of the fitted values. Additional error due to misspecification of either the model or the constraints is not taken into account. Depending on the model, the prior information parameters may correspond to values of a deterrence function or to a base year trip matrix, while the constraints may represent design year trip end totals or traffic counts. As an illustration, the expression is applied to an example involving Willumsen's model.     

Global convergence of the trial-and-error method for the traffic-restraint congestion-pricing scheme with day-to-day flow dynamics

The traffic-restraint congestion-pricing scheme (TRCPS) aims to maintain traffic flow within a desirable threshold for some target links by levying the appropriate link tolls. In this study, we propose a trial-and-error method using observed link flows to implement the TRCPS with the day-to-day flow dynamics. Without resorting to the origin–destination (O–D) demand functions, link travel time functions and value of time (VOT), the proposed trial-and-error method works as follows: tolls for the traffic-restraint links are first implemented each time (trial) and they are subsequently updated using observed link flows in a disequilibrium state at any arbitrary time interval. The trial-and-error method has the practical significance because it is necessary only to observe traffic flows on those tolled links and it does not require to wait for the network flow pattern achieving the user equilibrium (UE) state. The global convergence of the trial-and-error method is rigorously demonstrated under mild conditions. We theoretically show the viability of the proposed trial-and-error method, and numerical experiments are conducted to evaluate its performance. The result of this study, without doubt, enhances the confidence of practitioners to adopt this method.     

A robust method for estimating transit passenger trajectories using automated data

Development of an origin-destination demand matrix is crucial for transit planning. The development process is facilitated by automated transit smart card data, making it possible to mine boarding and alighting patterns on an individual basis. This research proposes a novel trip chaining method which uses Automatic Fare Collection (AFC) and General Transit Feed Specification (GTFS) data to infer the most likely trajectory of individual transit passengers. The method relaxes the assumptions on various parameters used in the existing trip chaining algorithms such as transfer walking distance threshold, buffer distance for selecting the boarding location, time window for selecting the vehicle trip, etc. The method also resolves issues related to errors in GPS location recorded by AFC systems or selection of incorrect sub-route from GTFS data. The proposed trip chaining method generates a set of candidate trajectories for each AFC tag to reach the next tag, calculates the probability of each trajectory, and selects the most likely trajectory to infer the boarding and alighting stops. The method is applied to transit data from the Twin Cities, MN, which has an open transit system where passengers tap smart cards only once when boarding (or when alighting on pay-exit buses). Based on the consecutive tags of the passenger, the proposed algorithm is also modified for pay-exit cases. The method is compared to previous methods developed by the researchers and shows improvement in the number of inferred cases. Finally, results are visualized to understand the route ridership and geographical pattern of trips.     

A self-adaptive method to equalize headways: Numerical analysis and comparison

In uncontrolled bus systems, buses tend to bunch due to the stochastic nature of traffic flows and passenger demand at bus stops. Although schedules and priori target methods introduce slack time to delay buses at control points to maintain constant headways between successive buses, too much slack required delay passengers on-board. In addition, these methods focus on regular headways and do not consider the rates of convergence of headways after disturbances. We propose a self-adaptive control scheme to equalize the headways of buses with little slack in a single line automatically. The proposed method only requires the information from the current bus at the control point and both its leading and following buses. This elegant method is shown to regulate headways faster than existing methods. In addition, compared to previous self-equalizing methods, the proposed method can improve the travel time of buses by about 12%, while keeping the waiting time of passengers almost the same.     

Analyzing trade-offs between transportation,inventory and production costs on freight networks

The purpose of this paper is to determine optimal shipping strategies (i.e. routes and shipment sizes) on freight networks by analyzing trade-offs between transportation, inventory, and production set-up costs. Networks involving direct shipping, shipping via a consolidation terminal, and a combination of terminal and direct shipping are considered. This paper makes three main contributions. First, an understanding is provided of the interface between transportation and production set-up costs, and of how these costs both affect inventory. Second, conditions are identified that indicate when networks involving direct shipments between many origins and destinations can be analyzed on a link-by-link basis. Finally, a simple optimization method is developed that simultaneously determines optimal routes and shipment sizes for networks with a consolidation terminal and concave cost functions. This method decomposes the network into separate sub-networks, and determines the optimum analytically without the need for mathematical programming techniques.     

A suppressed demand analysis method of the transportation disadvantaged in policy making

Abstract

This paper proposes a method for estimating transportation supply requirements when the suppressed demand of the transportation disadvantaged (TD) can be calculated and added to existing demand for travel. The underlying assumption is that the travel conditions of these TD groups must be equal to the ‘conventional’ demand, known as ‘full release’. Utilising the modelling approach for TD, suppressed demand analysis, diagnosis of difficulties and equity between conventional and disadvantaged groups were realised, while elaborating special cases for the most vulnerable TD groups (such as elderly and disabled persons) and simultaneously identifying areas of difficulty. From the early virtual results, it is concluded that, for the full release of suppressed trips (only a 5% increase), policy makers must be ready to face some financial burdens, requiring coordination of effort to both standardise these TD groups and reduce the costs incurred by operators.     

A practical method to estimate the benefits of improved road network reliability: an application to departing air passengers

This paper develops and applies a practical method to estimate the benefits of improved reliability of road networks. We present a general methodology to estimate the scheduling costs due to travel time variability for car travel. In contrast to existing practical methods, we explicitly consider the effect of travel time variability on departure time choices. We focus on situations when only mean delays are known, which is typically the case when standard transport models are used. We first show how travel time variability can be predicted from mean delays. We then estimate the scheduling costs of travellers, taking into account their optimal departure time choice given the estimated travel time variability. We illustrate the methodology for air passengers traveling by car to Amsterdam Schiphol Airport. We find that on average planned improvements in network reliability only lead to a small reduction in access costs per trip in absolute terms, mainly because most air passengers drive to the airport outside peak hours, when travel time variability tends to be low. However, in relative terms the reduction in access costs due to the improvements in network reliability is substantial. In our case we find that for every 1 Euro reduction in travel time costs, there is an additional cost reduction of 0.7 Euro due to lower travel time variability, and hence lower scheduling costs. Ignoring the benefits from improved reliability may therefore lead to a severe underestimation of the total benefits of infrastructure improvements.     

低温热水地板辐射采暖系统水力平衡分析

分析了地暖系统中重力循环作用压力对共用立管的影响,运用基尔霍夫定律分析了地暖系统中下分异程式双管系统和下分同程式双管系统的水力平衡状况,得出了在没有平衡调节装置的情况下,下分异程式双管系统更适用于地暖系统的结论,通过计算确定了地暖系统共用立管水力平衡的影响因素和平均比摩阻的范围.     

A graph-theoretic method to quantify the airline route authority

A U.S. certificated passenger airline must be authorized by the Civil Aeronautics Board before it can schedule a route to serve a set of cities. The route authority is described in a number of legal statements on a Route Certificate, which specifies the routing restrictions by which the airline must abide in offering the service. For cost considerations, an airline is often interested in the shortest flight-time routes between city pairs. This paper introduces a graph-theoretic method to quantify the legal statements in a Certificate. Through straightforward matrix operations, all the authorized nonstop and multistop routes, including the shortest time routes, can be generated. The method is a convenient tool to help an airline to generate alternative network routes as demonstrated by a case study of American Airlines.     

A method to estimate trip O‐D patterns using a neural network approach

This paper proposes a method which identifies the trip origin‐destination (O‐D) matrix when many pairs of values for the right hand side column (B) and the bottom row (A) of the matrix are given. The method considers B and A as the cause (input) and effect (output) of a system, respectively, and that the O‐D matrix represents the relationship between the cause and the effect. The relationship which satisfies all pairs of the cause and the effect data exactly may not be identified, but, should a general pattern of the relationship exist, it should emerge when many data sets of B and A are given. Two steps are involved in the method: the first step examines if a consistent O‐D pattern exists; if a pattern is found to exist, the second step identifies the values of the elements of the O‐D matrix. The first step is based on the shape of the possibility distributions of the values of the matrix elements. The second step uses a simple back‐propagation neural network. The method is useful to problems that require identification of the cause‐effect relationship when many sets of data for the cause and effect are available, for example, the station‐to‐station travel pattern on a rapid transit line when the total entering and exiting passengers are known at each station for many different days. The model can also be applied to other transportation problems which involve input and output relation.     

Continuous price and flow dynamics of tradable mobility credits

This study examines the price and flow dynamics under a tradable credit scheme, when the credits can be traded in a free market. A continuous dynamic model in a finite time horizon is proposed to describe the travelers’ learning behavior and the evolution of network flows and credit price, and then the existence and uniqueness of the equilibria are established. The conditions for stability and convergence of the dynamic system as the time horizon extends to infinity and the impact of limited implementation time horizon on the system behavior are investigated.