Skip to main content
Top

2018 | OriginalPaper | Chapter

Development of Threshold Algorithms for a Location Problem with Elastic Demand

Authors : Tatyana Levanova, Alexander Gnusarev

Published in: Large-Scale Scientific Computing

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

This work is devoted to development of threshold algorithms for one static probabilistic competitive facility location and design problem in the following formulation. New Company plans to enter the market and to locate new facilities with different design scenarios. Clients of each point choose to use the facilities of Company or its competitors depending on their attractiveness and distance. The aim of the new Company is to capture the greatest number of customers thus serving the largest share of the demand. This share for the Company is elastic and depends on clients’ decisions. We offer three types of threshold algorithms: Simulated annealing, Threshold improvement and Iterative improvement. Experimental tuning of parameters of algorithms was carried out. A comparative analysis of the algorithms, depending on the nature and value of the threshold on special test examples up to 300 locations is carried out. The results of numerical experiments are discussed.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Aarts, E., Korst, J., Laarhoven, P.: Simulated annealing. In: Aarts, E., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 91–120. Wiley, New York (1997) Aarts, E., Korst, J., Laarhoven, P.: Simulated annealing. In: Aarts, E., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 91–120. Wiley, New York (1997)
2.
3.
go back to reference Aboolian, R., Berman, O., Krass, D.: Competitive facility location model with concave demand. Eur. J. Oper. Res. 181, 598–619 (2007)CrossRefMATHMathSciNet Aboolian, R., Berman, O., Krass, D.: Competitive facility location model with concave demand. Eur. J. Oper. Res. 181, 598–619 (2007)CrossRefMATHMathSciNet
5.
go back to reference Beresnev, V.L.: Upper bounds for objective function of discrete competitive facility location problems. J. Appl. Ind. Math. 3(4), 3–24 (2009)CrossRefMATHMathSciNet Beresnev, V.L.: Upper bounds for objective function of discrete competitive facility location problems. J. Appl. Ind. Math. 3(4), 3–24 (2009)CrossRefMATHMathSciNet
6.
go back to reference Berman, O., Krass, D.: Locating multiple competitive facilities: spatial interaction models with variable expenditures. Ann. Oper. Res. 111, 197–225 (2002)CrossRefMATHMathSciNet Berman, O., Krass, D.: Locating multiple competitive facilities: spatial interaction models with variable expenditures. Ann. Oper. Res. 111, 197–225 (2002)CrossRefMATHMathSciNet
7.
go back to reference Cornuejols, G., Nemhauser, G.L., Wolsey, L.A.: The uncapacitated facility location problem discrete location problems. In: Mirchamdani, P.B., Franscis, R.L. (eds.) Discrete Location Problems, pp. 119–171. Wiley, New York (1990) Cornuejols, G., Nemhauser, G.L., Wolsey, L.A.: The uncapacitated facility location problem discrete location problems. In: Mirchamdani, P.B., Franscis, R.L. (eds.) Discrete Location Problems, pp. 119–171. Wiley, New York (1990)
8.
go back to reference Drezner, T.: Competitive facility location in plane. In: Drezner, Z. (ed.) Facility Location. A Survey of Applications and Methods, pp. 285–300. Springer, Berlin (1995)CrossRef Drezner, T.: Competitive facility location in plane. In: Drezner, Z. (ed.) Facility Location. A Survey of Applications and Methods, pp. 285–300. Springer, Berlin (1995)CrossRef
9.
go back to reference Davydov, I.A., Kochetov, Y.A., Mladenovic, N., Urosevic, D.: Fast metaheuristics for the discrete \(r|p\)-centroid problem. Autom. Remote Control 75(4), 677–687 (2014)CrossRefMATHMathSciNet Davydov, I.A., Kochetov, Y.A., Mladenovic, N., Urosevic, D.: Fast metaheuristics for the discrete \(r|p\)-centroid problem. Autom. Remote Control 75(4), 677–687 (2014)CrossRefMATHMathSciNet
10.
go back to reference Karakitsiou, A.: Modeling Discrete Competitive Facility Location. Springer, Heidelberg (2015)CrossRefMATH Karakitsiou, A.: Modeling Discrete Competitive Facility Location. Springer, Heidelberg (2015)CrossRefMATH
13.
go back to reference Mirchamdani, P.B.: The p-median problem and generalizations. In: Mirchamdani, P.B., Franscis, R.L. (eds.) Discrete Location Problems, pp. 55–118. Wiley, New York (1990) Mirchamdani, P.B.: The p-median problem and generalizations. In: Mirchamdani, P.B., Franscis, R.L. (eds.) Discrete Location Problems, pp. 55–118. Wiley, New York (1990)
14.
go back to reference Serra, D., ReVelle, C.: Competitive location in discrete space. In: Drezner, Z. (ed.) Facility Location. A Survey of Applications and Methods, pp. 367–386. Springer, Berlin (1995)CrossRef Serra, D., ReVelle, C.: Competitive location in discrete space. In: Drezner, Z. (ed.) Facility Location. A Survey of Applications and Methods, pp. 367–386. Springer, Berlin (1995)CrossRef
15.
go back to reference Spoerhose, J., Wirth, H.C.: (r, p)-centroid problems on paths and trees. Technical report No. 441, Institute of Computer Science, University of Wurzburg (2008) Spoerhose, J., Wirth, H.C.: (r, p)-centroid problems on paths and trees. Technical report No. 441, Institute of Computer Science, University of Wurzburg (2008)
16.
go back to reference Sridharan, R.: The capacitated plant location problem. Eur. J. Oper. Res. 87, 203–213 (1995)CrossRefMATH Sridharan, R.: The capacitated plant location problem. Eur. J. Oper. Res. 87, 203–213 (1995)CrossRefMATH
Metadata
Title
Development of Threshold Algorithms for a Location Problem with Elastic Demand
Authors
Tatyana Levanova
Alexander Gnusarev
Copyright Year
2018
DOI
https://doi.org/10.1007/978-3-319-73441-5_41

Premium Partner