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.
T. Levanova—This research was supported by the Program of Fundamental Scientific Research of the State Academies of Sciences, task I.5.1.6.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
Aboolian, R., Berman, O., Krass, D.: Competitive facility location and design problem. Eur. J. Oper. Res. 182(1), 40–62 (2007)
Aboolian, R., Berman, O., Krass, D.: Competitive facility location model with concave demand. Eur. J. Oper. Res. 181, 598–619 (2007)
Alekseeva, E., Kochetova, N., Kochetov, Y., Plyasunov, A.: Heuristic and exact methods for the discrete (r \(|\) p)-centroid problem. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 11–22. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-12139-5_2
Beresnev, V.L.: Upper bounds for objective function of discrete competitive facility location problems. J. Appl. Ind. Math. 3(4), 3–24 (2009)
Berman, O., Krass, D.: Locating multiple competitive facilities: spatial interaction models with variable expenditures. Ann. Oper. Res. 111, 197–225 (2002)
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)
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)
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)
Karakitsiou, A.: Modeling Discrete Competitive Facility Location. Springer, Heidelberg (2015)
Kerby, D.S.: The simple difference formula: an approach to teaching nonparametric correlation. Compr. Psychol. 3(1) (2014). http://journals.sagepub.com/doi/full/10.2466/11.IT.3.1. Accessed 20 Dec 2017
Levanova, T., Gnusarev, A.: Variable neighborhood search approach for the location and design problem. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 570–577. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-44914-2_45
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)
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)
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)
Sridharan, R.: The capacitated plant location problem. Eur. J. Oper. Res. 87, 203–213 (1995)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Levanova, T., Gnusarev, A. (2018). Development of Threshold Algorithms for a Location Problem with Elastic Demand. In: Lirkov, I., Margenov, S. (eds) Large-Scale Scientific Computing. LSSC 2017. Lecture Notes in Computer Science(), vol 10665. Springer, Cham. https://doi.org/10.1007/978-3-319-73441-5_41
Download citation
DOI: https://doi.org/10.1007/978-3-319-73441-5_41
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-73440-8
Online ISBN: 978-3-319-73441-5
eBook Packages: Computer ScienceComputer Science (R0)