Designing distribution networks: Formulations and solutions heuristic

Transportation Science

Volumn 38, Issue 2, 2004, Pages 174-187

  Lapierre, Sophie D ^a   Ruiz, Angel B ^b   Soriano, Patrick ^c  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c HEC MONTRÉAL   (Canada)

Author keywords

Distribution networks; Hub; Metaheuristics; Search; Tabu search; Variable neighborhood

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COSTS; HEURISTIC METHODS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PIECEWISE LINEAR TECHNIQUES; PROBLEM SOLVING; TRUCK TERMINALS;

METAHEURISTICS; TABU SEARCH; TRANSSHIPMENT CENTERS; VARIABLE NEIGHBORHOOD SEARCH;

FREIGHT TRANSPORTATION;

EID: 3042534588     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.1030.0064     Document Type: Article

References (32)

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