A HIGHWAY CAPACITY FUNCTION IN KOREA: MEASUREMENT AND CALIBRATION

Abstract Capacity functions are important in the model that accounts for the user's route choice behavior based on the traveller's perception of the travel time. This is because a capacity function represents the relationship between the traffic volume and the travel time on the link. The capacity function developed by the U.S. Bureau of Public Roads (BPR) has been used in many countries, including Korea, without much effort to calibrate the parameters for its own transportation environment. Countries other than the United States, however, have distinctive demographic, economic, cultural, and behavioral characteristics; and they might need unique capacity functions for their own environments. Thus, it is important for Korea to have its own capacity function that can appropriately represent the Korea highway environment. Any attempt to model the Korean highway system without using a suitable capacity function might result in inappropriate solutions, because most modeling activities are crucially based on link travel time, and it is the capacity function that furnishes those link travel time. A link capacity function for Korea is calibrated based on a BPR type formula utilizing an alternative method. The alternative method is developed in a bilevel programming framework that uses link volume counts instead of link flow and travel time data. Detailed calibration results are reported.

[1]  Tschangho John Kim,et al.  The role of congestion of transportation networks in urban location and travel choices , 1987 .

[2]  Yong Jae Lee Methods for implementing network equilibrium models of urban location and travel choice , 1985 .

[3]  Yosef Sheffi,et al.  Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods , 1985 .

[4]  David E. Boyce,et al.  A bilevel programming algorithm for exact solution of the network design problem with user-optimal flows , 1986 .

[5]  C. Daganzo On the traffic assignment problem with flow dependent costs—II , 1977 .

[6]  K R Overgaard URBAN TRANSPORTATION PLANNING' TRAFFIC ESTIMATION , 1967 .

[7]  Carlos F. Daganzo,et al.  SOME STATISTICAL PROBLEMS IN CONNECTION WITH TRAFFIC ASSIGNMENT , 1977 .

[8]  Larry J. LeBlanc,et al.  AN EFFICIENT APPROACH TO SOLVING THE ROAD NETWORK EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM. IN: THE AUTOMOBILE , 1975 .

[9]  David Branston,et al.  LINK CAPACITY FUNCTIONS: A REVIEW , 1976 .

[10]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[11]  J. Wardrop ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .

[12]  N A Irwin,et al.  CAPACITY RESTRAINT IN ASSIGNMENT PROGRAMS , 1961 .

[13]  Theodore J Soltman EFFECTS OF ALTERNATE LOADING SEQUENCES ON RESULTS FROM CHICAGO TRIP DISTRIBUTION AND ASSIGNMENT MODEL , 1966 .

[14]  K B Davidson,et al.  THE THEORETICAL BASIS OF A FLOW-TRAVEL TIME RELATIONSHIP FOR USE IN TRANSPORTATION PLANNING , 1978 .

[15]  Sunduck Suh,et al.  Toward developing a national transportation planning model: A bilevel programming approach for Korea , 1988 .

[16]  Sunduck Suh Implementation and evaluation of nonlinear bilevel programming model of equilibrium network design problem , 1989 .

[17]  T. Koopmans,et al.  Studies in the Economics of Transportation. , 1956 .

[18]  P H Mijjer,et al.  OPTIMIZATION OF TRANSPORT NETWORK , 1989 .

[19]  Wilfred Candler,et al.  A linear two-level programming problem, , 1982, Comput. Oper. Res..

[20]  M. A. P. Taylor Parameter Estimation and Sensitivity of Parameter Values in a Flow-Rate/Travel-Time Relation , 1977 .

[21]  Louis E Keefer,et al.  A method for predicting speeds through signalized street sections , 1959 .

[22]  I Okutani EQUILIBRIUM FLOWS IN A NETWORK WITH CONGESTED LINKS , 1984 .

[23]  David E. Boyce,et al.  The effect on equilibrium trip assignment of different link congestion functions , 1981 .

[24]  Robert B Smock AN ITERATIVE ASSIGNMENT APPROACH TO CAPACITY RESTRAINT ON ARTERIAL NETWORKS , 1962 .

[25]  Mosher,et al.  A CAPACITY-RESTRAINT ALGORITHM FOR ASSIGNING FLOW TO A TRANSPORT NETWORK , 1963 .