1.

Record Nr.

UNINA9910366620403321

Autore

Krylatov Alexander

Titolo

Optimization Models and Methods for Equilibrium Traffic Assignment / / by Alexander Krylatov, Victor Zakharov, Tero Tuovinen

Pubbl/distr/stampa

Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020

ISBN

3-030-34102-X

Edizione

[1st ed. 2020.]

Descrizione fisica

1 online resource (231 pages)

Collana

Springer Tracts on Transportation and Traffic, , 2194-8119 ; ; 15

Disciplina

388

388.314

Soggetti

Transportation engineering

Traffic engineering

Mathematical optimization

Game theory

Transportation Technology and Traffic Engineering

Optimization

Game Theory

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Nota di contenuto

Introduction -- Optimization traffic assignment models -- Optimization traffic assignment methods -- Optimization models and methods for network design -- Networking issues.

Sommario/riassunto

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. .