The search of optimal travel strategy on unreliable transit network is analyzed as solution of a Markov decision problem and two uses of this approach, recently presented by the authors, are recalled and compared. The first application is relative to normative strategy search, such as for path recommendation in innovative transit trip planners. The second use concerns subjective optimal strategy search in a dynamic strategy-based path choice modelling, especially suitable for real-time run-oriented simulation-based mesoscopic assignment models. The paper concludes with an overview of the benefits of the approach and outlines scopes for further research.
Nuzzolo, A., Comi, A. (2017). Transit travel strategy as solution of a Markov decision problem: Theory and applications. In 5th IEEE International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS) (pp. 850-855). IEEE [10.1109/MTITS.2017.8005631].
Transit travel strategy as solution of a Markov decision problem: Theory and applications
NUZZOLO, AGOSTINO
;COMI, ANTONIO
2017-01-01
Abstract
The search of optimal travel strategy on unreliable transit network is analyzed as solution of a Markov decision problem and two uses of this approach, recently presented by the authors, are recalled and compared. The first application is relative to normative strategy search, such as for path recommendation in innovative transit trip planners. The second use concerns subjective optimal strategy search in a dynamic strategy-based path choice modelling, especially suitable for real-time run-oriented simulation-based mesoscopic assignment models. The paper concludes with an overview of the benefits of the approach and outlines scopes for further research.File | Dimensione | Formato | |
---|---|---|---|
MT-ITS_2017_Markov_08005631_Published.pdf
solo utenti autorizzati
Descrizione: full paper
Licenza:
Non specificato
Dimensione
269.08 kB
Formato
Adobe PDF
|
269.08 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.