Evaluating Highway Capacity Investments using a GIS -based tool - Trip -based Full Marginal Cost Approach

This paper presents a geographic information system (GIS)-based interactive tool that was developed for the evaluation and analysis of full-marginal-costs (FMC) of highway transportation in New Jersey. First, a constrained k-shortest path algorithm is proposed to estimate the trip-based FMC of a trip along a set of feasible paths between each Origin-Destination (O-D) pair attractive to travelers. Next, various transportation cost categories are estimated. The methodology is then implemented in ArcGIS, using Visual Basic and C-programming language. The GIS-based tool, not only estimates FMC between a selected O-D pair, but also compares complete/partial networks to assess impacts of infrastructure investments on the FMC. This tool will help planners to calculate accurate costs between different trips for various user-defined scenarios of demand/supply changes.

[1]  M. C. Sinclair,et al.  A Comparative Study of k-Shortest Path Algorithms , 1996 .

[2]  Kaan Ozbay,et al.  Cost of Transporting People in New Jersey Phase 2 , 2007 .

[3]  Eugene Lawler,et al.  Combinatorial optimization , 1976 .

[4]  Kenneth Gillingham,et al.  Measuring marginal congestion costs of urban transportation: Do networks matter? , 2007 .

[5]  N. J. V. Zijpp,et al.  Path enumeration by finding the constrained K-shortest paths , 2005 .

[6]  Genevieve Giuliano,et al.  Analysis of the cost structure of an urban bus transit property , 1984 .

[7]  Robert B. Dial,et al.  Bicriterion Traffic Equilibrium: T2 Model, Algorithm, and Software Overview , 2000 .

[8]  Joseph Berechman,et al.  ESTIMATION AND EVALUATION OF FULL MARGINAL COSTS OF HIGHWAY TRANSPORTATION IN NEW JERSEY , 2001 .

[9]  David M Levinson,et al.  Road Pricing with Autonomous Links , 2005 .

[10]  Mark A. Delucchi,et al.  THE EXTERNAL DAMAGE COST OF NOISE EMITTED FROM MOTOR VEHICLES , 1998 .

[11]  Claus Doll,et al.  External costs of transport: accident, environmental and congestion costs of transport in Western Europe , 2000 .

[12]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[13]  Hanif D. Sherali,et al.  Time-Dependent, Label-Constrained Shortest Path Problems with Applications , 2003, Transp. Sci..

[14]  Sergio R. Jara-Díaz,et al.  Estimation of marginal transport costs; the flow aggregation function approach , 1992 .

[15]  David Bernstein,et al.  FINDING ALTERNATIVES TO THE BEST PATH , 1997 .

[16]  Gerard McCullough,et al.  THE FULL COST OF TRANSPORTATION IN THE TWIN CITIES REGION , 2000 .

[17]  Adib Kanafani,et al.  The Full Cost Of Intercity Transportation - A Comparison Of High Speed Rail, Air And Highway Transportation In California , 1996 .

[18]  Erhan Erkut,et al.  On finding dissimilar paths , 2000, Eur. J. Oper. Res..

[19]  I. Mayeres,et al.  THE MARGINAL EXTERNAL COSTS OF URBAN TRANSPORT , 1996 .

[20]  Nicos Christofides,et al.  An efficient implementation of an algorithm for finding K shortest simple paths , 1999, Networks.

[21]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[22]  Douglas R. Shier,et al.  On algorithms for finding the k shortest paths in a network , 1979, Networks.