A Network Extraction Algorithm and Its Effects on the Network Design ProblemDepartment of Civil Engineering, Northwestern University, 1984 - Network analysis (Planning) - 36 pages |
Common terms and phrases
1st Aggregate 2nd 3rd Aggregate Aggregate 2nd Aggregate aggregate network resulted aggregation process candidate project links computation constraints criterion definition of insignificant Design Problem Solution detailed network equili equilibrium flow levels equilibrium flow problem equilibrium link flows extracted links extraction execution extraction process flow from origin Flow on link flow over link Frank-Wolfe algorithm Haghani and Daskin insignificant links large number Levels with Different link cost functions link extraction maximum percentage error Network Design Execution network design problem network design solutions network element extraction network extraction algorithm Network Flow Northwestern University number of links number of projects O/D trip matrix origin h(k Original 1st Aggregate original and aggregate original network Poorzahedy prespecified Projects 5 Candidate proposed network extraction revise the O/D revised O/D trip rithm Selected for Improvement sensitivity analyses Solving the Network subnetwork table 5(b test network U.S. DOT unique budget levels user equilibrium flow vehicle hours x₁