Dynamic capacitated user-optimal departure time/route choice problem with time-window

DOI10.1016/S0377-2217(00)00165-XMaRDI QIDQ5939591zbMATH OpenOpenAlexFDO

Authors Hongkai Chen, M. S. Chang, C. Y. Wang

Publication date 29 July 2001

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0377-2217(00)00165-x

zbMATH Keywords

augmented Lagrangian methoddynamic capacitated user-optimal departure time/route choicetime-space networktime-windowvariational inequality

Mathematics Subject Classification ID

Variational inequalities (global problems) in infinite-dimensional spaces (58E35) Deterministic network models in operations research (90B10) Applications of mathematical programming (90C90)

Recommendations

• A demand model with departure time choice for within-day dynamic traffic assignment
• scientific article; zbMATH DE number 2096638
• A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem
• System optimal and user equilibrium time-dependent traffic assignment in congested networks
• An Intersection-Movement-Based Dynamic User Optimal Route Choice Problem

Cited in

(4)

• The time-dependent capacitated profitable tour problem with time windows and precedence constraints
• Applications of sensitivity analysis for probit stochastic network equilibrium
• A cumulative perceived value-based dynamic user equilibrium model considering the travelers' risk evaluation on arrival time
• A dynamic transportation model for the Stockholm area: Implementation issues regarding departure time choice and OD-pair reduction

This page was built for publication: Dynamic capacitated user-optimal departure time/route choice problem with time-window

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