Skip to main content
SpringerLink
Log in

A variable neighborhood search heuristic for the design of multicommodity production–distribution networks with alternative facility configurations

  • Regular Article
  • Published:
OR Spectrum Aims and scope Submit manuscript

Abstract

This paper proposes efficient heuristics to solve large-scale production–distribution network design models. The problem studied is an extension of the two-echelon multicommodity CFLPSS (capacitated facility location problem with single sourcing) considering direct shipments from manufacturing facilities, alternative facility configurations, and concave inventory holding costs. After reviewing the relevant literature, a detailed description of the production–distribution network design problem studied is provided, and the problem is formulated as a mixed-integer program. The heuristic solution approach proposed is then presented. It is a variable neighborhood search (VNS) method integrating a tabu procedure. Experiments are designed to calibrate the heuristics developed, and to compare their performance with the CPLEX solver, for problems with different realistic characteristics. Computational results are presented and discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Ahuja RK, Orlin JB, Pallattino S, Scaparra MP, Scutellà MG (2004) A multi-exchange heuristic for the single-source capacitated facility location problem. Manage Sci 50(6): 749–760

    Article  Google Scholar 

  • Al-Sultan KS, Al-Fawzan MA (1999) A tabu search approach to uncapacitated facility location problem. Ann Oper Res 86: 91–103

    Article  Google Scholar 

  • Ambrosino D, Scutellà MG (2005) Distribution network design: new problems and related models. Eur J Oper Res 165: 610–624

    Article  Google Scholar 

  • Amiri A (2006) Designing a distribution network in a supply chain system: Formulation and efficient solution procedure. Eur J Oper Res 171: 567–576

    Article  Google Scholar 

  • Ballou RH (1992) Business logistics management, 3rd edn. Prentice Hall, New Jersey

    Google Scholar 

  • Balinski M (1961) Fixed-cost transportation problems. Naval Res Logist Q 8: 41–54

    Article  Google Scholar 

  • Barahona F, Chudak FA (2005) Near-optimal solutions to large-scale facility location problems. Discrete Optim 2: 35–50

    Article  Google Scholar 

  • Beasley JE (1993) Lagrangean heuristics for location problems. Eur J Oper Res 65: 383–399

    Article  Google Scholar 

  • Bornstein CT, Campêlo M (2004) An ADD/DROP procedure for the capacitated plant location problem. Pesquisa Operacional 24(1): 151–162

    Article  Google Scholar 

  • Cooke J (2007) Weaving 2 supply chains together. CSCMP’s Supply Chain Q 3: 34–38

    Google Scholar 

  • Crainic TG, Gendreau M, Soriano P, Toulouse M (1993) A tabu search procedure for multicommodity location/allocation with balancing requirements. Ann Oper Res 41: 359–383

    Article  Google Scholar 

  • Delmaire H, Diaz JA, Fernandez E, Ortega M (1999) Reactive GRASP and tabu search based heuristics for the single source capacitated plant location problem. INFOR 37(3): 194–225

    Google Scholar 

  • Elson DG (1972) Site location via mixed-integer programming. Oper Res Q 23(1): 31–43

    Article  Google Scholar 

  • Eppen G, Kipp Martin R, Schrage L (1989) A scenario approach to capacity planning. Oper Res 37: 517–527

    Article  Google Scholar 

  • Fisher ML, Jaikumar R, Van Wassenhove L (1986) A multiplier adjustment method for the generalized assignment problem. Manage Sci 32: 1095–1103

    Article  Google Scholar 

  • Fleischmann B (1993) Designing distribution systems with transport economies of scale. Eur J Oper Res 70: 31–42

    Article  Google Scholar 

  • Gendron B, Potvin JY, Soriano P (2003) A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements. Ann Oper Res 122: 193–217

    Article  Google Scholar 

  • Geoffrion A, Graves G (1974) Multicommodity distribution system design by benders decomposition. Manage Sci 20: 822–844

    Article  Google Scholar 

  • Glover F (1986) Future paths for integer programming and linkage to artificial intelligence. Comput Oper Res 13: 533–549

    Article  Google Scholar 

  • Glover F, Laguna M (1997) Tabu search. Kluwer Academic Publishers, Boston

    Book  Google Scholar 

  • Hansen P (1986) The steepest ascent mildest descent heuristic for combinatorial programming. In: Congress on numerical methods in combinatorial optimization, Capri, Italy

  • Hindi KS, Basta T (1994) Computationally efficient solution of a multiproduct, two-stage distribution-location problem. J Oper Res Soc 45(11): 1316–1323

    Google Scholar 

  • Hindi KS, Basta T, Pienakosz K (1998) Efficient solution of a multi-commodity, two-stage distribution problem with constraints on assignment of customers to distribution centers. Int Trans Oper Res 5(6): 519–527

    Article  Google Scholar 

  • Jacobsen SK (1983) Heuristics for the capacitated plant location model. Eur J Oper Res 12: 253–261

    Article  Google Scholar 

  • Kaufman L, Vanden Eede M, Hansen P (1997) A Plant and Warehouse Location Problem. Oper Res Q 28(3): 547–554

    Article  Google Scholar 

  • Kelly DL, Khumawala BM (1982) Capacitated warehouse location with concave costs. J Oper Res Soc 33: 817–826

    Google Scholar 

  • Klose A (1999) An LP-based heuristic for two-stage capacitated facility location problems. J Oper Res Soc 50(2): 157–166

    Google Scholar 

  • Klose A (2000) A Lagrangean relax-and-cut approach for two-stage capacitated facility location problem. Eur J Oper Res 126: 408–421

    Article  Google Scholar 

  • Klose A, Drexl A (2005) Facility location models for distribution system design. Eur J Oper Res 162: 4–29

    Article  Google Scholar 

  • Kratica J, Tosic D, Filipovic V, Ljubic I (2001) Solving the simple plant location problem by genetic algorithm. RAIRO Oper Res 85: 127–142

    Article  Google Scholar 

  • Kuenh AA, Hamberger MJ (1963) A heuristic program for locating warehouses. Manage Sci 9(4): 643–666

    Article  Google Scholar 

  • Martel A, Vankatadri U (1999) Optimizing supply network structures under economies of scale. In: IEPM Conference Proceedings, Glasgow, Book 1, pp 56–65

  • Martel A (2003) Généralisations du modèle d’optimisation d’un réseau de ravitaillement. Document de formation DF-2.4.2, CIRRELT, Université Laval, Canada

  • Martel A (2005) The design of production–distribution networks: a mathematical programming approach. In: Geunes J, Pardalos PM (eds) Supply chain optimization. Springer, Berlin, pp 265–306

  • Michel L, Van Hentenryck P (2004) A simple tabu search for warehouse location. Eur J Oper Res 157: 576–591

    Article  Google Scholar 

  • Mladenovic N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24: 1097–1100

    Article  Google Scholar 

  • Paquet M, Martel A, Desaulniers G (2004) Including technology selection decisions in manufacturing network design models. Int J Comput Integr Manuf 17: 117–125

    Article  Google Scholar 

  • Pirkul H, Jayaraman V (1996) Production, transportation, and distribution planning in a multi-commodity tri-echelon system. Transp Sci 30(4): 291–302

    Article  Google Scholar 

  • Pirkul H, Jayaraman V (1998) Multi-commodity, multi-plant, capacitated facility location problem: formulation and efficient heuristic solution. Comput Oper Res 25(10): 869–878

    Article  Google Scholar 

  • ReVelle C, Eiselt H, Daskin M (2008) A bibliography for some fundamental problem categories in discrete location science. Eur J Oper Res 184: 817–848

    Article  Google Scholar 

  • Soland RM (1974) Optimal plant location with concave costs. Oper Res 22: 373–382

    Article  Google Scholar 

  • Sörensen K (2002) A framework for robust and flexible optimisation using metaheuristics with applications in supply chain design. Ph.D. Thesis, Faculteit Toegepaste Economische Wentenschappen, Universiteit Antwerpen, Belgium

  • Verter V, Dincer C (1995) Facility location and capacity acquisition: an integrated approach. Nav Res Logistics 42: 1141–1160

    Article  Google Scholar 

  • Zhang J, Chen B, Ye Y (2005) A multi-exchange local search algorithm for the capacitated facility location problem. Math Oper Res 30(2): 389–403

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CIRRELT and Faculté des sciences de l’administration, Université Laval, Ste-Foy, QC, G1V 0A6, Canada

    Houssam Amrani & Alain Martel

  2. HEC, Faculty of Economics and Social Sciences, University of Geneva, Boulevard du Pont-d’Arve 40, 1211, Geneva 4, Switzerland

    Nicolas Zufferey

  3. School of Computer and Communication Sciences, Swiss Federal Institute of Technology, 1015, Lausanne, Switzerland

    Polina Makeeva

Authors
  1. Houssam Amrani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alain Martel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nicolas Zufferey
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Polina Makeeva
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alain Martel.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Amrani, H., Martel, A., Zufferey, N. et al. A variable neighborhood search heuristic for the design of multicommodity production–distribution networks with alternative facility configurations. OR Spectrum 33, 989–1007 (2011). https://doi.org/10.1007/s00291-009-0182-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-009-0182-7

Keywords

Search

Navigation