Transportation Network Analysis

M. G. H. Bell is the author of Transportation Network Analysis, published by Wiley. Yasunori Iida is the author of Transportation Network Analysis, published by Wiley.

• Preface v1 Introduction 11.1 Motivation and approach 11.2 Network representation 21.3 Modes of travel 31.4 Network equilibrium 31.5 Generalised costs 51.6 Demand curves 61.7 Link cost functions 61.8 Supply curves 101.9 lntermodal equilibrium 121.10 User benefit and surplus 141.11 Time dependency 151.12 Structure of the book 152 Transportation Networks 172.1 Introduction 172.2 Network terminology 172.3 Transportation network types 192.4 Flow and cost variables 212.5 Incidence matrices 222.6 Conservation relationships 242.7 Shortest path algorithms 252.8 Path enumeration and column generation 292.9 Link choice probabilities 292.10 Utility maximisation and expected minimum cost 332.11 Network capacity 342.12 Space-time networks 342.13 Network equilibrium 372.14 Concluding remarks 403 Optimality 413.1 Introduction 413.2 Kinds of variable 413.3 Matrix operations 423.4 Objective functions 453.5 Constraints 473.6 Optimality conditions 493.7 Dual variables 513.8 Lagrangian equation 543.9 Sensitivities 563.10 Method of successive averages 593.11 Iterative balancing 593.12 Summary 613.13 Notation 654 Cost Functions 674.1 Introduction 674.2 Traffic representation 674.3 Link costs 684.4 Junction costs 724.5 Priority junctions 784.6 Signal controlled junctions 784.7 Discussion 825 Deterministic User Equilibrium Assignment 835.1 Introduction 835.2 Existence and uniqueness 865.3 Solution algorithms 895.4 Sensitivity 955.5 Most likely path flows 1005.6 Elastic demand 1025.7 lime-dependent networks 1085.8 Discussion 1116 Stochastic User Equilibrium Assignment 1136.1 Introduction 1136.2 Existence and uniqueness 1156.3 A general equivalent optimisation problem 1186.4 Logit assignment 1206.5 Probit assignment 1336.6 Sensitivity 1346.7 Elastic demand 1386.8 Space-time networks 1406.9 Discussion 1487 Trip Table Estimation 1497.1 Introduction 1497.2 Maximum entropy 1507.3 An generalised least squares 1557.4 Bi-level programming 1567.5 Linear path flow estimation 1607.6 Log-linear path flow estimation 1647.7 lime-dependent methods 1707.8 Conclusions 1768 Network Reliability 1798.1 Introduction 1798.2 Connectivity 1798.3 Structure function 1808.4 Structure function and reliability value 1838.5 Exact methods 1858.6 Heuristic methods 1868.7 Travel time reliability 1918.8 Future challenges 1929 Network Design 1939.1 Introduction 1939.2 Objective function 1959.3 Bi-Level programming 1969.4 Sensitivities 1979.5 Numerical example 1999.6 Conclusions 20410 Conclusions 20510.1 Network equilibrium 20510.2 Traffic assignment 20610.3 Path flow estimation 20710.4 Network reliability 20810.5 Network design 208References 209Index 215