Abstract
The paper considers the traffic assignment problem when there are junctions controlled by traffic signals, and the traffic capacity of each junction is limited. We give certain properties of a control policy. If a particular policy possesses these properties then (under natural conditions) any feasible assignment problem has a solution consistent with that policy. In the mathematical model, traffic flows at one junction do not affect costs at others; this is the most important restriction on the work presented here.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
