Inverse nonlinear multicommodity flow optimization by column generation
We present a solution algorithm for an inverse nonlinear multicommodity network flow problem. This problem is to find link cost adjustments that make a given target link flow solution optimal in a nonlinear multicommodity network flow problem, and that are optimal with respect to a specified objective. The solution procedure uses column generation. We present computational results for instances where the nonlinear multicommodity network flow problems are small and medium scale traffic equilibrium problems, and where system optimal link flows are targeted. The computational results show that the solution procedure is a viable approach for solving medium-scale instances of the inverse traffic equilibrium problem.
traffic equilibrium inverse optimization convex multicommodity network flow problem toll revenue optimization