Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems

In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications. Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can be obtained for concave cost network flow problems, particularly for fixed-charge problems.

[1]  Nicos Christofides,et al.  A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations , 1995, Ann. Oper. Res..

[2]  Nicos Christofides,et al.  An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts , 1995 .

[3]  Laurence A. Wolsey,et al.  A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem , 2003, Networks.

[4]  Panos M. Pardalos,et al.  Algorithms for the single-source uncapacitated minimum concave-cost network flow problem , 1991, J. Glob. Optim..

[5]  Nicos Christofides,et al.  Upper bounds for single‐source uncapacitated concave minimum‐cost network flow problems , 2003, Networks.

[6]  Panos M. Pardalos,et al.  A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure , 1999, Oper. Res. Lett..

[7]  John N. Hooker,et al.  Solving Fixed-Charge Network Flow Problems with a Hybrid Optimization and Constraint Programming Approach , 2002, Ann. Oper. Res..

[8]  Arie Segev,et al.  Analysis of a flow problem with fixed charges , 1989, Networks.

[9]  Rainer E. Burkard,et al.  Linear Approximations in a Dynamic Programming Approach for the Uncapacitated Single-Source Minimum Concave Cost Network Flow Problem in Acyclic Networks , 2001, J. Glob. Optim..

[10]  Reiner Horst,et al.  An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks , 1994, Universität Trier, Mathematik/Informatik, Forschungsbericht.

[11]  Nicos Christofides,et al.  A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems , 2006, Eur. J. Oper. Res..

[12]  W. Zangwill Minimum Concave Cost Flows in Certain Networks , 1968 .

[13]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[14]  Panos M. Pardalos,et al.  Global search algorithms for minimum concave-cost network flow problems , 1991, J. Glob. Optim..

[15]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[16]  Nicos Christofides,et al.  Algorithms for large scale set covering problems , 1993, Ann. Oper. Res..

[17]  Giorgio Gallo,et al.  An algorithm for the min concave cost flow problem , 1980 .

[18]  Bruce W. Lamar A Method for Solving Network Flow Problems with General Nonlinear Arc Costs , 1993 .