Abstract
In this work, we address the problem of maximizing the revenue raised from tolls set on a multicommodity transportation network, taking into account that users are assigned to cheapest paths, and that demand is a linearly decreasing function of total path cost (initial cost of carrying the products plus toll). We propose for its numerical solution three mixed quadratic formulations, either in arc or path flow space. Similar to what was achieved in the fixed demand case, we analyze the structure and properties of the problem, including its theoretical complexity. On the computational side, we analyze the sensitivity of central processing unit time with respect to two key parameters, namely, demand elasticity and percentage of toll arcs.
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.
