Economics at your fingertips  

Graphical solution for system optimum dynamic traffic assignment with day-based incentive routing strategies

Chuan-Lin Zhao and Ludovic Leclercq

Transportation Research Part B: Methodological, 2018, vol. 117, issue PA, 87-100

Abstract: This paper analyzes the dynamic traffic assignment problem on a three-alternative network with day-based incentive routing strategies by using graphical solution method. It is assumed that the cumulative count curve of vehicles is known and that the arrival rate is unimodal. The dynamic system optimum (DSO) allocation lines are first drawn based on calculus of variations. Three possible optimal allocation lines are analyzed. A day-based incentive routing strategy is designed and conditions that when and how to implement the incentive scheme to realize DSO are then derived. Extension to general parallel networks is also given. Examples are presented to demonstrate the effectiveness of the scheme.

Keywords: System optimum; Dynamic traffic assignment; Graphical solution method; Incentive strategy (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations Track citations by RSS feed

Downloads: (external link)
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link:

Ordering information: This journal article can be ordered from
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Transportation Research Part B: Methodological is currently edited by Fred Mannering

More articles in Transportation Research Part B: Methodological from Elsevier
Bibliographic data for series maintained by Dana Niculescu ().

Page updated 2019-01-19
Handle: RePEc:eee:transb:v:117:y:2018:i:pa:p:87-100