A parallel algorithm for generalized networks

This paper presents an application of parallel computing techniques to the solution of an important class of planning problems known as generalized networks. Three parallel primal simplex variants for solving generalized network problems are presented. Data structures used in a sequential generalized network code are briefly discussed and their extension to a parallel implementation of one of the primal simplex variants is given. Computational testing of the sequential and parallel codes, both written in Fortran, was done on the CRYSTAL multicomputer at the University of Wisconsin, and the computational results are presented. Maximum efficiency occurred for multiperiod generalized network problems where a speedup approximately linear in the number of processors was achieved.

[1]  R. V. Helgason,et al.  Algorithms for network programming , 1980 .

[2]  F. Gustavson,et al.  Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine , 1984 .

[3]  David J. DeWitt,et al.  The Crystal Multicomputer: Design and Implementation Experience , 1987, IEEE Transactions on Software Engineering.

[4]  M. Engquist,et al.  New labeling procedures for the basis graph in generalized networks , 1985 .

[5]  A. Charnes,et al.  Management Models and Industrial Applications of Linear Programming , 1961 .

[6]  Jay E. Aronson,et al.  A survey of dynamic network flows , 1989 .

[7]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[8]  Gerald G. Brown,et al.  Solving Generalized Networks , 1984 .

[9]  Michael J. Quinn,et al.  Parallel graph algorithms , 1984, CSUR.

[10]  Darwin Klingman,et al.  A Computational Study of the Effects of Problem Dimensions on Solution Times for Transportation Problems , 1975, JACM.

[11]  Jacob Intrator,et al.  Auxiliary procedures for solving long transportation problems , 1980 .

[12]  F. Glover,et al.  A Note on Computational Simplifications in Solving Generalized Transportation Problems , 1973 .

[13]  Edsger Wybe Dijkstra,et al.  Cooperating Sequential Processes, Technical Report EWD-123 , 1965 .

[14]  John M. Mulvey,et al.  Pivot Strategies for Primal-Simplex Network Codes , 1978, JACM.

[15]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[16]  E. Balas,et al.  On the Generalized Transportation Problem , 1964 .

[17]  Fred Glover,et al.  Generalized Networks: A Fundamental Computer-Based Planning Tool , 1978 .

[18]  Fred Glover,et al.  Letter to the Editor—Extensions of the Augmented Predecessor Index Method to Generalized Network Problems , 1973 .

[19]  Robert Fourer,et al.  Solving staircase linear programs by the simplex method, 1: Inversion , 1982, Math. Program..

[20]  Michael A. Saunders,et al.  Large-scale linearly constrained optimization , 1978, Math. Program..

[21]  Darwin Klingman,et al.  Enhancements of Spanning Tree Labeling Procedures for Network Optimization. , 1979 .

[22]  Fred W. Glover,et al.  A Strongly Convergent Primal Simplex Algorithm for Generalized Networks , 1979, Math. Oper. Res..

[23]  Robert Fourer,et al.  Solving staircase linear programs by the simplex method, 2: Pricing , 1983, Math. Program..

[24]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[25]  S. Sethi,et al.  The Dynamic Transportation Problem: A Survey , 1980 .

[26]  Gerald L. Thompson,et al.  Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm , 1973, JACM.