Abstract
The article is devoted to the decision-making methods for the following location and design problem. The Company is planning to locate its facilities and gain profit at an already existing market. Therefore it has to take into consideration such circumstances as already placed competing facilities; the presence of several projects for each facility opening; the share of the served demand is flexible and depends on the facility location. The aim of the Company is to determine its new facilities locations and options in order to attract the biggest share of the demand. Modeling flexible demand requires exploiting nonlinear functions which complicates the development of the solution methods. A Variable Neighborhoods Search algorithm and a Greedy Weight Heuristic are proposed. The experimental analysis of the algorithms for the instances of special structure has been carried out. New best known solutions have been found, thus denoting the perspective of the further research in this direction.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Mirchandani, B.P., Francis, R.L. (eds.).: Discrete Location Theory. Wiley-Interscience, New York (1990)
Karakitsion, A.: Modeling Discrete Competitive Facility Location. Springer, Heidelberg (2015)
Berman, O., Krass, D.: Locating multiple competitive facilities: spatial interaction models with variable expenditures. Ann. Oper. Res. 111, 197–225 (2002)
Aboolian, R., Berman, O., Krass, D.: Competitive facility location and design problem. Eur. J. Oper. Res. 182, 40–62 (2007)
Gendreau, M., Potvin, J.Y.: Handbook of Metaheuristics. Springer, New York (2010)
Yannakakis, M.: Computational complexity. In: Aarts, E., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 19–55. Wiley, Chichester (1997)
Hansen, P., Mladenovic, N.: Variable neighborhood search: principles and applications (invited review). Eur. J. Oper. Res. 130(3), 449–467 (2001)
Levanova, T., Gnusarev, A.: Variable neighborhood search approach for the location and design problem. In: Kochetov, Y et al. (eds.) DOOR-2016. LNCS, vol. 9869, pp. 570–577. Springer, Heidelberg (2016)
Bonami, P., Biegler, L.T., Conn, A.R., Cornuejols, G., Grossmann, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N., Wachter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optimization 5(2), 186–204 (2008)
Huff, D.L.: Defining and estimating a trade area. J Mark. 28, 34–38 (1964)
Hansen, P., Mladenovic, N., Moreno-Perez, J.F.: Variable neighbourhood search: algorithms and applications. Ann. Oper. Res. 175, 367–407 (2010)
Kochetov, Y., Alekseeva, E., Levanova, T., Loresh, M.: Large neighborhood local search for the p-median problem. Yugoslav J. Oper. Res. 15(2), 53–64 (2005)
Acknowledgements
This research was supported by the Russian Foundation for Basic Research, grant 15-07-01141.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Gnusarev, A. (2017). Comparison of Two Heuristic Algorithms for a Location and Design Problem. In: Kalyagin, V., Nikolaev, A., Pardalos, P., Prokopyev, O. (eds) Models, Algorithms, and Technologies for Network Analysis. NET 2016. Springer Proceedings in Mathematics & Statistics, vol 197. Springer, Cham. https://doi.org/10.1007/978-3-319-56829-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-56829-4_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-56828-7
Online ISBN: 978-3-319-56829-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)