A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations

We develop a model for a strategic freight-forwarding network design problem in which the design decisions involve the locations and capacities of consolidation and deconsolidation centers, and capacities on linehaul linkages as well as the shipment routes from origins to destinations through centers. We devise a solution approach based on Benders decomposition and conduct a computational study that illustrates the efficiency and the effectiveness of the approach.

[1]  Munirpallam A. Venkataramanan,et al.  Solution approaches to hub location problems , 1998, Ann. Oper. Res..

[2]  Johan Hellstrand,et al.  Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound , 1998, Oper. Res..

[3]  James F. Campbell,et al.  Integer programming formulations of discrete hub location problems , 1994 .

[4]  Alper Atamtürk,et al.  On capacitated network design cut–set polyhedra , 2002, Math. Program..

[5]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[6]  Thomas L. Magnanti,et al.  The convex hull of two core capacitated network design problems , 1993, Math. Program..

[7]  Marcus Randall,et al.  Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation , 2008, Comput. Optim. Appl..

[8]  Thomas L. Magnanti,et al.  Tailoring Benders decomposition for uncapacitated network design , 1986 .

[9]  Thomas L. Magnanti,et al.  Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria , 1981, Oper. Res..

[10]  Ana Muriel,et al.  Capacitated multicommodity network flow problems with piecewise linear concave costs , 2004 .

[11]  Donald J. Bowersox,et al.  Supply Chain Logistics Management , 2002 .

[12]  Andreas T. Ernst,et al.  Hub location problems , 2002 .

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

[14]  Andreas T. Ernst,et al.  The capacitated multiple allocation hub location problem: Formulations and algorithms , 2000, Eur. J. Oper. Res..

[15]  Claudio B. Cunha,et al.  A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil , 2007, Eur. J. Oper. Res..

[16]  Sue Abdinnour-Helm,et al.  A hybrid heuristic for the uncapacitated hub location problem , 1998, Eur. J. Oper. Res..

[17]  Zvi Drezner,et al.  Facility location - applications and theory , 2001 .

[18]  Tony J. Van Roy,et al.  A Cross Decomposition Algorithm for Capacitated Facility Location , 1986, Oper. Res..

[19]  Jeng-Fung Chen,et al.  A hybrid heuristic for the uncapacitated single allocation hub location problem , 2007 .

[20]  H. Pirkul,et al.  New formulation and relaxation to solve a concave-cost network flow problem , 1997 .

[21]  Paul Wentges,et al.  Accelerating Benders' decomposition for the capacitated facility location problem , 1996, Math. Methods Oper. Res..

[22]  Thomas L. Magnanti,et al.  Modeling and Solving the Two-Facility Capacitated Network Loading Problem , 1995, Oper. Res..

[23]  Alfredo Marín,et al.  Formulating and solving splittable capacitated multiple allocation hub location problems , 2005, Comput. Oper. Res..