Abstract
This paper presents a method for solving a dynamic system optimal (DSO) traffic assignment problem with uncertain travel time. Formulating the DSO assignment in a network with two parallel links as a stochastic control problem, we derive the optimality conditions of the assignment problem. We then show that the optimality conditions can be equivalently stated as a dynamical system of generalized complementarity problems (GCP). Based on this reformulation, we provide an efficient algorithm for solving the stochastic control problem.
Sign-in/Register to access full text options 
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.
