A Mixed Integer Linear Program for the Single Destination System Optimum Dynamic Traffic Assignment Problem with Physical Queue
Shuguang Li, Qing-Hua Zhou, Yongfeng Ju
Promet (Zagreb) · 2010
doi:10.7307/ptt.v22i4.189 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
In order to solve the system optimum dynamic traffic assignment problem, the whole link model with physical queue is used to formulate the single destination system optimum dynamic traffic assignment problem as a mixed linear program. A relationship between the cumulative curves and the wave speed presented by Newell (1993) is used to present a dynamic network model in considering spillback queue. And nonlinear constrains are relaxed into mixed linear constrains; the linear program software is used to solve the system optimum dynamic traffic assignment problem. A numerical example illustrates the simplicity and applicability of the proposed approach. KEYWORDS: Dynamic System Optimum Traffic Assignment; physical queue; mixed integer linear programming
Abstract licence: CC BY
References9
9 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.