Discrete-time system optimal dynamic traffic assignment (SO-DTA) with partial control for horizontal queuing networks

Abstract : We consider the System Optimal Dynamic Traffic Assignment problem with Partial Control (SO-DTA-PC) for general networks with horizontal queuing. The goal of which is to optimally control any subset of the networks agents to minimize the total congestion of all agents in the network. We adopt a flow dynamics model that is a Godunov discretization of the Lighthill-Williams-Richards (LWR) partial differential equation with a triangular flux function and a corresponding multi-commodity junction solver. Full Lagrangian paths are assumed to be known for the controllable agents, while we only assume knowledge of the aggregate turn ratios for the non-controllable (selfish) agents. We solve the resulting finite horizon non-linear optimal control problem using the discrete adjoint method.
Type de document :
Article dans une revue
Transportation Science, INFORMS, In press
Liste complète des métadonnées

Littérature citée [43 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01095707
Contributeur : Paola Goatin <>
Soumis le : mardi 16 décembre 2014 - 10:16:43
Dernière modification le : mercredi 11 avril 2018 - 01:58:41
Document(s) archivé(s) le : lundi 23 mars 2015 - 13:41:46

Fichier

SO-DTAonline.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01095707, version 1

Citation

Samitha Samaranayake, Jack Reilly, Walid Krichene, Maria Laura Delle Monache, Paola Goatin, et al.. Discrete-time system optimal dynamic traffic assignment (SO-DTA) with partial control for horizontal queuing networks. Transportation Science, INFORMS, In press. 〈hal-01095707〉

Partager

Métriques

Consultations de la notice

665

Téléchargements de fichiers

317