Skip to main content
SpringerLink
Log in

Variable neighborhood search based evolutionary algorithm and several approximations for balanced location–allocation design problem

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

This paper introduces balanced location–allocation design problem to tackle a real-world health-care application. The problem involves strategic decisions on locating a predefined number of facilities and allocating a set of customers to the facilities such that minimizes total travel, operating and congestion costs in an uncertain environment. To face more appropriately with the uncertainties, a comprehensive model which takes into account all sources of uncertainty is proposed. Moreover, in order to have a balanced use of installed capacities and/or reduce delays in servicing, congestion-related costs are defined as a power-law function of the trespassed facility’s operating capacity. The developed model is extremely hard to solve because of its inherently high combinatorial nature combined with the uncertainties and the nonlinearities associated to the congestion. Therefore, a new search mechanism based on variable neighborhood search is put forward. This algorithm employs both random and mathematical programming techniques to generate a set of initial solutions. On the other hand, to examine the quality of each move, a linear model which is scenario decomposable is extracted. The validation of the model is studied on an existing application, and the algorithm’s performance is tested on a wide range of instances taken from literature.

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

  1. Farahani RZ et al (2013) Hub location problems: a review of models, classification, solution techniques, and applications. Comput Ind Eng 64(4):1096–1109

    Article  Google Scholar 

  2. Owen SH, Daskin MS (1998) Strategic facility location: a review. Eur J Oper Res 111(3):423–447

    Article  MATH  Google Scholar 

  3. 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  MATH  MathSciNet  Google Scholar 

  4. Zarrinpoor N, Seifbarghy M (2011) A competitive location model to obtain a specific market share while ranking facilities by shorter travel time. Int J Adv Manuf Technol 55(5–8):807–816

    Article  Google Scholar 

  5. Hernández P et al (2012) A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty. Comput Oper Res 39(9):2232–2241

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. Francis RL, McGinnis LF, White JA (1983) Locational analysis. Eur J Oper Res 12(3):220–252

    Article  MATH  MathSciNet  Google Scholar 

  8. Bozorgi-Amiri A et al (2012) A modified particle swarm optimization for disaster relief logistics under uncertain environment. Int J Adv Manuf Technol 60(1–4):357–371

    Article  Google Scholar 

  9. Rahmaniani R et al (2013) Stochastic p–robust uncapacitated multiple allocation p–hub location problem. Int J Ind Syst Eng 14(3):296–314

    Google Scholar 

  10. Snyder LV (2006) Facility location under uncertainty: a review. IIE Trans (Inst Ind Eng) 38(7):547–564

    Google Scholar 

  11. Murali P, Ordóñez F, Dessouky MM (2012) Facility location under demand uncertainty: response to a large-scale bio-terror attack. Socio Econ Plan Sci 46(1):78–87

    Article  Google Scholar 

  12. Uno T, Katagirit H, Kato K (2010) A facility location for fuzzy random demands in a competitive environment. IAENG Int J Appl Math 40(3)

  13. Nikoofal M, Sadjadi S (2010) A robust optimization model for P- median problem with uncertain edge lengths. Int J Adv Manuf Technol 50(1):391–397

    Article  Google Scholar 

  14. Daskin MS, Coullard CR, Shen ZJM (2002) An inventory-location model: formulation, solution algorithm and computational results. Ann Oper Res 110(1–4):83–106

    Article  MATH  MathSciNet  Google Scholar 

  15. Rahmaniani R, Saidi-Mehrabad M, Ashouri H (2013) Robust Capacitated Facility Location Problem: Optimization Model and Solution Algorithms. J Uncertain Syst 7(1):22–35

    Google Scholar 

  16. Thapalia BK et al (2011) Single-commodity stochastic network design with multiple sources and sinks. Inf Syst Oper Res 49:193–211

    MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  18. Azad N, Davoudpour H Designing a stochastic distribution network model under risk. Int J Adv Manuf Technol: 1–18

  19. Current J, Daskin M, Schilling D (2002) Discrete network location models, in Facility location: applications and theory. In Drezner Z, Hamacher HW, (ed). Springer-Verlag, Berlin, p 81–118

  20. Ghosh A, Rushton G (1987) Spatial analysis and location–allocation models. Van Nostrand Reinhold Company, New York, NY

    Google Scholar 

  21. Camargo RS, Miranda G (2012) Single allocation hub location problem under congestion: Network owner and user perspectives. Expert Syst Appl 39(3):3385–3391

    Article  Google Scholar 

  22. Elhedhli S, Hu FX (2005) Hub-and-spoke network design with congestion. Comput Oper Res 32(6):1615–1632

    Article  Google Scholar 

  23. Marianov V, Serra D (2011) Location of multiple-server common service centers or facilities, for minimizing general congestion and travel cost functions. Int Reg Sci Rev 34(3):323–338

    Article  Google Scholar 

  24. Boffey B, Galvão R, Espejo L (2007) A review of congestion models in the location of facilities with immobile servers. Eur J Oper Res 178(3):643–662

    Article  MATH  Google Scholar 

  25. Thapalia BK et al (2011) Single-commodity network design with stochastic demand and multiple sources and sinks. INFOR Inf Syst Oper Res 49(3):193–211

    MathSciNet  Google Scholar 

  26. Elhedhli S, Hu FX (2005) Hub-and-spoke network design with congestion. Comput Oper Res 32:1615–1632

    Article  Google Scholar 

  27. Rahmaniani R, Shafia MA (2013) A study on maximum covering transportation network design with facility location under uncertainty. J Ind Prod Eng 30(2):78–93

    Google Scholar 

  28. Oppong JR (1996) Accommodating the rainy season in third world location–allocation applications. Socio Econ Plan Sci 30(2):121–137

    Article  Google Scholar 

  29. Cocking C (2008) Solutions to Facility Location–Network Design Problems. Department of Computer Science. University of Heidelberg, Heidelberg

  30. Rahman S, Smith DK (2000) Use of location–allocation models in health service development planning in developing nations. Eur J Oper Res 123(3):437–452

    Article  MATH  Google Scholar 

  31. Rushton G (1984) Use of location–allocation models for improving the geographical accessibility of rural services in developing countries. Int Reg Sci Rev 9:217–240

    Article  Google Scholar 

  32. Statictical Center of Iran (2007) Census report of Iran population. http://www.amar.org.ir

  33. Ghaderi A, Jabalameli MS (2013) Modeling the budget-constrained dynamic uncapacitated facility location–network design problem and solving it via two efficient heuristics: a case study of health care. Math Comput Model 57(3–4):382–400

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Départment de Mathématiques et Génie Industriel, École Polytechnique de Montréal, Montréal, QC, H3T 1J4, Canada

    Ragheb Rahmaniani

  2. Department of Computer Science, Kharazmi University, P.C. 31979-37551, Karaj, Iran

    Gona Rahmaniani

  3. Faculty of Industrial Engineering, Iran University of Science and Technology, P.C. 1684613114, Narmak, Tehran, Iran

    Armin Jabbarzadeh

Authors
  1. Ragheb Rahmaniani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gona Rahmaniani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Armin Jabbarzadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ragheb Rahmaniani.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rahmaniani, R., Rahmaniani, G. & Jabbarzadeh, A. Variable neighborhood search based evolutionary algorithm and several approximations for balanced location–allocation design problem. Int J Adv Manuf Technol 72, 145–159 (2014). https://doi.org/10.1007/s00170-013-5602-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-013-5602-9

Keywords

Search

Navigation