Abstract
We present a Gauss–Seidel type algorithm for the problem of adjusting an O–D matrix by using observed flows in congested networks. The problem is formulated as a bi‐level optimization problem. Necessary conditions for some properties of the solution of the O–D matrix adjusting problem are derived and a coordinate descent method is developed. The algorithm takes full advantage of the network structure of the lower level problem and does not require many objective function evaluations. Computational results for some numerical examples are reported.
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 callMore From: International Transactions in Operational Research
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.
