## A Network Extraction Algorithm and Its Effects on the Network Design ProblemDepartment of Civil Engineering, Northwestern University, 1984 - Network analysis (Planning) - 36 pages |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

0/D matrices 0/D trip matrix 1st Aggregate 2nd Aggregate 3rd Aggregate Aggregate 7 Candidate aggregation process candidate project links Candidate Projects 122.645 Candidate Projects 212.926 Candidate Projects 64.010 computation constraints criterion definition of insignificant Design Problem Solution destination t(k detailed network Different Links Selected equili equilibrium flow levels equilibrium flow problem extracted links 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 link volumes maximum percentage error Network 0riginal 1st 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 optimal original and aggregate original network Poorzahedy revise the 0/D revised 0/D trip rithm Selected for Improvement sensitivity analyses Solving the Network subnetwork table 5(b test network Unique Budget Levels user equilibrium flow vehicle hours