Dynamic penalty function method for the side constrained traffic assignment problem

DOI10.1016/j.amc.2008.09.014zbMath1177.90081OpenAlexW2115563866MaRDI QIDQ2379057

Hedayat Z. Aashtiani, Abbas Babazadeh, Amir H. Shahpar

Publication date: 14 January 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2008.09.014

zbMATH Keywords

linearizationtraffic assignmentside constraintsdynamic penalty function

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Discrete location and assignment (90B80)

Related Items (4)

Stability of intelligent transportation network dynamics: a daily path flow adjustment considering travel time differentiation ⋮ Convergence study of minimizing the nonconvex total delay using the lane-based optimization method for signal-controlled junctions ⋮ Path-based dynamic user equilibrium model with applications to strategic transportation planning ⋮ A reinforcement learning scheme for the equilibrium of the in-vehicle route choice problem based on congestion game

Cites Work

• Unnamed Item
• On the convergence of descent methods for monotone variational inequalities
• Complementary pivot theory of mathematical programming
• Multiplier and gradient methods
• Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
• Technical Note—Shortest-Path Algorithms: A Comparison
• Nonlinear Programming
• Bimatrix Equilibrium Points and Mathematical Programming
• The Linear Complementarity Problem

This page was built for publication: Dynamic penalty function method for the side constrained traffic assignment problem