This chapter describes a comprehensive modelling approach to day-to-day dynamic assignment to congested networks through discrete-time Markovian Stochastic Process (SP) models based on simple models for cost and choice update. The contents of this chapter mirror those of Chapter 4, as far as possible. Some issues about solutions and several examples of a toy network are analysed and discussed.
Dynamics and Stochasticity in Transportation Systems Part II - Assignment to congested networks: Day-to-day dynamics—Stochastic Processes
Giulio E Cantarella;Chiara Fiori;
2023-01-01
Abstract
This chapter describes a comprehensive modelling approach to day-to-day dynamic assignment to congested networks through discrete-time Markovian Stochastic Process (SP) models based on simple models for cost and choice update. The contents of this chapter mirror those of Chapter 4, as far as possible. Some issues about solutions and several examples of a toy network are analysed and discussed.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
