Abstract
We present a column generation model and solution approach for large integer multicommodity flow problems. We solve the model using branch-and-bound, with bounds provided by linear programs at each node of the branch-and-bound tree. Since the model contains one variable for each origin-destination path, for every commodity, the linear programming relaxation is solved using column generation, i.e., implicit pricing of nonbasic variables to generate new columns or to prove LP optimality. Methods for speeding up the solution of the linear program are presented. Also, we devise new branching rules that allow columns to be generated efficiently at each node of the branch-and-bound tree. Computational results are presented for a set of test problems arising from a transportation application
This reaearch has been supported by the following grants and contracts: NSF DDM-9058074, NSF DMI-9502502
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
R.K. Ahuja, T.L. Magnanti, and J.B. Orlin (1993). Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ
L.H. Appelgren (1969). A column generation algorithm for a ship scheduling problem. Transportation Science 3, 53–68
C. Barnhart, C.A. Hane, E.L. Johnson, and G. Sigismondi (1991). An Alternative Formulation and Solution Strategy for Multi-Commodity Network Flow Problems. Report COC-9102, Georgia Institute of Technology, Atlanta, Georgia
C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, and P.H. Vance (1995). Branch-and-Price: Column Generation for Solving Huge Integer Programs. Report COC-9502, Georgia Institute of Technology, Atlanta, Georgia
CPLEX Optimization, Inc. (1990). Using the CPLEX™ Linear Optimizer
G.B. Dantzig and R.M. Van Slyke (1967). Generalized Upper Bounding Techniques. Journal Computer System Sci. 1, 213–226
G.B. Dantzig and P. Wolfe (1960) Decomposition Principle for Linear Programs. Operations Research 8, 108–111
J. Desrosiers, Y. Dumas, M.M. Solomon, and F. Soumis (1994). Time constrained routing and scheduling. M.E. Ball, T.L Magnanti, C. Monma, and G.L. Nemhauser (eds.). Handbooks in Operations Research and Management Science, Volume on Networks, to appear
IBM Corporation (1990). Optimization Subroutine Library, Guide and Reference
E.L. Johnson (1989). Modeling and Strong Linear Programs for Mixed Integer Programming. S.W. Wallace(ed.) Algorithms and Model Formulations in Mathematical Programming. NATO ASI Series 51, 1–41
G.L. Nemhauser and L.A. Wolsey (1988). Integer and Combinatorial Optimization. Wiley, Chichester
G.L. Nemhauser, M.W.P. Savelsbergh, and G.C. Sigismondi (1994). MINTO, a Mixed INTeger Optimizer. Operations Research Letters 15, 47–58
M. Parker and J. Ryan (1994). A column generation algorithm for bandwidth packing. Telecommunications Systems, to appear
J.B. Rosen (1964) Primal Partition Programming for Block Diagonal Matrices. Numerische Mathematik 6, 250–260
D.M. Ryan and B.A. Foster (1981). An integer programming approach to scheduling. A. Wren (ed.) Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, North-Holland, Amsterdam, 269–280
P.H. Vance, C. Barnhart, E.L. Johnson, G.L. Nemhauser, D. Mahidara, A. Krishna, and R. Rebello (1994). Exceptions in Crew Planning. ORSA/TIMS Detroit, Michigan
F. Vanderbeck and L.A. Wolsey (1994). An Exact Algorithm for IP Column Generation. CORE Discussion Paper, Universite Catholique de Louvain, Belgium
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
Barnhart, C., Hane, C.A., Vance, P.H. (1997). Integer Multicommodity Flow Problems. 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_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-59179-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62541-4
Online ISBN: 978-3-642-59179-2
eBook Packages: Springer Book Archive