Abstract
The adaptation of the primal simplex method for solving minimum linear cost network flow problems is well known. We present a new data structure for storing the tree associated with a basis and introduce a new adaptive heuristic method for the pivot choice. The pivot choice is modified dynamically during the application of the algorithm. The code which is based on this data structure and adaptive pivot choice has been tested on a variety of test problems. This empirical study shows that this code is among the most efficient implementations of the network simplex method. The large number of diverse problems used in this empirical study permit us to draw conclusions on the efficiency of the code on problems of varying difficulty.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahuja R.K., Magnanti T.L. and Orlin J.B.: in Handbooks in Operations Research and Management Science, Optimization Nemhauser et al. (ed.), North-Holland,(1989)
Ahuja R.K., Magnanti T.L. and Orlin J.B.: Network Flows. Prentice Hall, New Jersey (1993)
Ahuja R.K. and Orlin J.B.: The Scaling Network Simplex Algorithm. Operations Research 40 Supp. No. 1 (1992) S5–S13
Barr R.S., Glover F. and Klingman D.: Enhancements of Spanning Tree Labelling Procedures for Network Optimization. INFOR, 17 (1979) 16–34
Bazaraa M., Jarvis J.J. and Sherali: Linear Programming and Network Flows. John Wiley & Sons, New-York (1990)
Bertsekas D.P.: A Unified Framework for Primal-dual Methods in Minimum Cost Network Flow Problems. Mathematical Programming 32 (1985) 125–145
Bertsekas D.P.: Linear Network Optimization: Algorithms and Codes. MIT Press, Cambridge (1991)
Bertsekas D.P. and Tseng P.: Relaxation Methods for Minimum Cost Network Flow Problems. Technical Report LIDS-P-1245-A, M.I.T., Cambridge (1983)
Bertsekas D.P. and Tseng P.: The Relax Codes for Linear Minimum Cost Network Flow Problems, in Fortran Codes for Network Optimization, Simeone B. et al.(ed.), Annals of Operations Research 13 (1988) 125–190
Bland R.G., Cheriyan J., Jensen D.L and Ladányi L.: An Empirical Study of Min Cost Flow Algorithms. DIMACS International Algorithm Implementation Challenge (1993)
Bland R.G. and Jensen D.L.: On the Computational Behaviour of a Polynomial-Time Network Flow Algorithm. Mathematical Programming 54 (1992) 1–39
Bradley G.H., Brown G.G. and Graves G.W.: Design and Implementation of Large Scale Primal Transhipment Algorithms. Management Science 24 (1977) 1–34
Chabini I.: Nouvelles methodes séquentielles et parallèles pour Poptimisation deréseaux à coŭts linéaires et convexes. Publication No. 986, Centre de Recherchessur les Transports, Université de Montréal (1994)
Chvatal V.: Linear Programming. W.H. Freeman, New York (1983)
Cunningham W.H.: A Network Simplex Method. Mathematical Programming 11 (1976) 105–116
Cunningham W.H.: Theoretical Properties of the Network Simplex Method. Mathematics of Operations Research 4 (1979) 196–208
Dantzig G.B.: Application of the Simplex Method to a Transportation Problem. in Activity Analysis of Production and Allocation, Koopmans T.C. (ed.), John Wiley & Sons, New-York (1951) 359–373
Dantzig G.B.: Linear Programming and Extensions. Princeton University Press, Princeton, New-Jersey (1963)
Dennis J.B.: A High-speed Computer Technique for the Transportation Problem. Journal of the Association for Computing Machinery 5 (1958) 132–153
Flood M.M.: A Transportation Algorithm and Code. Naval Research Logistics Quarterly 8 (1961) 257–276
Ford L.R. and Fulkerson D.R.: Solving the Transportation Problem. Management Science 3 (1956) 24–32
Ford L.R. and Fulkerson D.R.: Flows in Networks. Princeton University Press, Princeton, New-Jersey (1962)
Glover F., Karney D. and Klingman D.: The Augmented Predecessor Index Method for Locating Stepping Stone Paths and Assigning Dual Prices in Distribution Problems: Transportation Science 6 (1972) 171–180
Glover F., Karney D. and Klingman D.: Implementation and Computational Comparisons of Primal, Dual and Primal-Dual Computer Codes for Minimum Cost NetworkFlow Problems. Networks 4 (1974) 191–212
Glover F., Karney D., Klingman D. and Napier A.: A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems. Management Science 20 (1974) 793–813
Glover F. and Klingman D.: Locating Stepping-stone Paths in Distribution Problems via the Predecessor Index Method. Transportation Science 4 (1970) 220–226
Glover F., Klingman D. and Stutz J.: Augmented Threaded Index Method for Network Optimization. INFOR 12 (1974) 293–298
Goldberg A.V.: The Grid-On-TOrus (GOTO) Generator. First DIM ACS International Algorithm Implementation Challenge (1991)
Goldberg A.V.: An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm. Technical Report, Computer Science Department, Stanford University, Stanford, CA (1992)
Grigoriadis M.D.: An Efficient Implementation of the Network Simplex Method. Mathematical Programming Studies 26 (1986) 83–111
Grigoriadis M.D. and Hsu T.: The Rutgers Minimum Cost Network Flow Subroutines. SIGMAP Bulletin of the Association for Computing Machinery 26 (1979) 17–18
Johnson E.L.: Networks and Basic Solutions. Operations Research 14 (1966) 619–624
Kennington J.L. and Helgason R.V.: Algorithms for Network Programming. John Wiley & Sons, New-York (1980)
Klingman D. and Mote J.: Computational Analysis of Large-Scale Pure Networks. presented at the Joint National Meeting of ORSA/TIMS, New Orleans (1987)
Klingman D., Napier A. and Stutz J.: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems. Management Science 20 (1974) 814–821
Knuth D.E.: Sorting and Searching. Addison Wesley (1973)
Koopmans T.C: Optimum Utilization of the Transportation System. Proceedings ofthe International Statistical Conference. Washington DC (1947), also appeared in Econometrica 17 (1949)
Kuhn H.W.: The Hungarian Method for the Assignment Problem. Naval Research Logistics Quarterly 2 (1955) 83–97
Lebeuf D.: Contributions au simplexe primal adapté au réseau et implantations séquentielle et parallèle efficaces. Publication CRT-96-02, Centre de Recherches sur les Transports, Université de Montréal (1996)
Lee Y. and Orlin J.B.: Computational Testing of a Network Simplex Algorithm. First DIM ACS International Algorithm Implementation Challenge (1991)
Mulvey J.: Pivot Strategies for Primal-Simplex Network Codes. Journal of the Association for Computing Machinery 25 (1978a) 266–270
Mulvey J.: Testing a Large-scale Network Optimization Program. Mathematical Programming 15 (1978b) 291–314
Orden A.: The Transshipment Problem. Management Science 2 (1956) 276–285
Srinivasan V. and Thompson G.L.: Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems. Journal of the Association for Computing Machinery 19 (1972) 712–726
Srinivasan V. and Thompson G.L.: Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm. Journal of the Association for Computing Machinery 20 (1973) 194–213
Tomizawa N.: On Some Techniques Useful for Solution of Transportation Network Problems. Networks 1 (1971) 173–194
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Florian, M., Lebeuf, D. (1997). An Efficient Implementation of the Network Simplex Method. In: Pardalos, P.M., Hearn, D.W., Hager, W.W. (eds) Network Optimization. Lecture Notes in Economics and Mathematical Systems, vol 450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59179-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-59179-2_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62541-4
Online ISBN: 978-3-642-59179-2
eBook Packages: Springer Book Archive