Traffic flow on transportation networks

摘要: This book, which was designed by the author as a primary text for his courses at Institute of Transportation Studies, University California, Berkeley, explains in detail advantages and limitations network analysis applied to transportation problems.In particular, it discusses analyzes various issues that are relevant traffic assignment problem: Given rates travelers make trips between origins destinations, how will distribute itself over given network, does this distribution depend upon geometry network?The book conventional mathematical preliminaries formulating solving problem--graphs, metrics, flows, shortest paths, like--which primarily oriented toward problem computer. However, also places considerable emphasis on evaluating flows analytic methods idealized networks (for example, rectangular or radial grids) order illustrate flow depends certain geometrical properties network.The book's particular contribution is exploiting characteristics devise simple facilitate intuitive understanding patterns these networks. All concepts self-contained.Contents: Preface Summary; Planning; Mathematical Abstractions (elementary definitions graphs, especially notion routes accessibility); Metrics Shortest Routes; Other Methods (describes metric--travel time--on geometries); Approximations Idealizations; Flows Networks; Traffic Assignment; Assignments Idealized Nonidentical Travelers; Optimal Network Geometry, Nonconvex Objective Functions; Chapter references problems; Index."Traffic Flow Networks" recommended use first- second-year graduate engineering supplementary reading other transportation. The material covers interest academic, industrial, government planners, well professionals students operations research.This fifth MIT Press Series Studies.