Designing Distribution Networks: Formulations and Solution Heuristic

References

• Aykin T. Lagrangean relaxation approaches to the capacitated hub and spoke network design problem. Eur. J. Oper. Res. (1994) 79:501–523Crossref, Google Scholar
• Barnhart C., Johnson E. L., Nemhauser G. L., Sigismondi G., Vance P. Formulating a mixed integer programming problem to improve solvability. Oper. Res. (1993) 41:1013–1019Link, Google Scholar
• Barton L. G., Rech P., Beale E. M. L. A non-convex transportation algorithm. Applications of Mathematical Programming Techniques. (1970) (Elsevier, New York) 250–260Google Scholar
• Burns L. D., Hall R. W., Blumfeld D. E., Daganzo C. F. Distribution strategies that minimize transportation and inventory costs. Oper. Res. (1985) 33:469–490Link, Google Scholar
• Camm J. D., Chorman T. E., Dill F. A., Evans J. R., Sweeney D. J., Wegryn G. W. Blending OR/MS, judgment, and GIS: Restructuring P&G's supply chain. Interfaces (1997) 27:128–142Link, Google Scholar
• Campbell J. F. Integer programming formulations of discrete hub locations problems. Eur. J. Oper. Res. (1994) 72:387–405Crossref, Google Scholar
• Fleischmann B. Designing distribution systems with transport economies of scale. Eur. J. Oper. Res. (1993) 70:31–42Crossref, Google Scholar
• Geoffrion A. M., Graves G. W. Multicommodity distribution system design by Benders decomposition. Management Sci. (1974) 20:822–844Link, Google Scholar
• Glover F. Tabu search—Part I. ORSA J. Comput. (1989) 1:190–206Link, Google Scholar
• Glover F. Tabu thresholding: Improved search by nonmonotonic trajectories. ORSA J. Comput. (1995) 7:426–442Link, Google Scholar
• Hall R. W. Dependence between shipment size and mode in freight transportation. Transportation Sci. (1985) 19:436–444Link, Google Scholar
• Hall R. W. Route choice on freight networks with concave cost and exclusive arcs. Transportation Res. (1989) 23B:177–194Crossref, Google Scholar
• Hall R. W. Route selection on freight networks with weight and volume constraints. Transportation Res. (1991) 25B:175–189Crossref, Google Scholar
• Hansen P., Mladenović N. Variable neighborhood search: Principles and applications. Eur. J. Oper. Res. (2001) 130:449–467Crossref, Google Scholar
• Kelly D. L., Khumawala B. M. Capacited warehouse location with concave costs. J. Oper. Res. Soc. (1982) 33:817–826Crossref, Google Scholar
• Klincewicz J. G. Solving a freight transport problem using facility location techniques. Oper. Res. (1990) 38:99–109Link, Google Scholar
• Klincewicz J. G. Heuristics for the p-hub location problem. Eur. J. Oper. Res. (1991) 53:25–37Crossref, Google Scholar
• Klincewicz J. G. Avoiding local optima in the p-hub location problem using tabu search and grasp. Ann. Oper. Res. (1992) 40:283–302Crossref, Google Scholar
• Lamar B. W. An improved branch and bound algorithm for minimum concave cost network flow problems. J. Global Optim. (1993) 3:261–287Crossref, Google Scholar
• Love R. F., Morris J. G., Wesolowsky G. O.Facilities Location: Models and Methods(North-Holland, Amsterdam, The Netherlands)Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (John Wiley, New York) Crossref, Google Scholar
• O'Kelly M. A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. (1987) 32:393–404Crossref, Google Scholar
• O'Kelly M. On the allocation of a subset of nodes to a minihub in a package delivery network. Papers Regional Sci. The J. RSAI (1998) 77:77–99Crossref, Google Scholar
• O'Kelly M. E., Lao Y. Mode choice in a hub-and-spoke network: A zero-one linear programming approach. Geographical Anal. (1991) 23:283–297Crossref, Google Scholar
• Powell W. B., Sheffi Y. Design and implementation of an interactive optimization system for network design in the motor carrier industry. Oper. Res. (1989) 37:12–29Link, Google Scholar
• Sery S., Presti V., Shobrys D. E. Optimisation models for restructuring BASF North America's distribution systems. Interfaces (2001) 31(3):55–65Link, Google Scholar
• Skorin-Kapov D., Skorin-Kapov J. On tabu search for the location of interacting hub facilities. Eur. J. Oper. Res. (1994) 73:502–509Crossref, Google Scholar
• Skorin-Kapov D., Skorin-Kapov J., O'Kelly M. Tight linear programming relaxations of uncapacited p-hub median problems. Eur. J. Oper. Res. (1996) 94:582–593Crossref, Google Scholar
• Soriano P., Gendreau M. Fondements et applications des méthodes de recherche avec tabous. R.A.I.R.O. (1997) 31:133–159Google Scholar
• Vogt L., Even J. Piecewise linear programming solutions of transportation costs as obtained from rate tariffs. Amer. Inst. Indust. Engrg. Trans. (1972) 4:148–153Google Scholar
• Yaged J. B. Minimum cost routing for static network models. Networks (1972) 1:139–172Crossref, Google Scholar
• Zangwill W. I. Minimum concave cost flows in certain networks. Management Sci. (1968) 14:429–450Link, Google Scholar