Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements | Optimization Letters
Skip to main content
Springer Nature Link
Log in

Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

Network design problems arise in a wide range of applied areas including telecommunications, computer networks, and transportation. In this paper, we address the following discrete capacitated multi-terminal network design problem. Given a connected digraph G = (V,A), a set of L potential facilities to be installed on each arc, and a set of K multi-terminal (non-simultaneous) commodity flow requirements, the problem is to find a set of facilities to install in order to route the K nonsimultaneous flows while minimizing the total fixed plus variable costs. We describe an exact procedure for solving this problem based on Benders decomposition. Our algorithm includes several features that significantly improve the efficiency of the basic approach. Computational results attest to the efficacy of the proposed algorithm, which can solve medium- to large-scale problems to optimality.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ahuja R.K., Magnanti T.L., Orlin J.B. (1993) Network Flows: Theory, Algorithms and Applications. Prentice Hall, Upper River

    Google Scholar 

  2. Balakrishnan A., Magnanti T.L., Mirchandani P. (1997) Network design. In: Dell’Amico M., Maffioli F., Martello S. (eds) Annotated Bibilographies in Combinatorial Optimization. Wiley, New York, pp. 311–334

    Google Scholar 

  3. Benders J.F. (1962) Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4, 238–252

    Article  MATH  MathSciNet  Google Scholar 

  4. Costa A.M. (2005) A survey on benders decomposition applied to fixed-charge network design problems. Comput. Oper. Res. 32, 1492–1450

    Article  Google Scholar 

  5. Eksioglu B., Eksioglu S.D., Pardalos P.M. (2001) Solving large scale fixed charge network flow problem. In: Mangeri A., Giannesi F., Pardalos P.M., (eds) Equilibrium Problems and Variational Models. Kluwer, Dordrecht

    Google Scholar 

  6. Geoffrion A.M., Graves G.W. (1974) Multicommodity distribution system design by Benders decomposition. Manage. Sci. 20, 822–844

    MathSciNet  MATH  Google Scholar 

  7. Gomory R.E., Hu T.C. (1962) An application of generalized linear programming to network flows. SIAM J. Appl. Math. 10, 260–283

    Article  MATH  MathSciNet  Google Scholar 

  8. Hirsh W.M., Dantzig G.B. (1968) The fixed charge problem. Naval Res. Logistics Q. 15, 413–424

    Google Scholar 

  9. Khang D.B., Fujiwara O. (1991) Approximate solutions of capacitated fixed-charge minimum cost network flow problems. Networks 21, 689–704

    Article  MATH  MathSciNet  Google Scholar 

  10. Kim D., Pardalos P.M. (1999) A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24, 195–203

    Article  MATH  MathSciNet  Google Scholar 

  11. Kim H.J., Hooker J.N. (2002) Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach. Ann. Oper. Res. 115, 95–124

    Article  MATH  MathSciNet  Google Scholar 

  12. Lamar B.W., Wallace C.A. (1997) Revised-modified penalties for fixed charge transportation problems. Manage. Sci. 43, 1431–1436

    Google Scholar 

  13. Magnanti T.L., Wong R.T. (1984) Network design and transportation planning: models and algorithms. Transportation Sci. 18, 1–55

    Google Scholar 

  14. Minoux M. (1981) Optimum synthesis of a network with non-simultaneous multicommodity flow requirements. Ann. Discrete Math. 11, 269–277

    MATH  MathSciNet  Google Scholar 

  15. Minoux M. (1989) Network synthesis and optimum network design problems: models, solution methods and applications. Networks 19, 313–360

    Article  MATH  MathSciNet  Google Scholar 

  16. Minoux M. (2001) Discrete cost multicommodity network optimization problems and exact solution methods. Ann. Oper. Res. 106, 19–46

    Article  MATH  MathSciNet  Google Scholar 

  17. Murty K.G. (1968) Solving the fixed charge problem by ranking the extreme points. Oper. Res. 16, 268–279

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Combinatorial Optimization Research Group – ROI, Ecole Polytechnique de Tunisie, BP 743, 2078, La Marsa, Tunisia

    Mohamed Haouari & Mehdi Mrad

  2. Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA, 24061, USA

    Hanif D. Sherali

Authors
  1. Mohamed Haouari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mehdi Mrad
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hanif D. Sherali
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohamed Haouari.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Haouari, M., Mrad, M. & Sherali, H.D. Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements. Optimization Letters 1, 341–354 (2007). https://doi.org/10.1007/s11590-006-0030-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-006-0030-5

Keywords

Search

Navigation