PortadaGruposCharlasMásPanorama actual
Buscar en el sitio
Este sitio utiliza cookies para ofrecer nuestros servicios, mejorar el rendimiento, análisis y (si no estás registrado) publicidad. Al usar LibraryThing reconoces que has leído y comprendido nuestros términos de servicio y política de privacidad. El uso del sitio y de los servicios está sujeto a estas políticas y términos.

Resultados de Google Books

Pulse en una miniatura para ir a Google Books.

Cargando...

Traffic Flow on Transportation Networks (MIT Press series in transportation studies)

por Gordon Frank Newell

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

Inscríbete en LibraryThing para averiguar si este libro te gustará.

Actualmente no hay Conversaciones sobre este libro.

Ninguna reseña
sin reseñas | añadir una reseña
Debes iniciar sesión para editar los datos de Conocimiento Común.
Para más ayuda, consulta la página de ayuda de Conocimiento Común.
Título canónico
Título original
Títulos alternativos
Fecha de publicación original
Personas/Personajes
Lugares importantes
Acontecimientos importantes
Películas relacionadas
Epígrafe
Dedicatoria
Primeras palabras
Citas
Últimas palabras
Aviso de desambiguación
Editores de la editorial
Blurbistas
Idioma original
DDC/MDS Canónico
LCC canónico

Referencias a esta obra en fuentes externas.

Wikipedia en inglés

Ninguno

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

No se han encontrado descripciones de biblioteca.

Descripción del libro
Resumen Haiku

Debates activos

Ninguno

Cubiertas populares

Ninguno

Enlaces rápidos

Valoración

Promedio: No hay valoraciones.

¿Eres tú?

Conviértete en un Autor de LibraryThing.

 

Acerca de | Contactar | LibraryThing.com | Privacidad/Condiciones | Ayuda/Preguntas frecuentes | Blog | Tienda | APIs | TinyCat | Bibliotecas heredadas | Primeros reseñadores | Conocimiento común | 205,965,028 libros! | Barra superior: Siempre visible