SONG 2 - Simulator of Network Growth version 2
2016-07-13
Loading...
Persistent link to this item
Statistics
View StatisticsCollection period
2006
Date completed
Date updated
Time period coverage
Geographic coverage
Source information
Journal Title
Journal ISSN
Volume Title
Title
SONG 2 - Simulator of Network Growth version 2
Published Date
2016-07-13
Authors
Author Contact
Levinson, David M
dlevinson@umn.edu
dlevinson@umn.edu
Type
Dataset
Programming Software Code
Programming Software Code
Abstract
Software used in the project Beyond Business as Usual (MnDOT MN/RC-2006-36) This research, extending the Mn/DOT-funded project If They Come, Will You Build It, assesses the implications of existing trends on future network construction. It compares forecast networks (using models estimated on historical decisions developed with previous research) under alternative budget scenarios (trend, above trend, below trend), with networks constructed according to alternative sets of decision rules developed with Mn/DOT and Metropolitan Council staff. The comparison evaluates alternative futures using a set of performance measures to determine whether the network we would get in the absence of a change in policies (allowing historical policies to go forward) outperforms or underperforms the networks developed by applying suggested decision rules. This evaluation methodology enables new decision rules for network construction (building new links or widening existing links) to be tested. The research suggests a path beyond “business as usual”.
This research incorporates results from the different scenarios tested. It presents the processes, approaches and development to encode historical decision rules. After analyzing flowcharts developed from the interviews of staff at different levels of government, if-then rules are generated for each jurisdiction. This research then describes the details and processes necessary to run the network forecasting models with various decision rules. Results for different scenarios are presented including adding additional constraints for the transportation network expansion and calibration process details. A comparison and analysis between scenarios is made in order to provide a final conclusion on what scenario will produce the greatest benefit for the Twin Cities Metropolitan Area Transportation Network.
Description
SONG2.1.0, powered by NEXUS, is developed to predict the growth of the Twin Cities road network 20 years from now.
This model has been calibrated. The calibration process starts from the 1990 network (Linkinfo_1990m.txt), exogenous 1990,1995,2000,2005 link capacities (read from Linkinfo_1990m, 1995m, 2000m, 2005m .txt, respectively), runs the travel demand model without investment and calibrates to match the station counts in 2005.The model starts from the 2005 network incorporating existing links, legacy links, and potential links (Linkinfo_2005.txt), with the flow pattern estimated from the last simulation period. To avoid confusions, code for calibration is not included.
This package includes two versions respectively for Scenarios 1-6 and Scenario 7. The scenarios are developed in the paper "Forecasting and Evaluating Network Growth" by David Levinson, Feng Xie, and Norah Montes de Oca. The difference between the two versions lies in they use different initial network files ("Linkinfo_2005"), as Scenario 7 has an expanded choice set of potential new links. As a result, the initial network in SONG_FINAL_a comprises 20,468 links (20,380 existing links and 88 legacy links), while that in SONG_FINAL_b 35,224 links.
To run either package, import it as a project into Eclipse or other java platforms, find SONG.java which contains the main class, and run it. In the SONG.java file, the variable "scenarioID" can be changed to indicate another scenario.
TGeneration.java includes estimated trip generation and trip attraction models.
TDistribution.java implements a doubly-constained trip distribution model.
DijkstrasAlgo.java includes the Dijkstra's algorithm for shortest path finding.
TAssignment.java includes Stochastic User Equilibrium traffic assignment. The original code is obtained in FORTRAN from Davis and Sanderson (2002). We translated it into java and made it more efficient.
Investment.java includes decision rules that vary by jurisdictions. Two major methods are included: the ranking() method scores road projects according to stated or revealed rules and ranks them according to the scores; the investing() method invests available budget in road projects according to their ranks and subject to costs and constraints. Please refer to "Forecasting and Evaluating Network Growth" for more details.
Feng Xie
May 17, 2007
Referenced by
Levinson, David, Feng Xie, Norah Montes de Oca (2012) Forecasting and Evaluating Network Growth. Networks and Spatial Economics 12(2) 239-262.
http://dx.doi.org/10.1007/s11067-009-9113-z
http://hdl.handle.net/11299/180023
http://dx.doi.org/10.1007/s11067-009-9113-z
http://hdl.handle.net/11299/180023
Related to
Replaces
Publisher
Collections
Funding information
Minnesota Department of Transportation
item.page.sponsorshipfunderid
item.page.sponsorshipfundingagency
item.page.sponsorshipgrant
Previously Published Citation
Suggested citation
Xie, Feng; Levinson, David M. (2016). SONG 2 - Simulator of Network Growth version 2. Retrieved from the Data Repository for the University of Minnesota (DRUM), http://doi.org/10.13020/D6V306.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.