Abstract

This paper addresses the problem of simultaneous route guidance and traffic signal optimization problem (RGTSO) where each vehicle in a traffic network is guided on a path and the traffic signals servicing these vehicles are set to minimize their travel times. The network is modeled as a space-phase-time (SPT) hyper-network to explicitly represent the traffic signal control phases and time-dependent vehicle paths. A Lagrangian-relaxation-based optimization framework is proposed to decouple the RGTSO problem into two subproblems: the Route Guidance (RG) problem for multiple vehicles with given origins and destinations and the Traffic Signal Optimization (TSO) problem. In the RG subproblem, the route of each vehicle is provided subject to time-dependent link capacities imposed by the solution of the TSO problem, while the traffic signal timings are optimized according to the respective link travel demands aggregated from the vehicle trajectories. The dual prices of the RG subproblem indicate search directions for optimization of the traffic signal phase sequences and durations in the TSO subproblem. Both RG and TSO subproblems can be solved using a computationally efficient finite-horizon dynamic programming framework, enhanced by parallel computing techniques. Two numerical experiments demonstrated that the system optimum of the RGTSO problem can be quickly reached with relatively small duality gap for medium-size urban networks.

Full Text
Paper version not known

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 call

Disclaimer: 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.