Network Pricing of Congestion-Free Networks: The Elastic and Linear Demand Case
研究了在多商品运输网络中，用户选择最便宜路径且需求随总成本线性下降时，如何设置通行费以最大化收入，并提出了三种混合二次规划求解方法。
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.