Urban transportation networks: equilibrium analysis with mathematical programming method

Review of the book
The flow pattern in an urban network can be considered as the result of two competing mechanisms. On the one hand, system users (drivers, passengers, pedestrians) try to travel in a way that helps reduce the disutility of transportation. For example, drivers driving between a specific origin and a specific destination are likely to choose the route with the shortest travel time. On the other hand, disruption related to travel time is not constant and depends on the number of users of the transportation system. Therefore, in the previous example, the travel time on each path connecting the origin and destination is the function of the total traffic flow due to the disturbance. Therefore, it is not clear which route through the network has the shortest travel time. As a result, it may not be clear what the flow pattern in the network will be under different conditions. This book shows how this flow pattern can be determined for a network of urban networks by modeling these two mechanisms.

Table of Contents
The topics covered in this book are as follows:

Analysis of urban transportation networks
Solving minimization problems
Allocation problem formulation from the point of view of mathematical programming
Optimization algorithms
Solving the user equilibrium model
User equilibrium with variable demand
Traffic assighment and trip distribution models
Equilibrium relationship with related links
Traffic assighment and discrete choice models
Probabilistic network models
Probabilistic user equilibrium models
Probability distribution function and probit analysis