Optimizing toll levels using linear approximation approach
2009 (English)In: 4th Kuhmo Nectar Conference, 2009Conference paper (Refereed)
This paper proposes a heuristic solution algorithm for solving the non-convex toll level problem for fixed demand networks in which the road users are distributed according to a user equilibrium. In the toll level problem we search for continuous toll levels, given a fixed set of tollable links, to minimize the total travel time in the traffic network. The toll level problem is converted by a linearization scheme to approximate the objective function and constraints in the original problem. This approximation gives a mixed integer linear program (MILP) which has the property of global optimum, and gives a lower bound estimation of the original non-linear problem. The user equilibrium condition is represented by the variational inequality (VI) constraints, and the MILP approximation is solved by applying a cutting constraint algorithm (to deal with the VI-constraints) together with a commercial MILP-solver. Numerical results are presented for a small network, and the results are encouraging.
Place, publisher, year, edition, pages
congestion pricing, network design, global optimization, bi-level optimization
Other Civil Engineering
IdentifiersURN: urn:nbn:se:liu:diva-19766OAI: oai:DiVA.org:liu-19766DiVA: diva2:228483