An Algorithm for the Multiattribute, Multicommodity Flow Problem with Freight Consolidation and Inventory Costs

To remain competitive, manufacturers must seek transportation strategies that both reduce costs and maintain high levels of service. One approach is to consolidate inbound freight at transshipment points. This provides economies of scale and promotes capacity efficient mixes of high and low density items. When service level considerations are included via inventory holding costs, the approach yields a nonlinear network model with multiattribute multicommodity flows. The model is difficult to solve for global optimality in that the objective function is neither convex nor concave; therefore, a composite algorithm is proposed. The algorithm alternates between a linearization technique to find local optima and a heuristic search based on “adjacent concave flows” to provide local improvements. Computational results demonstrate the ability of the multiattribute approach to identify savings in overall transportation and inventory costs when compared to a single attribute approach.

[1]  G. Gallo,et al.  Adjacent extreme flows and application to min concave cost flow problems , 1979, Networks.

[2]  Peter A. Steenbrink,et al.  Transport network optimization in the Dutch integral transportation study , 1974 .

[3]  Teodor Gabriel Crainic,et al.  Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem , 1986 .

[4]  Stephen C. Graves,et al.  A composite algorithm for a concave-cost network flow problem , 1989, Networks.

[5]  Patrick T. Harker,et al.  Predictive intercity freight network models: the state of the art , 1983 .

[6]  D. V. Harper,et al.  JUST-IN-TIME AND INBOUND TRANSPORTATION , 1990 .

[7]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[8]  V. F. Demʹi︠a︡nov,et al.  Approximate methods in optimization problems , 1970 .

[9]  Randolph W. Hall Route selection on freight networks with weight and volume constraints , 1991 .

[10]  Randolph W. Hall,et al.  VEHICLE-MILES FOR A FREIGHT CARRIER WITH TWO CAPACITY CONSTRAINTS , 1985 .

[11]  Warren B. Powell,et al.  OR Practice - Design and Implementation of an Interactive Optimization System for Network Design in the Motor Carrier Industry , 1989, Oper. Res..

[12]  Carlos F. Daganzo,et al.  Shipment composition enhancement at a consolidation center , 1988 .

[13]  Jeffrey L. Funk,et al.  A comparison of inventory cost reduction strategies in a JIT manufacturing system , 1989 .

[14]  Randolph W. Hall,et al.  Distribution Strategies that Minimize Transportation and Inventory Costs , 1985, Oper. Res..

[15]  Michel Minoux,et al.  Networks synthesis and optimum network design problems: Models, solution methods and applications , 1989, Networks.

[16]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[17]  David G. Luenberger,et al.  Linear and nonlinear programming , 1984 .

[18]  Jeff L. Kennington,et al.  A Survey of Linear Cost Multicommodity Network Flows , 1978, Oper. Res..

[19]  Patrick T. Harker,et al.  The state of the art in the predictive analysis of freight transport systems , 1985 .

[20]  R. W. Klessig,et al.  An algorithm for nonlinear multicommodity flow problems , 1974, Networks.