Skip to main content
Log in

Solving the robust two-stage capacitated facility location problem with uncertain transportation costs

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In this study, we start from a multi-source variant of the two-stage capacitated facility location problem (TSCFLP) and propose a robust optimization model of the problem that involves the uncertainty of transportation costs. Since large dimensions of the robust TSCFLP could not be solved to optimality, we design a memetic algorithm (MA), which represents a combination of an evolutionary algorithm (EA) and a modified simulated annealing heuristic (SA) that uses a short-term memory of undesirable moves from previous iterations. A set of computational experiments is conducted to examine the impact of different protection levels on the deviation of the objective function value. We also investigate the impact of variations of transportation costs that may occur on both transhipment stages on the total cost for a fixed protection level. The obtained results may help in identifying a sustainable and efficient strategy for designing a two stage capacitated transportation network with uncertain transportation costs, and may be applicable in the design and management of similar transportation networks.

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

Access this article

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

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Baron, O., Milner, J., Naseraldin, H.: Facility location: a robust optimization approach. Prod. Oper. Manag. 20(5), 772–785 (2011)

    Article  Google Scholar 

  2. Beasley, J.E.: Obtaining test problems via internet. J. Glob. Optim. 8, 429–433 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Program. 98, 49–71 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  4. Filipović, V.: Fine-grained tournament selection operator in genetic algorithms. Comput. Inform. 22, 143–161 (2003)

    MathSciNet  MATH  Google Scholar 

  5. Gabrel, V., Murat, C., Thiele, A.: Recent advances in robust optimization: an overview. Eur. J. Oper. Res. 235(3), 471–483 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  6. Gülpinar, N., Pachamanova, D., Çanakoǧlu, E.: Robust strategies for facility location under uncertainty. Eur. J. Oper. Res. 225, 21–35 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  7. Handy, J.: The Cache Memory Book. Academic Press, San Diego (1998)

    MATH  Google Scholar 

  8. Henderson, D., Sheldon, H., Jacobson, H., Johnson, A.W.: The theory and practice of simulated annealing. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, pp. 287–321. Kluwer Academic Publishers, New York (2003)

    Chapter  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  11. Klose, A.: A Lagrangian relax-and-cut approach for two-stage capacitated facility location problems. Eur. J. Oper. Res. 2126, 408–421 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  12. Krarup, J., Pruzan, P.M.: The simple plant location problem: survey and synthesis. Eur. J. Oper. Res. 12, 36–81 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  13. Li, J., Chu, F., Prins, C., Zhu, Z.: Lower and upper bounds for a two-stage capacitated facility location problem with handling costs. Eur. J. Oper. Res. 236(3), 957–967 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  14. Marín, A., Pelegrin, B.: Applying Lagrangian relaxation to the resolution of two-stage location problems. Ann. Oper. Res. 86, 179–198 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  15. Mišković, S., Stanimirović, Z.: A memetic algorithm for solving two variants of the two-stage uncapacitated facility location problem. Info. Technol. Control 42(2), 131–149 (2013)

    Google Scholar 

  16. Neri, F., Cotta, C., Moscato, P.: Handbook of Memetic Algorithms. Studies in Computational Intelligence, vol. 379. Springer, Berlin (2012)

    Book  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This research was partially supported by Serbian Ministry of Education, Science and Technological Development under the Grants Nos. 174010 and 044006.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zorica Stanimirović.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mišković, S., Stanimirović, Z. & Grujičić, I. Solving the robust two-stage capacitated facility location problem with uncertain transportation costs. Optim Lett 11, 1169–1184 (2017). https://doi.org/10.1007/s11590-016-1036-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-016-1036-2

Keywords