Advertisement

A Branch and Bound Algorithm for Minimum Cost Network Flow Problem

  • Jun Han
  • Graham McMahon
  • Stephen Sugden
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2412)

Abstract

In this paper we introduce a branch and bound algorithm for finding tree solution of minimum cost network flow problem. We consider different situations such as unit and non-unit traffic demand. The methods used to prune the searching tree in different situations are emphasized respectively but the complete searching process is not interpreted in detail due to limited space. Programming test results show the efficiency of these techniques.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Berry, L.T.M.; Murtagh, B.A., McMahon, G.B., Sugden, S.J. and Welling, L.D. An Integrated GA-LP Approach to Communication Network Design. Telecommunication Systems Journal (1999).Google Scholar
  2. 2.
    Berry, L.T.M., Murtagh, B.A.; McMahon, G.B. Sugden, S.J. and Welling, L.D., Genetic Algorithms in the Design of Complex Distribution Networks, International Journal of Physical Distribution and Logistics Management, 28, No. 5, (1998) 377–381.CrossRefGoogle Scholar
  3. 3.
    Berry, L.T.M., Murtagh, B.A., Sugden, S.J. and McMahon, G.B., Application of a Genetic-based Algorithm for Optimal Design of Tree-structured Communication Networks, Proceedings of the Regional Teletraffic Engineering Conference of the International Teletraffic Congress, South Africa, September (1995) 361–370.Google Scholar
  4. 4.
    Glover, F., Laguna, M., Tabu Search, Kluwer Academic Publishers, Boston MA, (1997).zbMATHGoogle Scholar
  5. 5.
    Palmer, C.C., An Approach to a Problem in Network Design Using Genetic Algorithms. Networks, 26 (1995) 361–370.CrossRefGoogle Scholar
  6. 6.
    Randall, M., McMahon, G. and Sugden, S., A Simulated Annealing Approach to Communication Network Design, TR99-04, School of Information Technology, Bond University, (1999).Google Scholar
  7. 7.
    Ahuja, R., Magnanti, T.; Orlin, J.: Network Flows: Theory, Algorithms and Applications, Prentice Hall, New Jersey (1993).Google Scholar
  8. 8.
    Minoux, M.: Network Synthesis and Optimal Design Problems: Models, Solution Methods and Applications, Networks, 19, (1989) 337–341.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Jun Han
    • 1
  • Graham McMahon
    • 1
  • Stephen Sugden
    • 1
  1. 1.School of Information TechnologyBond UniversityAustralia

Personalised recommendations