A MILP approximation approach for finding optimal toll locations and levels in elastic demand traffic networks
2010 (English)In: TRANSPORTATION AND URBAN SUSTAINABILITY: Proceedings of the 15th International Conference of Hong Kong Society for Transportation Studies (HKSTS) / [ed] Sumalee, A; Lam, WHK; Ho, HW; Siu, B, Hong Kong, China: Hong Kong Society for Transportation Studies , 2010, 107-114 p.Conference paper (Refereed)
The toll design problem (TDP) is to find optimal toll locations and corresponding toll levels in a congestion pricing scheme. The TDP can be formulated as a non-convex mathematical program, in which the road users are assumed to be distributed according to a user-equilibrium with elastic demand. This program is hard to solve due to non-convexity and non-smoothness. In this paper, the TDP is approximated by a mixed integer linear program (MILP), in which the non-linear functions of the TDP are approximated by piecewise linear ones. The MILP can be solved to its global optimal solution by known methods, and its optimal solution will give a lower bound on the optimal solution to the TDP. By iteratively updating the MILP approximation, the error introduced by the approximation is reduced, and for a test network with nine nodes and 18 links, the global optimal solution is obtained.
Place, publisher, year, edition, pages
Hong Kong, China: Hong Kong Society for Transportation Studies , 2010. 107-114 p.
Transport Systems and Logistics
IdentifiersURN: urn:nbn:se:liu:diva-75854ISI: 000290467500016ISBN: 9789889884789OAI: oai:DiVA.org:liu-75854DiVA: diva2:509465
The 15th HKSTS International Conference, Hong Kong, 11-14 December, 2010