A note on the minimum instantaneous cost path of the dynamic traffic assignment problem

DOI10.1007/BF02031942zbMath0842.90033MaRDI QIDQ1908281

M. O. Ghali

Publication date: 6 August 1996

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

dynamic traffic assignmentroute guidancelooping routesminimum instantaneous cost path principle

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (1)

A hybrid route choice model for dynamic traffic assignment

Cites Work

• Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem

This page was built for publication: A note on the minimum instantaneous cost path of the dynamic traffic assignment problem