Methods for Large Scale Urban Network Design with Concave Improvement CostsDepartment of Mathematics, Linköping Institute of Technology, 1980 - Network analysis (Planning) - 18 pages |
From inside the book
Try this search over all volumes: Figune
Results 1-0 of 0
Common terms and phrases
150 assignment problems 9ij(Yij accuracy and computational approach in LeBlanc approximation to investment bound on F(x bound on F(x*,y bound technique branch and bound computational requirements computationally efficient procedures concave function CONCAVE IMPROVEMENT COSTS continuous improvement variables convex DESIGN WITH CONCAVE discuss solution algorithms flow on link given to computationally ij ij ij)EA improvement cost functions initial linear approximation Institute of Technology iteration Jörnsten lemma less than y¹ Let x*,y linear function linearized problem link ij link improvement functions Linköping Institute model accuracy network design problem non-convex objective function value optimal solution original problem P2 and P3 possible improvement levels practical capacity problem P1 proposed approach road network design SCALE URBAN NETWORK set of links shown in figure solution to P1 solved and added solving 150 assignment specified urban network Tennesee tradeoff between model traffic assignment problem upper bound URBAN NETWORK DESIGN Vanderbilt University