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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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).
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.
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.
Glover, F., Laguna, M., Tabu Search, Kluwer Academic Publishers, Boston MA, (1997).
Palmer, C.C., An Approach to a Problem in Network Design Using Genetic Algorithms. Networks, 26 (1995) 361–370.
Randall, M., McMahon, G. and Sugden, S., A Simulated Annealing Approach to Communication Network Design, TR99-04, School of Information Technology, Bond University, (1999).
Ahuja, R., Magnanti, T.; Orlin, J.: Network Flows: Theory, Algorithms and Applications, Prentice Hall, New Jersey (1993).
Minoux, M.: Network Synthesis and Optimal Design Problems: Models, Solution Methods and Applications, Networks, 19, (1989) 337–341.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Han, J., McMahon, G., Sugden, S. (2002). A Branch and Bound Algorithm for Minimum Cost Network Flow Problem. In: Yin, H., Allinson, N., Freeman, R., Keane, J., Hubbard, S. (eds) Intelligent Data Engineering and Automated Learning — IDEAL 2002. IDEAL 2002. Lecture Notes in Computer Science, vol 2412. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45675-9_28
Download citation
DOI: https://doi.org/10.1007/3-540-45675-9_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44025-3
Online ISBN: 978-3-540-45675-9
eBook Packages: Springer Book Archive