A computationally efficient method for nonlinear multicommodity network flow problems

被引:0
|
作者
Lin, SY
Lin, CH
机构
[1] Department of Control Engineering, National Chiao Tung University, Hsinchu
关键词
D O I
10.1002/(SICI)1097-0037(199707)29:4<225::AID-NET6>3.0.CO;2-H
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we present a new method for solving nonlinear multicommodity network flow problems with convex objective functions. This method combines a well-known projected Jacobi method and a new dual projected pseudo-quasi-Newton (DPPQN) method which solves multicommodity flow quadratic subproblems induced in the projected Jacobi method. The DPPQN method is a dual Newton-type method that differs very much from the conventional Lagrangian Newton method; our method fully exploits the structural advantages of network-type linear equality constraints to obtain a constant sparse approximate Hessian matrix with a decoupling structure and includes a novel finite-iteration successive projection and (truncated) seal algorithm to resolve the difficulty caused by coupling capacity constraints. The DPPQN method also consists of two decomposition effects, the commodity decomposition effect and the are decomposition effect, which resolve the potential numerical difficulties caused by large dimensions. We show the convergence of our method including the convergence of the finite-iteration successive projection and (truncated) seal algorithm. Compared with the Frank-Wolfe with PARTAN algorithm in which a price-directive decomposition method is used to solve linearized multicommodity flow problems, our method is dramatically faster in terms of the CPU time on a Sparc-10 workstation at solving numerous nonlinear multicommodity network flow examples. (C) 1997 John Wiley & Sons, Inc.
引用
收藏
页码:225 / 244
页数:20
相关论文
共 50 条
  • [1] A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
    Ouorou, A
    Mahey, P
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 121 (03) : 532 - 548
  • [2] An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
    Kiwiel, K. C.
    [J]. MATHEMATICAL PROGRAMMING, 2011, 130 (01) : 59 - 84
  • [3] An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
    K. C. Kiwiel
    [J]. Mathematical Programming, 2011, 130 : 59 - 84
  • [4] Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
    J. -L. Goffin
    J. Gondzio
    R. Sarkissian
    J. -P. Vial
    [J]. Mathematical Programming, 1997, 76 : 131 - 154
  • [5] NETWORK TOPOLOGY AND INTEGRAL MULTICOMMODITY FLOW PROBLEMS
    EVANS, JR
    JARVIS, JJ
    [J]. NETWORKS, 1978, 8 (02) : 107 - 119
  • [6] Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
    Goffin, JL
    Gondzio, J
    Sarkissian, R
    Vial, JP
    [J]. MATHEMATICAL PROGRAMMING, 1997, 76 (01) : 131 - 154
  • [7] Efficient minimization over products of simplices and its application to nonlinear multicommodity network problems
    Athanasia Karakitsiou
    Athanasia Mavrommati
    Athanasios Migdalas
    [J]. Operational Research, 2004, 4 (2) : 99 - 118
  • [8] A linear model for compound multicommodity network flow problems
    Machado, Catia M. S.
    Mayerle, Sergio F.
    Trevisan, Vilmar
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (06) : 1075 - 1086
  • [9] Monotonicity and conformality in multicommodity network-flow problems
    Ciurria-Infosino, Iara
    Granot, Daniel
    Granot, Frieda
    [J]. NETWORKS, 2019, 74 (03) : 302 - 319
  • [10] Implementing a proximal algorithm for some nonlinear multicommodity flow problems
    Ouorou, Adam
    [J]. NETWORKS, 2007, 49 (01) : 18 - 27