A Parallel Algorithm for NMNF Problems with a Large Number of Capacity Constraints(Numerical Analysis and Optimization)

スポンサーリンク

概要

• 論文の詳細を見る

• 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 that the proposed algorithm is efficient for solving NMNF problems and successfully handles a large number of coupling capacity constraints. Furthermore, the computational efficiency of the proposed algorithm is more significant while the numbers of capacity constraints are increased.

• 社団法人電子情報通信学会の論文
• 2007-12-01

著者

• Lin Shieh-shing

  Department Of Electrical Engineering St. John's University

関連論文

• An Experiment for Estimating Accurate States in Distributed Power Systems
• Ordinal Optimization Approach for Throughput Maximization Problems in MOFDM Uplink System
• A Decomposition-Technique-Based Algorithm for Nonlinear Large Scale Mesh-Interconnected System and Application(Systems and Control)
• A MPBSG Technique Based Parallel Dual-Type Method Used for Solving Distributed Optimal Power Flow Problems(Systems and Control)
• A Parallel Implementation of the PBSGDS Method for Solving CBAU Optimization Problems(Systems and Control)
• A Parallel Algorithm for NMNF Problems with a Large Number of Capacity Constraints(Numerical Analysis and Optimization)

スポンサーリンク