A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS
Determine the traffic equilibrium on a congested road network. This task typically raises a multicommodity flow problem with nonlinear, nondecreasing, convex arc cost functions. In the present article, the author considers the general network problem and in particular discusses the traffic equilibrium example. He first shows that one can concentrate on the dual of the multicommodity problem, since its solution directly determines an optimal solution of the original one. Moreover, the dual problem is rather well structured, it can be viewed as an essentially unrestricted maximization of a sum of concave functions: There will be one such function for every arc and one for every commodity, and for any specification of the dual variables, the values of these functions are implicately defined by rather simple minimization problems. Therefore, this structure naturally leads to a doubly iterative algorithm, reminiscent of column generation techniques. The author gives extensive guidelines concerning the implementation of the algorithm, proves its adequacy and discusses methods to speed up its convergence. The analysis, together with the reported computational results, convinces, so that one may expect this new approach to be able to deal with fairly large problems.
- Optimal Two-commodity Flows with Non-linear Cost Functions
- Nonlinear cost network models in transportation analysis
- An implementation of linear and nonlinear multicommodity network flows
- Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
- Local optimality conditions for multicommodity flow problems with separable piecewise convex costs
- A bundle-type algorithm for routing in telecommunication data networks
- A decomposition method for solving multicommodity network equilibria
- scientific article; zbMATH DE number 5613782 (Why is no real title available?)
- Nonlinear cost network models in transportation analysis
- Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms
- A computationally efficient method for nonlinear multicommodity network flow problems
- Inverse Nonlinear Multicommodity Flow Optimization by Column Generation
- Optimal Two-commodity Flows with Non-linear Cost Functions
- Monotonicity and conformality in multicommodity network‐flow problems
- Cyclically monotone non-optimal N-marginal transport plans and Smirnov-type decompositions for N-flows
- D.C. programming approach for multicommodity network optimization problems with step increasing cost functions
This page was built for publication: A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3329185)