In the context of sketch planning, a simplified network (i.e., an abstract network or subnetwork) model is expected to accurately approximate travel demand patterns and level-of-service attributes obtained from its full-network counterpart. A data prerequisite in this approximation process is the trip matrix of the simplified network. This paper discusses a maximum entropy method for the subnetwork trip matrix estimation problem, relying only on link flow rates estimated with the use of full-network traffic assignment or as observed link-level vehicle counts. A linearization algorithm of the Frank–Wolfe type is devised for problem solutions in which a column–generation approach is used iteratively to solve the linearized subproblem without path enumeration. Encouraging results from sample applications of different size and topology suggest that this method holds much promise for generating trip matrices that can be used to evaluate traffic flow patterns under various network changes.
Get full access to this article
View all access options for this article.
References
1.
ChanY.A Method to Simplify Network Representation in Transportation Planning. Transportation Research, Vol. 10, No. 3, 1976, pp. 179–191.
2.
ChanY., ShenT. S., and MahabaN. M.Transportation-Network Design Problem: Application of a Hierarchical Search Algorithm. In Transportation Research Record 1251, TRB, National Research Council, Washington, D.C., 1989, pp. 24–34.
3.
EashR. W., ChonK. S., LeeY. J., and BoyceD. E.Equilibrium Traffic Assignment on an Aggregated Highway Network for Sketch Planning. In Transportation Research Record 944, TRB, National Research Council, Washington, D.C., 1983, pp. 30–37.
4.
KaplanM. P., GurY. J., and VyasA. D.Sketch-Planning Model for Urban Transportation Policy Analysis. In Transportation Research Record 952, TRB, National Research Council, Washington, D.C., 1984, pp. 32–39.
5.
HaghaniA. E., and DaskinM. S.Network Design Application of an Extraction Algorithm for Network Aggregation. In Transportation Research Record 944, TRB, National Research Council, Washington, D.C., 1983, pp. 37–46.
6.
HaghaniA. E., and DaskinM. S.Aggregation Effects on the Network Design Problem. Journal of Advanced Transportation, Vol. 20, No. 3, 1986, pp. 239–258.
7.
TaylorM. A. P., YoungW., and NewtonP. W.PC-Based Sketch Planning Methods for Transport and Urban Applications. Transportation, Vol. 14, No. 4, 1988, pp. 361–375.
8.
RogusM. J.Building Sketch Networks: The Development of Sketch Zones Boundaries and Aggregation Process of Detailed Highway Networks. Working Paper No. 96-11. Chicago Area Transportation Study, Chicago, Ill., 1996.
9.
DowlingR. G., and MayA. D.Comparison of Small-Area OD Estimation Techniques. In Transportation Research Record 1045, TRB, National Research Council, Washington, D.C., 1985, pp. 9–15.
10.
ZhouX., ErdoganS., and MahmassaniH. S.Dynamic Origin–Destination Trip Demand Estimation for Subarea Analysis. In Transportation Research Record: Journal of the Transportation Research Board, No. 1964, Transportation Research Board of the National Academies, Washington, D.C., 2006, pp. 176–184.
11.
HearnD. W.Practical and Theoretical Aspects of Aggregation Problems in Transportation Planning Methods. In Transportation Planning Models (FlorianM., ed.), North-Holland, Amsterdam, Netherlands, 1984, pp. 257–287.
12.
WilsonA. G.Entropy in Urban and Regional Modeling.Pion, London, 1970.
13.
OppenheimN.Urban Travel Demand Modeling: From Individual Choices to General Equilibrium.Wiley, New York, 1995.
14.
RossiT. F., McNeilS., and HendricksonC.Entropy Model for Consistent Impact-Fee Assessment. Journal of Urban Planning and Development, Vol. 115, No. 2, 1989, pp. 51–63.
15.
BellM. G. H., and IidaY.Transportation Network Analysis.Wiley, New York, 1997.
16.
JansonB. N.Most Likely Origin–Destination Link Uses from Equilibrium Assignment. Transportation Research, Vol. 27B, No. 5, 1993, pp. 333–350.
17.
LarssonT., LundgrenJ. T., RydergrenC., and PatrikssonM.Most Likely Traffic Equilibrium Route Flows Analysis and Computation. Equilibrium Problems: Nonsmooth Optimization and Variational Inequality Models (GiannessiF., ed.), Springer, New York, 2002, pp. 129–159.
18.
Bar-GeraH.Primal Method for Determining the Most Likely Route Flows in Large Road Networks. Transportation Science, Vol. 40, No. 3, 2006, pp. 269–286.
19.
WillumsenL. G.Simplified Transport Models Based on Traffic Counts. Transportation, Vol. 10, No. 3, 1981, pp. 257–278.
20.
Van ZuylenH. J., and WillumsenL. G.The Most Likely Trip Matrix Estimated from Traffic Counts. Transportation Research, Vol. 14B, No. 3, 1980, pp. 281–293.
21.
NguyenS.Modèles de Distribution Spatial Tenant Compte des Itinéraries. Publication No. 225. Centre de Recherché sur les Transports, Univerité de Montréal, Canada, 1981.
22.
FiskC. S.On Combining Maximum Entropy Trip Matrix Estimation with User Optimal Assignment. Transportation Research, Vol. 22B, No. 1, 1988, pp. 69–79.
23.
NguyenS.Estimation of an O-D Matrix from Network Data: A Network Equilibrium Approach. Publication No. 60. Centre de Recherché sur les Transports, Université de Montréal, Canada, 1977.
24.
NguyenS.Estimating Origin–Destination Matrices from Observed Flows. In Transportation Planning Models (FlorianF., ed.), Elsevier, Amsterdam, Netherlands, 1984, pp. 363–380.
25.
TurnquistM., and GurY.Estimation of Trip Tables from Observed Link Volumes. In Transportation Research Record 730, TRB, National Research Council, Washington, D.C., 1979, pp. 1–6.
26.
LeBlancL. J., and FarhangianK.Selection of a Trip Table Which Reproduces Observed Link Flows. Transportation Research, Vol. 16B, No. 2, 1982, pp. 83–88.
27.
YangH., IidaY., and SasakiT.The Equilibrium-Based Origin–Destination Matrix Estimation Problem. Transportation Research, Vol. 28B, No. 1, 1994, pp. 23–33.
28.
MaherN. J.Inferences on Trip Matrices from Observations on Link Volumes: A Bayesian Statistical Approach. Transportation Research, Vol. 17B, No. 6, 1983, pp. 435–447.
29.
LoH. P., ZhangN., and LamW. H. K.Estimation of an Origin–Destination Matrix with Random Link Choice Proportions: A Statistical Approach. Transportation Research, Vol. 30B, No. 4, 1996, pp. 309–324.
30.
CascettaE.Estimation of Trip Matrices from Traffic Counts and Survey Data: A Generalized Least Square Estimator. Transportation Research, Vol. 18B, No. 4/5, 1984, pp. 289–299.
31.
HendricksonC., and McNeilS.Matrix Entry Estimation Errors. Proc. 9th International Symposium on Transportation and Traffic Theory, Delft, Netherlands, 1984, pp. 413–430.
32.
SpiessH.A Gradient Approach for the OD Matrix Adjustment Problem. Publication No. 693. Centre for Research on Transportation, University of Montreal, Canada, 1990.
33.
BellM. G. H.The Estimation of an Origin–Destination Matrix from Traffic Counts. Transportation Science, Vol. 17, No. 1, 1991, pp. 198–217.
34.
YangH., SasakiT., IidaY., and AsakuraY.Estimation of Origin–Destination Matrices from Link Traffic Counts on Congested Networks. Transportation Research, Vol. 26B, No. 6, 1992, pp. 417–434.
35.
BellM. G. H.The Estimation of an Origin–Destination Matrix from Traffic Counts. Transportation Science, Vol. 17, No. 2, 1983, pp. 198–217.
36.
BellM. G. H.Variances and Covariances for Origin–Destination Flows When Estimated by Log-Linear Models. Transportation Research, Vol. 19B, No. 6, 1985, pp. 497–507.
37.
SpiessH.A Maximum Likelihood Model for Estimating Origin–Destination Matrices. Transportation Research, Vol. 21B, No. 5, 1987, pp. 395–412.
38.
McNeilS., and HendricksonC.A Regression Formulation of the Matrix Estimation Problem. Transportation Science, Vol. 19, No. 3, 1985, pp. 278–292.
39.
YangH., IidaY., and SasakiT.An Analysis of the Reliability of an Origin–Destination Trip Matrix Estimated from Traffic Counts. Transportation Research, Vol. 25B, No. 5, 1991, pp. 351–363.
40.
SheraliH. D., SivanandanR., and HobeikaA. G.A Linear Programming Approach for Synthesizing Origin–Destination Trip Tables from Link Traffic Volumes. Transportation Research, Vol. 28B, No. 3, 1994, pp. 213–233.
41.
NieY., and LeeD.-H.Uncoupled Method for Equilibrium-Based Linear Path Flow Estimator for Origin–Destination Trip Matrices. In Transportation Research Record: Journal of the Transportation Research Board, No. 1783, Transportation Research Board of the National Academies, Washington, D.C., 2002, pp. 72–79.
42.
GajewskiB. J., RilettL. R., DixonM. P., and SpiegelmanC. H.Robust Estimation of Origin–Destination Matrices. Journal of Transportation and Statistics, Vol. 5, No. 2/3, 2002, pp. 37–56.
43.
CareyM., and RevelliR.Constrained Estimation of Direct Demand Functions and Trip Matrices. Transportation Science, Vol. 20, No. 3, 1986, pp. 143–152.
44.
FrankM., and WolfeP.An Algorithm for Quadratic Programming. Naval Research Logistics Quarterly, Vol. 3, No. 1/2, 1956, pp. 95–110.
45.
DantzigG. B.Linear Programming and Extensions.Princeton University Press, Princeton, N.J., 1963.
46.
BazaraaM. S., JarvisJ. J., and SheraliH. D.Linear Programming and Network Flows.Wiley, New York, 1990.
47.
BellmanR. E.On a Routing Problem. Quarterly of Applied Mathematics, Vol. 16, No. 1, 1958, pp. 87–90.
48.
FloydR. W.Algorithm 97: Shortest Path. Communications of the ACM, Vol. 5, No. 6, 1962, pp. 345.
