Discrete time dynamic traffic assignment models and solution algorithm for managed lanes

DOI10.1007/s10898-010-9618-5zbMath1230.90140OpenAlexW2005763765WikidataQ57734139 ScholiaQ57734139MaRDI QIDQ652653

Ashwin Arulselvan, Qipeng Phil Zheng

Publication date: 15 December 2011

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-010-9618-5

zbMATH Keywords

decompositionmixed integer programmingdynamic traffic assignmentsystem optimummanaged lanetime expanded network

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items (1)

Network flow with intermediate storage: models and algorithms

Uses Software

• DynaMIT
• GAMS

Cites Work

• Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum
• A Dynamic Traffic Assignment Model and a Solution Algorithm
• A Discrete Time, Nested Cost Operator Approach to the Dynamic Network User Equilibrium Problem
• A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Discrete time dynamic traffic assignment models and solution algorithm for managed lanes