172
Views
5
CrossRef citations to date
0
Altmetric
Articles

Simple dynamic location problem with uncertainty: a primal-dual heuristic approach

&
Pages 1379-1397 | Received 28 Sep 2012, Accepted 21 May 2013, Published online: 02 Sep 2013

References

  • Daskin, M. S.. Network and discrete location: models, algorithms and applications. New York (NY)John Wiley – Sons. 1995.
  • Mirchandani, P. B., FrancisR. L.Discrete location theory. New York (NY)JohnWiley – Sons. 1990.
  • RevelleC, EiseltH, DaskinM. A bibliography for some fundamental problem categories in discrete location science. Eur. J. Oper. Res. 2008;184:817–848.
  • KuehnAA, HamburgerMJ. A heuristic program for locating warehouses. Manage. Sci. 1963;9:643–666.
  • Korte, B. Vygen J. Facility location. In KorteB., VygenJ. eds. Combinatorial optimization. Vol. 21. Springer: Berlin; 2012. p. 593–628.
  • RoodmanGM, SchwarzLB. Optimal and heuristic facility phase-out strategies. AIIE Trans. 1975;7:177–184.
  • RoodmanGM, SchwarzLB. Extensions of the multi-period facility phase-out model: new procedures and application to a phase-in/phase-out problem. AIIE Trans. 1977;9:103–107.
  • WesolowskyGO, TruscottWG. The multiperiod location-allocation problem with relocation of facilities. Manage. Sci. 1975;22:57–65.
  • RoyTJ, ErlenkotterD. A dual-based procedure for dynamic facility location. Manage. Sci. 1982;28:1091–1105.
  • BildeO, KrarupJ. Sharp lower bounds and efficient algorithms for the simple plant location problem. Annals. Discrete Math. 1977;1:79–97.
  • ErlenkotterD. A dual-based procedure for uncapacitated facility location. Oper. Res. 1978;26:992–1009.
  • DiasJ, CaptivoME, ClímacoJ. Efficient primal-dual heuristic for a dynamic location problem. Comput. Oper. Res. 2007;34:1800–1823.
  • ErlenkotterD. A comparative study of approaches to dynamic location problems. Eur. J. Oper. Res. 1981;6:133–143.
  • Jacobsen, S. K.Multiperiod capacitated location models. In MirchandaniP. B., FrancisR. L. eds. Discrete location theory. New York (NY): John Wiley – Sons; 1990. p. 173–208.
  • DiasJ, CaptivoME, ClímacoJ. A dynamic location problem with maximum decreasing capacities. Cent. Eur. J. Oper. Res. 2008;16:251–280.
  • Torres-SotoJE, UsterH. Dynamic-demand capacitated facility location problems with or without relocations. Int. J. Prod. Res. 2010;1:1–27.
  • OwenSH, DaskinMS. Strategic facility location: A review. Eur. J. Oper. Res. 1998;111:423–447.
  • LouveauxFV. Stochastic location analysis. Location Sci. 1993;1:127–154.
  • SnyderLV. Facility location under uncertainty: a review. IIE Trans. 2006;38:537–554.
  • LouveauxFV. Discrete stochastic location models. Ann. Oper. Res. 1986;6:23–34.
  • LouveauxFV, PeetersD. A dual-based procedure for stochastic facility location. Oper. Res. 1992;40:564–573.
  • RaviR, SinhaA. Hedging uncertainty: approximation algorithms for stochastic optimization problems. LNCS. 2004;3064:101–115.
  • WangX, XuD, ZhaoX. A primal-dual approximation algorithm for stochastic facility location problem with service installation costs. Front. Math. Chin. 2011;6:957–964.
  • Mo, Y., Harrison, T. P.. A conceptual framework for robust supply chain design under demand uncertainty. In GeunesJ., PardalosP. M. editors. Supply Chain Optimization. New York (NY): Springer; 2005. p. 243–263.
  • LaporteG, LouveauxFV, HammeLV. Exact solution to a location problem with stochastic demands. Transp. Sci. 1994;28:95–103.
  • LinCKY. Stochastic single-source capacitated facility location model with service level requirements. Int. J. Prod. Econ. 2009;117:439–451.
  • JornstenK, BjorndalM. Dynamic location under uncertainty. Studi. Regional Urban Planning. 1994;3:163–183.
  • RockafellarRT, WetsRJB. Scenarios and policy aggregation in optimization under uncertainty. Math. Oper. Res. 1991;16:119–147.
  • AhmedS, GarciaR. Dynamic capacity acquisition and assignment under uncertainty. Ann. Oper. Res. 2004;124:267–283.
  • RomauchM, HartlRF. Dynamic facility location with stochastic demands. LNCS. 2005;3777:180–189.
  • Albareda-Sambola, M., Alonso-Ayuso, A., Escudero, L. F., Fernández E Pizarro, C.On solving the multi-period location-assignment problem under uncertainty. Tech. Rep. WP09/07, Dpto. de Estadística eInvestigación Operativa. Universidad Rey Juan Carlos. Spain. 2009.
  • HernándezP, Alonso-AyusoA, BravoF, EscuderoLF, GuignardM, MarianovV, WeintraubA. A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty. Comput. Oper. Res. 2012;39:2232–2241.
  • AghezzafE. Capacity planning and warehouse location in supply chains with uncertain demands. J. Oper. Res. Soc. 2005;56:453–462.
  • NickelS, Saldanha-da-GamaF, ZieglerH. A multi-stage stochastic supply network design problem with financial decisions and risk management. Omega. 2012;40:511–524.
  • PanF, NagiR. Robust supply chain design under uncertain demand in agile manufacturing. Comput. Oper. Res. 2010;37:668–683.
  • Pimentel, B. S., Mateus, G. R., Almeida, F. A.Stochastic capacity planning in a global mining supply chain. Computational intelligence in production and logistics systems (CIPLS). IEEE Workshop on 2011. p. 1–8.
  • DemboRS. Scenario optimization. Annals. Oper. Res. 1991;30:63–80.
  • Van der Heijden, K.Scenarios: The art of strategic conversation. Chichester: John Wiley – Sons; 1996.
  • Kouvelis, P., Yu, G.Robust discrete optimization and its applications. Dordrecht: Kluwer.1997.
  • MulveyJM, VanderbeiRJ, ZeniosSA. Robust optimization of large-scale systems. Oper. Res. 1995;43:264–280.
  • Cornuejols, G., Nemhauser, G. L., Wolsey, L. A.The uncapacitated facility location problem. In Mirchandani PB, Francis RL, editors. Discrete location theory. New York (NY): John Wiley –Sons; 1990. p.119–171.
  • Berkelaar, M., Eikland, K., Notebaert, P.Open source (mixed-integer) linear programming system. Available from:http://lpsolve.sourceforge.net/5.5/.
  • Mo, Y., Harrison, T. P.A conceptual framework for robust supply chain design under demand uncertainty. In Geunes J, Pardalos PM, editors. Supply Chain Optimization. New York (NY): Springer; 2005. p. 243–263.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.