A Parallel Algorithm for NMNF Problems with a Large Number of Capacity Constraints

@article{Lin2007APA,
  title={A Parallel Algorithm for NMNF Problems with a Large Number of Capacity Constraints},
  author={Shieh-Shing Lin},
  journal={IEICE Trans. Fundam. Electron. Commun. Comput. Sci.},
  year={2007},
  volume={90-A},
  pages={2884-2890}
}
  • Shieh-Shing Lin
  • Published 1 December 2007
  • Computer Science
  • IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
In this paper, we propose a converting technique based method to solve nonlinear multi-commodity network flow (NMNF) problems with a large number of capacity constraints and discuss the associated implementation. We have combined this method with a successive quadratic programming (SQP) method and a parallel dual-type (PDt) method possessing decomposition effects. We have tested our method in solving a kind of lattice-type network system examples of NMNF problems. The simulation results show… 
View via Publisher
personnel.sju.edu.tw

Figures and Tables from this paper

36 References

Exact solution of multicommodity network optimization problems with general step cost functions

Design of Capacitated Multicommodity Networks with Multiple Facilities

It is shown that the subproblem can be formulated as a multiple choice knapsack problem that is solved by dynamic programming and produces solutions within about 5% of lower bound on the average on most problems.

A branch-and-cut algorithm for capacitated network design problems

A branch-and-cut algorithm to solve capacitated network design problems and uses a new rule called “knapsack branching” to choose the branching variable.

A Specialized Interior-Point Algorithm for Multicommodity Network Flows

A new specialized interior-point algorithm that uses both a preconditioned conjugate gradient solver and a sparse Cholesky factorization to solve a linear system of equations at each iteration of the algorithm.

Bundle-based relaxation methods for multicommodity capacitated fixed charge network design

Fast approximation algorithms for multicommodity flow problems

It is proved that a (simple) k-commodity flow problem can be approximately solved by approximately solving O(k log2n) single-comodity minimum-cost flow problems, and the first polynomial-time combinatorial algorithms for approximately solving the multicommodation flow problem are described.

A MPBSG Technique Based Parallel Dual-Type Method Used for Solving Distributed Optimal Power Flow Problems

This paper has combined this method with a projected Jacobi (PJ) method and a modified parallel block scaled gradient (MPBSG) method possessing decomposition effects to solve the distributed optimal power flow problem.

Fast deterministic approximation for the multicommodity flow problem

An optimization version of the multicommodity flow problem which is known as the maximum concurrent flow problem is considered and it is shown that an approximate solution can be computed deterministically using O(k(ε−2 + logk) logn) 1-commodity minimum-cost flow computations.

A Decomposition-Technique-Based Algorithm for Nonlinear Large Scale Mesh-Interconnected System and Application

The test results show that the proposed algorithm has computational efficiency with respect to the conventional approach of the centralized Newton method and the state-of-the-art Block-Parallel Newton method.

Fast approximation algorithms for fractional packing and covering problems

Fast algorithms that find approximate solutions for a general class of problems, which are called fractional packing and covering problems, are presented, and an important result is a theoretical analysis of the running time of a Lagrangian relaxation based algorithm.