On Path Marginal Cost Analysis and its Relation to Dynamic System-Optimal Traffic Assignment

摘要: This paper studies the problem of evaluating path marginal cost in system-optimal dynamic traffic assignment (SO-DTA) models. Through a series examples, demonstrates that costs are not simple additions corresponding link unless flow perturbation travels with vehicle unit initiated perturbation. The further shows one can compute efficiently for networks special structure (i.e. mono-centric), and proposed an evaluation method decomposes to such networks. Preliminary numerical experiments indicate this solution scheme generate solutions close analytical where they knows. At present, applies without diverges embedded models restricted those considering queue spillback. relaxation either aspect brings additional challenges predicting propagation, hence difficulties costs, is worthy research.