Optimization Models and Methods for Equilibrium Traffic Assignment (Hardcover, 1st ed. 2020)

This book is focused on the discussion of the traffic assignment problem, the mathematical and practical meaning of variables, functions and basic principles. This work gives information about new approaches, methods and algorithms based on original methodological technique, developed by authors in their publications for the past several years, as well as corresponding prospective implementations. The book may be of interest to a wide range of readers, such as civil engineering students, traffic engineers, developers of traffic assignment algorithms etc. The obtained results here are to be used in both practice and theory. This book is devoted to the traffic assignment problem, formulated in a form of nonlinear optimization program. The most efficient solution algorithms related to the problem are based on its structural features and practical meaning rather than on standard nonlinear optimization techniques or approaches. The authors have carefully considered the meaning of the traffic assignment problem for efficient algorithms development.

General

Imprint:	Springer Nature Switzerland AG
Country of origin:	Switzerland
Series:	Springer Tracts on Transportation and Traffic, 15
Release date:	December 2019
First published:	2020
Authors:	Alexander Krylatov • Victor Zakharov • Tero Tuovinen
Dimensions:	235 x 155mm (L x W)
Format:	Hardcover
Pages:	228
Edition:	1st ed. 2020
ISBN-13:	978-3-03-034101-5
Categories:	Books > Professional & Technical > Civil engineering, surveying & building > Highway & traffic engineering Books > Science & Mathematics > Mathematics > Optimization > Game theory Promotions
LSN:	3-03-034101-1
Barcode:	9783030341015

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!