Skip to main content

Solving the Two-Stage Supply Chain Network Design Problem with Risk-Pooling and Lead Times by an Efficient Genetic Algorithm

  • Conference paper
  • First Online:
15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020) (SOCO 2020)

Abstract

Supply chain network design (SCND) nowadays represents an important part of Supply Chain Management (SCM) aiming to design a network such that to reduce the cost of the supply chain determined by the location of facilities and the flow of product between the selected facilities. In this paper we investigate a particular SCND, namely the two-stage supply chain network design problem with risk-pooling and lead times. We provide a mathematical model for this problem and as well a solution approach based on genetic algorithms for solving the problem. Computational experiments were performed on a set of instances and the obtained results prove that our proposed genetic algorithm provides good solutions within reasonable running times.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Calvete, H., Gale, C., Iranzo, J.: An improved evolutionary algorithm for the two-stage transportation problem with fixed charge at depots. OR Spectr. 38, 189–206 (2016)

    Article  MathSciNet  Google Scholar 

  2. Calvete, H., Gale, C., Iranzo, J., Toth, P.: A matheuristic for the two-stage fixed-charge transportation problem. Comput. Oper. Res. 95, 113–122 (2018)

    Article  MathSciNet  Google Scholar 

  3. Chen, M.S., Lin, C.T.: Effects of centralization on expected costs in multi-location newsboy problem. J. Oper. Res. Soc. 40(6), 597–602 (1989)

    Article  Google Scholar 

  4. Cosma, O., Pop, P.C., Dănciulescu, D.: A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes. Comput. Oper. Res. 118, 104906 (2020)

    Article  MathSciNet  Google Scholar 

  5. Cosma, O., Dănciulescu, D., Pop, P.C.: On the two-stage transportation problem with fixed charge for opening the distribution centers. IEEE Access 79(1), 113684–113698 (2019)

    Article  Google Scholar 

  6. Cosma, O., Pop, P.C., Pop Sitar, C.: An efficient iterated local search heuristic algorithm for the two-stage fixed-charge transportation problem. Carpathian J. Math. 35(2), 153–164 (2019)

    MathSciNet  MATH  Google Scholar 

  7. Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence. MIT Press, Cambridge (1992)

    Book  Google Scholar 

  8. Park, S., Lee, T.-E., Sung, C.S.: A three level supply chain network design model with risk-pooling and lead times. Transp. Res. Part E 46, 563–581 (2010)

    Article  Google Scholar 

  9. Pop, P.C., Matei, O., Pop Sitar, C., Zelina, I.: A hybrid based genetic algorithm for solving a capacitated fixed-charge transportation problem. Carpathian J. Math. 32(2), 225–232 (2016)

    MathSciNet  MATH  Google Scholar 

  10. Pop, P.C., Sabo, C., Biesinger, B., Hu, B., Raidl, G.: Solving the two-stage fixed-charge transportation problem with a hybrid genetic algorithm. Carpathian J. Math. 33(3), 365–371 (2017)

    MathSciNet  MATH  Google Scholar 

  11. Raj, K.A.A.D., Rajendran, C.: A genetic algorithm for solving the fixed-charge transportation model: two-stage problem. Comput. Oper. Res. 39(9), 2016–2032 (2012)

    Article  Google Scholar 

  12. Yang, B., Geunes, J.: Inventory and lead time planning with lead-time-sensitive demand. IIE Trans. 33(2), 439–452 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Petrica Pop .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Cosma, O., Pop, P., Sabo, C. (2021). Solving the Two-Stage Supply Chain Network Design Problem with Risk-Pooling and Lead Times by an Efficient Genetic Algorithm. In: Herrero, Á., Cambra, C., Urda, D., Sedano, J., Quintián, H., Corchado, E. (eds) 15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020). SOCO 2020. Advances in Intelligent Systems and Computing, vol 1268. Springer, Cham. https://doi.org/10.1007/978-3-030-57802-2_49

Download citation

Publish with us

Policies and ethics