07 Development strategy

07 Development strategy - Session 7 Development Strategy...

Info iconThis preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Session 7 Development Strategy 20060322 Part 7A | LUTO solution
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 How to identify NDA’s? | Type 4 problem | General LUTO problem Financial and Economic Evaluation Criteria | Constraints + minimizing objective function | Objective function = φ (Xi, Ye) | Constraint: F(Xi, Ye) constant z (Capital cost constraint) z (budget) | Transportation Costs: | Capital = f(cap. Y e ) | Op. = f(V e ,Tii) | VOT=f(V e ,Tii)
Background image of page 2
3 Difficulty of solving the problem | Transportation model is complex, mathematical relations intractable | Large no. of combinations of discrete variables, cannot test 1 by 1 (unlike Type 3 problem) | Mathematical or engineering approach? Solution Structure | Systematize successful planning practice “Science is nothing else but the systematic treatment of everyday knowledge” HOW?!?
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4 Traditional approach (1) Land use design Network design Traditional approach (2) | Successful for slow rate of change | Simulated by iterative approach with “small change” in each step of LU & NW design problems
Background image of page 4
5 Modern Approach Alternating LU Optimization & NW Optimization Processes LU Optimization | With given NW, | Linearize OF & | Find optimum land use allocation (to zones)
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
6 NW Optimization 1) Define “Maximal” NW of optional links (M) 2) With land use activities given, 3) Find what link to be deleted from maximal network and what capacity to be allocated to each link in order to optimize the given objective function How to Link up the 2 Sub-problem?! Define Maximal NW of optional links at each iteration step
Background image of page 6
7 Solution Concept “Necessary” Link for “Base Growth” condition Necessary Links If a new link is required when trips under the base-growth condition are assigned to the max network, the link is necessary for all future development scenarios.
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
8 Effect of Necessary Links | Optimization process will force the choice of development pattern which will make max use of all such necessary links first. Other Optional Links | As any one development area is committed in the real development process, it becomes a part of future “Base Growth” ( new BG) | Hence is a “semi-necessary link” for the new “committed scenario
Background image of page 8
9
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 10
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/26/2012 for the course CIVIL 6049 taught by Professor Can'tremember during the Spring '12 term at HKU.

Page1 / 38

07 Development strategy - Session 7 Development Strategy...

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online