A TRAFFIC ASSIGNMENT PLANNING MODEL: THE LOAD-NODE CONCEPT
Abstract The use of the traffic assignment model in urban transportation planning is universal; however, traffic assignment in its present form is expensive, cumbersome, and has serious limitations. In this research the authors have developed and tested the load-node concept of traffic assignment which reduces many of these problems. In the load-node concept the corners of zone boundaries are used for points of trip origins and destinations. In this manner the zone centroids and associated connector linkages of the network are removed. This results in a substantial reduction in network coding. In this study the total number of nodes required to define the network decreased by almost 3000 to 995 and the number of links in the network decreased by two-thirds. The forecasted 1990 Phoenix metropolitan area was used to test this approach and the average link volumes of all-or-nothing capacity restraint assignments using both the load-node and zone centroid concepts formed the basis of the comparison. The analyses indicated the average link volumes of the two concepts are comparable. A probable reduction in computer time of 40 + per cent was obtained when the load-node concept was used. The authors suggest that this approach is primarily adaptable for planning purposes and not design. With respect to the design use of traffic assignment results, the travel between adjacent zones is seldom included in the major arterial street and freeway traffic volumes obtained from zone centroid assignment. This may result in a substantial underestimation of future traffic volume and turning movements particularly if stepped down 24-hr assignments are used for design purposes. The load-node approach does assign travel between adjacent zones.
The equivalence of transfer and generalized benders decomposition methods for traffic assignment
In prior work we have given an intuitive development of Transfer Decomposition, a decomposition of the traffic assignment problem into two traffic assignment problems. The intent of this paper is to provide a rigorous basis for this technique by establishing that it is a generalized Benders decomposition. As an illustration of the result, we give a decomposition algorithm that is based on the familiar Frank-Wolfe method.
Multi-directional spatial error concealment using adaptive edge thresholding
In this paper, a new method for spatial concealment of missing areas in image and video signals transmitted over error prone infrastructures, is presented. The concealment process is performed in three steps. First, a novel technique is used to estimate the significant edges of missing areas after performing a directional edge analysis on the correctly received neighboring blocks of the missing areas. This technique uses the moments of the neighboring edge magnitudes to obtain an adaptive threshold for rejecting non-significant directions. Second, based on the predicted significant directions, an approximation is obtained for each missing pixel. Finally, for each pixel, we compute a weighted average by using two edge correspondence measures as weighting factors. Moreover, the adaptive thresholding of the edges let us include as many edges as necessary in the interpolation process. Experiments show that the proposed method outperforms the previous state of the art methods based on both subjective and objective measures.