The present paper is devoted to the study of the feasible region for demand values in a congested urban road network. Travel demand estimation is considered to be the inverse of the traffic assignment problem, formulated as a congestion game. We show that the corresponding estimation problem has the form of a bilevel optimization program with a weak-defined feasible set of upper-level solution variables (even a trivial solution leads to the global optimum). However, we are lucky to prove that for any congested urban road network there is a polygon in the space of demand values, which significantly narrows the area of optimal solution search for the considering bilevel problem. Moreover, such a polygon appears to be easily designed for an arbitrary road network, using solely observed congestion as input data. Thus, the findings obtained in the paper contribute to the development of tools for travel demand estimation in a congested urban road network.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.