Skip to main content
SpringerLink
Log in

Heuristic Algorithms for Solving an Integrated Dynamic Center Facility Location - Network Design Model

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

Abstract

This paper studies the problem of determining optimal facility location and network design decisions over multiple time periods considering equity-based objective. The problem determines optimal locations of facilities and the design of the underlying network, taking into account budget constraints on opening facilities and constructing links for each time period during the planning horizon. The objective is to minimize the sum over all time periods of the maximum travel time between nodes and facilities for each time period. We propose a mixed-integer, non-linear programming model to address the problem. The non-linear terms of the model relevant to the objective function can be easily converted to linear terms. Due to the high complexity of the model, CPLEX could not solve the problem efficiently. Hence, we propose two heuristics based on linear relaxation and a hybrid algorithm based on Variable Neighborhood Search to solve the problem. We tested the performance of the proposed algorithms on two data sets with up to 60 nodes, 708 candidate links, and 20 time periods compared to each other and the CPLEX solver.

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

Similar content being viewed by others

References

  • Albareda-Sambola M, Alonso-Ayuso A, Escudero FL, Fernández E, Hinojosa Y, Pizarro-Romero C (2009) A computational comparison of several formulations for the multi-period incremental service facility location problem. TOP 18:62–80

    Article  Google Scholar 

  • Alumur S, Kara BY (2008) Network hub location problems: the state of the art. Eur J Oper Res 190(1):1–21

    Article  Google Scholar 

  • Balakrishnan A, Magnanti TL, Wong RT (1989) A dual-ascent procedure for large-scale uncapacitated network design. Oper Res 37(5):716–740

    Article  Google Scholar 

  • Ballou RH (1968) Dynamic warehouse location analysis. J Mark Res 5:271–276

    Article  Google Scholar 

  • Bigotte JF, Krass D, Antunes AP, Berman O (2010) Integrated modeling of urban hierarchy and transportation network planning. Transp Res A 44(7):506–522

    Google Scholar 

  • Brimberg J, Hansen P, Mladenović N, Taillard É (2000) Improvements and comparison of heuristics for solving the multisource Weber problem. Oper Res 48(3):444–460

    Article  Google Scholar 

  • Chrissis JW, Davis RP, Miller DM (1982) The dynamic set covering problem. Appl Math Model 6(1):2–6

    Article  Google Scholar 

  • Cocking C (2008) Solutions to facility location–network design problems, Department of Computer Science. University of Heidelberg, Doctor of Philosophy Thesis

  • Cocking C, Reinelt G (2008) Heuristics for budget facility location-network design problems with minisum objective, Annual International Conference of German Research Society, University of Augsburg. Operations Research Proceedings, Springer Berlin Heidelberg, pp. 563–568

  • Contreras I, Fernandez E (2012) General network design: a unified view of combined location and network design problems. Eur J Oper Res 219:680–697

    Article  Google Scholar 

  • Contreras I, Fernandez E, Reinelt G (2012) Minimizing the maximum travel time in a combined model of facility location and network design. Omega 40:847–860

    Article  Google Scholar 

  • Cornuejols G, Nemhauser GL, Wolsey LA (1990) The uncapacitated facility location problem. In: Mirchandani PB, Francis RL (eds) Discrete location theory. Wiley, New York, pp 119–171

    Google Scholar 

  • Correia I, Nickel S, Saldanha-da-Gama F (2014) Multi-product capacitated single-allocation hub location problems: formulations and inequalities. Netw Spat Econ 14(1):1–25

    Article  Google Scholar 

  • Current J, Ratick S, ReVelle C (1998) Dynamic facility location when the total number of facilities is uncertain: a decision analysis approach. Eur J Oper Res 110(3):597–609

    Article  Google Scholar 

  • Daskin MS (2008) What you should know about location modeling. Nav Res Logist (NRL) 55(4):283–294

    Article  Google Scholar 

  • Daskin MS, Hurter AP, VanBuer MG (1993) Toward an integrated model of facility location and transportation network design, Working Paper, Transportation Center, Northwestern University

  • Dias J, Eugénia Captivo M, Clímaco J (2007) Efficient primal-dual heuristic for a dynamic location problem. Comput Oper Res 34:1800–1823

    Article  Google Scholar 

  • Drezner Z (1995) Dynamic facility location: the progressive p-median problem. Locat Sci 3(1):1–7

    Article  Google Scholar 

  • Drezner Z, Wesolowsky GO (2003) Network design: selection and design of links and facility location. Transp Res A 37(3):241–256

    Google Scholar 

  • Escuín D, Millán C, Larrodé E (2012) Modelization of time-dependent urban freight problems by using a multiple number of distribution centers. Netw Spat Econ 12(3):321–336

    Article  Google Scholar 

  • Farahani RZ, Abedian M, Sharahi S (2009) Dynamic facility location problem, Facility Location: Concepts, Models, Algorithms and Case Studies. Springer

  • Ghaderi A, Boland N, Jabalameli MS (2012) Exact and heuristic approaches to the budget-constrained dynamic uncapacitated facility location-network design problem. Centre for Optimal Planning and Operations, The University of Newcastle

  • 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 

  • Hansen P, Mladenović N, Pérez JAM (2010) Variable neighborhood search: methods and applications. Ann Oper Res 175(1):367–407

    Article  Google Scholar 

  • Jabalameli MS, Ghaderi A (2008) Hybrid algorithms for the uncapacitated continuous location-allocation problem. Int J Adv Manuf Technol 37(1–2):202–209

    Article  Google Scholar 

  • Jabalameli MS, Ghaderi A, Shishebori D (2011) An efficient algorithm to solve dynamic budget constrained uncapacitated facility location-network design problem. Int J Bus Manag Stud 3(1):263–273

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Laporte G, Dejax P (1989) Dynamic location-routing problems. J Oper Res Soc 40(5):471–482

    Article  Google Scholar 

  • Magnanti TL, Wong RT (1984) Network design and transportation planning: models and algorithms. Transp Sci 18(1):1–55

    Article  Google Scholar 

  • Manne AS (1961) Capacity expansion and probabilistic growth. Econometrica 29(4):632–649

    Article  Google Scholar 

  • Manne AS (1967) Investment for capacity expansion: size, location, and time phasing. MIT Press, Cambridge

    Google Scholar 

  • Melkote S (1996) Integrated models of facility location and network design, Industrial Engineering and Management Science. Northwestern University, Evaston, Doctor of Philosophy

    Google Scholar 

  • Melkote S, Daskin MS (2001a) Capacitated facility location-network design problems. Eur J Oper Res 129(3):481–495

    Article  Google Scholar 

  • Melkote S, Daskin MS (2001b) An integrated model of facility location and transportation network design. Transp Res A 35(6):515–538

    Google Scholar 

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

    Article  Google Scholar 

  • Melo T, Nickel S, Saldanha-da-Gama F (2009b) An LP-rounding heuristic to solve a multi-period facility relocation problem, Berichte des Fraunhofer ITWM, no.168

  • Middleton RS, Kuby MJ, Bielicki JM (2012a) Generating candidate networks for optimization: the CO2 capture and storage optimization problem. Comput Environ Urban Syst 36(1):18–29

    Article  Google Scholar 

  • Middleton RS, Kuby MJ, Wei R, Keating GN, Pawar RJ (2012b) A dynamic model for optimally phasing in CO2 capture and storage infrastructure. Environ Model Softw 37:193–205

    Article  Google Scholar 

  • Nagy G, Salhi S (2007) Location-routing: issues, models and methods. Eur J Oper Res 177(2):649–672

    Article  Google Scholar 

  • Rahmaniani R, Ghaderi A (2013) A combined facility location and network design problem with multi-type of capacitated links. Appl Math Model 37(9):6400–6414

    Article  Google Scholar 

  • 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 

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

    Article  Google Scholar 

  • Santos-Peñate D, Suárez-Vega R, Dorta-González P (2007) The leader–follower location model. Netw Spat Econ 7(1):45–61

    Article  Google Scholar 

  • Shishebori D, Jabalameli MS (2013) Improving the efficiency of medical services systems: a new integrated mathematical modeling approach. Mathematical Problems in Engineering 2013, Volume 2013, Article ID 649397

  • Shishebori D, Snyder LV, Jabalameli MS (2014a) A reliable budget-constrained fl/nd problem with unreliable facilities. Netw Spat Econ. doi:10.1007/s11067-014-9254-6

    Google Scholar 

  • Shishebori D, Jabalameli MS, Jabbarzadeh A (2014b) Facility location-network design problem: reliability and investment budget constraint. J Urban Plan Dev 140(3):1–10

  • Wesolowsky GO (1973) Dynamic facility location. Manag Sci 19(11):1241–1248

    Article  Google Scholar 

  • Zeng W, Castillo I, Hodgson MJ (2010) A generalized model for locating facilities on a network with flow-based demand. Netw Spat Econ 10(4):579–611

    Article  Google Scholar 

Download references

Acknowledgments

This work has been financially supported by grant number 4/31753 from the University of Kurdistan. The author would like to express special thanks to the Editor Michael Kuby and to anonymous referees for their constructive comments.

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, University of Kurdistan, Sanandaj, Iran, 66177-15177

    Abdolsalam Ghaderi

Authors
  1. Abdolsalam Ghaderi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Abdolsalam Ghaderi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ghaderi, A. Heuristic Algorithms for Solving an Integrated Dynamic Center Facility Location - Network Design Model. Netw Spat Econ 15, 43–69 (2015). https://doi.org/10.1007/s11067-014-9269-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11067-014-9269-z

Keywords

Search

Navigation