Skip to main content

Advertisement

SpringerLink
Log in

A Multi-Product Production/Distribution System Design Problem with Direct Shipments and Lateral Transshipments

  • Published:
Networks and Spatial Economics Aims and scope Submit manuscript

Abstract

In this paper, we investigate a multi-product, three-stage production/distribution system design problem (PDSD) with direct shipment and lateral transshipment capabilities. Our overall goal is to find the most efficient network design to minimize the total fixed facility and transportation costs. Specifically, we locate p capacitated distribution centers in the second stage from a set of candidate locations. At the same time, our design allows for direct shipments between first (suppliers) and third stages (customers) and lateral transshipments among the distribution centers in the second stage. The PDSD problem is known to be NP-hard, and prior studies have explored several heuristic methods including scatter search, tabu search, and genetic algorithms to solve the problem. In this paper, we propose two solution algorithms based on simulated annealing and GRASP heuristics. We apply both long-term and short-term memory lists to maintain an efficient local search, combined with a custom greedy solver that can effectively evaluate the quality of a solution candidate. We conduct a series of computational experiments to validate the proposed algorithms. Compared with the optimal solution, the simulated annealing algorithm presents an average optimality gap of 0.07% and an average time of 25.56% of optimal solution time, while the GRASP algorithm achieves a solution gap of 0.11% with 17.85% of optimal running time. The experimental results also show that the simulated annealing and GRASP algorithms outperform the best-reported heuristic in the literature based on scatter search regarding both solution quality and duration, especially for large-scale problem instances with tighter capacities.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  • Ahmadi S, Osman IH (2005) Greedy random adaptive memory programming search for the capacitated clustering problem. Eur J Oper Res 162(1):30–44. Logistics: from theory to application

    Article  Google Scholar 

  • Arostegui MA, Kadipasaoglu SN, Khumawala BM (2006) An empirical comparison of Tabu search, simulated annealing, and genetic algorithms for facilities location problems. Int J Prod Econ 103(2):742–754

    Article  Google Scholar 

  • Brimberg J, Drezner Z (2013) A new heuristic for solving the p-median problem in the plane. Comput Oper Res 40:427–437

    Article  Google Scholar 

  • Camacho-Vallejo J-F, Munoz-Sancheza R, Gonzalez-Velarde JL (2015) A heuristic algorithm for a supply chain’s production-distribution planning. Comput Oper Res 61(9):110–121

    Article  Google Scholar 

  • Chen L, Monteiro T, Wang T, Marcon E (2018) Design of shared unit-dose drug distribution network using multi-level particle swarm optimization. Health Care Management Science Appeared Online, 1–14

  • Chiyoshi F, Galvao RD (2000) A statistical analysis of simulated annealing applied to the p-median problem. Ann Oper Res 96:61–74

    Article  Google Scholar 

  • Contreras IA, Diaz JA (2008) Scatter search for the single source capacitated facility location problem. Ann Oper Res 157:73–89

    Article  Google Scholar 

  • Diaz JA, Fernandez E (2006) Hybrid scatter search and path relinking for the capacitated p-median problem. Eur J Oper Res 169:570–585

    Article  Google Scholar 

  • Fahimnia B, Luong L, Marian R (2012) Genetic algorithm optimisation of an integrated aggregate production distribution plan in supply chains. Int J Prod Res 50(1):81–96

    Article  Google Scholar 

  • Feo TA, Resende MGC (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8(2):67–71

    Article  Google Scholar 

  • Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Global Optim 6(2):109–133

    Article  Google Scholar 

  • Festa P, Resende MGC (2009) An annotated bibliography of grasp-part ii : applications. Int Trans Oper Res 16:131–172

    Article  Google Scholar 

  • Firouz M, Keskin BB, Melouk SH (2017) An integrated supplier selection and inventory problem with multi-sourcing and lateral transshipments. Omega 70:77–93

    Article  Google Scholar 

  • Goetschalckx M, Vidal CJ, Dogan K (2002) Modeling and design of global logistic systems: a review of integrated strategic and tactical models and design algorithms. Eur J Oper Res 143:1–18

    Article  Google Scholar 

  • Jawahar N, Balaji A (2009) A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge. Eur J Oper Res 194:496–537

    Article  Google Scholar 

  • Jin M, Eksioglu SD, Eksioglu B, Wang H (2010) Mode selection for automotive distribution with quantity discounts. Netw Spatial Econ 10(1):1–13

    Article  Google Scholar 

  • Kariv O, Hakimi L (1979) An algorithmic approach to network location problems. II: the p-medians. SIAM J Appl Math 37(3):539–560

    Article  Google Scholar 

  • Keskin BB, Üster H (2007a) Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem. Eur J Oper Res 182(2):663–682

    Article  Google Scholar 

  • Keskin BB, Üster H (2007b) A scatter search-based heuristic to locate capacitated transshipment points. Comput Oper Res 34(10):3112–3125

    Article  Google Scholar 

  • Melo MT, Nickel S, Saldanha da Gama F (2009) Facility location and supply chain management-a review. Eur J Oper Res 196(2):401–412

    Article  Google Scholar 

  • Miralinaghi M, Keskin BB, Lou Y, Roshandeh AM (2017) Capacitated refueling station location problem with traffic deviations over multiple time periods. Netw Spatial Econ 17(1):129–151

    Article  Google Scholar 

  • Miranda PA, Garrido RA (2006) A simultaneous inventory control and facility location model with stochastic capacity constraints. Netw Spatial Econ 6(1):39–53

    Article  Google Scholar 

  • Mladenovic N, Brimberg J, Hansen P, Moreno-Perez JA (2007) The p-median problem: a survey of metaheuristic approachest. Eur J Oper Res 179:927–939

    Article  Google Scholar 

  • Olhager J, Pashaei S, Sternberg H (2015) Design of global production and distribution networks: a literature review and research agenda. Int J Phys Distrib Logist Manag 45(1–2):138–158

    Article  Google Scholar 

  • Paterson C, Kiesmüller G, Teunter R, Glazebrook K (2011) Inventory models with lateral transshipments: a review. Eur J Oper Res 210(2):125–136

    Article  Google Scholar 

  • Pedrola O, Ruiz M, Velasco L, Careglio D, Gonzalez de Dios O, Comellas J (2013) A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem. Comput Oper Res 40:3174–3187

    Article  Google Scholar 

  • Pessoa LS, Resende MGC, Ribeiro CC (2013) A hybrid lagrangean heuristic with grasp and path-relinking for set k-covering. Comput Oper Res 40:3132–3146

    Article  Google Scholar 

  • Resende MGC, Werneck RF (2004) A hybrid heuristic for the p-median problem. Ann Oper Res 10(1):59–88

    Google Scholar 

  • Saez-Aguado J, Trandafir PC (2012) Some heuristic methods for solving p-median problems with a coverage constraint. Eur J Oper Res 220:320–327

    Article  Google Scholar 

  • Sahin G, Süral H (2007) A review of hierarchical facility location models. Comput Oper Res 34(8):2310–2331

    Article  Google Scholar 

  • Tragantalerngsak S, Rönnqvist JHM (1997) Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem. Eur J Oper Res 102 (3):611–625

    Article  Google Scholar 

  • Tragantalerngsak S, Holt J, Rönnqvist M (2000) An exact method for the two-echelon, single-source, capacitated facility location problem. Eur J Oper Res 123(3):473–489

    Article  Google Scholar 

  • Tsao Y-C, Linh VT (2016) Supply chain network designs developed for deteriorating items under conditions of trade credit and partial backordering. Netw Spatial Econ 16(3):933–956

    Article  Google Scholar 

Download references

Acknowledgements

We would like to thank the area editor and the two anonymous reviewers for their constructive feedback on the earlier versions of this manuscript.

Author information

Authors and Affiliations

  1. Black School of Business, Department of Project and Supply Chain Management, Penn State Behrend, Erie, PA, 16563, USA

    Jianing Zhi

  2. Culverhouse College of Commerce, Information Systems, Statistics, and Management Science, The University of Alabama, Box 870226, Tuscaloosa, AL, 35487, USA

    Burcu B. Keskin

Authors
  1. Jianing Zhi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Burcu B. Keskin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jianing Zhi.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendix

Appendix

Table 11 Shipping assignments for PS 1 - PS6
Full size table
Table 12 Shipping assignments for PS 7 - PS 12
Full size table
Table 13 Shipping assignments for PS 13 - PS 18
Full size table
Table 14 Shipping assignments for PS 19 - PS 24
Full size table

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhi, J., Keskin, B.B. A Multi-Product Production/Distribution System Design Problem with Direct Shipments and Lateral Transshipments. Netw Spat Econ 18, 937–972 (2018). https://doi.org/10.1007/s11067-018-9436-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11067-018-9436-8

Keywords

Search

Navigation