Selecting and Scheduling Link and Intersection Improvements in Urban Networks

Deciding which projects, alternatives or investments to implement is a complex and important problem not only in transportation engineering, but in management, operations research and economics. Projects are interrelated if their benefits or costs depend on which other projects are implemented. Furthermore, in the network development problem analyzed here, the timing of projects also affects the benefits and costs of other projects. This paper presents a method for optimizing the selection and scheduling of interrelated improvements in road networks that explicitly considers intersections. The Frank Wolfe algorithm, which is modified here to consider intersections, is used for evaluating network improvements as well as for traffic assignment. Intersections are modelled with pseudo-links whose delays are estimated with Akcelik’s generalized model. The objective is to minimize the present value of total costs (including user time) by determining which projects should be selected and when they should be completed. A genetic algorithm is used for optimizing the sequence and schedule of projects.

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

[2]  D. Heidemann.  Queue length and delay distributions at traffic signals , 1994 .

[3]  G. Nemhauser,et al.  Discrete Dynamic Programming and Capital Allocation , 1969 .

[4]  Bg Heydecker.  Modelling dynamic transportation networks. An intelligent transportation system-oriented approach (second edition). , 1999 .

[5]  R Akcelik,et al.  THE HIGHWAY CAPACITY MANUAL DELAY FORMULA FOR SIGNALIZED INTERSECTIONS , 1988 .

[6]  R. Weiner.  Lecture Notes in Economics and Mathematical Systems , 1985 .

[7]  Y. She.  Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods , 1985 .

[8]  Michael Florian,et al.  An Application and Validation of Equilibrium Trip Assignment Methods , 1976 .

[9]  M. L. Cochran,et al.  Investment model for R&D project evaluation and selection , 1971 .

[10]  Bin Ran,et al.  Dynamic Urban Transportation Network Models , 1994 .

[11]  Paul Schonfeld,et al.  Prioritizing Interrelated Road Projects Using Metaheuristics , 2016 .

[12]  S Teply,et al.  Quality of service in the new Canadian signal capacity guide , 2021, Highway Capacity and Level of Service.

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

[14]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[15]  Piotr Olszewski.  Modeling probability distribution of delay at signalized intersections , 1994 .

[16]  Bin Ran,et al.  MODELING DYNAMIC TRANSPORTATION NETWORKS , 1996 .

[17]  F. Webster.  TRAFFIC SIGNAL SETTINGS , 1958 .

[18]  Zilla Sinuany-Stern,et al.  Resource allocation to interrelated projects , 1982 .

[19]  H. Weingartner.  Capital Budgeting of Interrelated Projects: Survey and Synthesis , 1966 .

[20]  Paul Schonfeld,et al.  GENETIC ALGORITHM FOR SELECTING AND SCHEDULING INTERDEPENDENT PROJECTS , 2001 .