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

DOI10.1007/BF02031942zbMATH Open0842.90033MaRDI QIDQ1908281FDOQ1908281

Authors: M. O. Ghali 

Publication date: 6 August 1996

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

Recommendations

• Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge
• A path-based solution algorithm for dynamic traffic assignment
• Minimum cost paths over dynamic networks
• A variational inequality formulation of the dynamic traffic assignment problem
• A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models
• Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights
• On the quickest flow problem in dynamic networks -- a parametric min-cost flow approach
• scientific article; zbMATH DE number 1918689
• scientific article; zbMATH DE number 817541
• Determining minimum cost flows in dynamic networks with transit time functions that depend on flow and time

zbMATH Keywords

dynamic traffic assignmentroute guidancelooping routesminimum instantaneous cost path principle

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cites Work

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

Cited In (1)

• A hybrid route choice model for dynamic traffic assignment

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908281)