Abstract
We propose a large-scale sparse customer-facility network model that allows a customer to be assigned only to facilities within the vicinity of a customer. In this model, customer-facility distances are integer values representing zones. Experimental results are presented for large instances with up to 100,000 customers and 100 potential facility sites. A mixed-integer linear programming solver reveals large gaps in suboptimal solutions and lower bounds provided, even with a considerable computational effort. Two simple but scalable local search heuristics are computationally investigated, revealing their potential for solving such large-scale problems in practice.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Al-Sultan, K.S., Al-Fawzan, M.A.: A tabu search approach to the uncapacitated facility location problem. Ann. Oper. Res. 86, 91–103 (1999)
Applegate, D., Cook, W.: A computational study of the job-shop scheduling problem. ORSA J. Comput. 3(2), 149–156 (1991)
Arostegui, M.A., Kadipasaoglu, S.N., Khumawala, B.M.: An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems. Int. J. Prod. Econ. 103(2), 742–754 (2006)
Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. SIAM J. Comput. 33(3), 544–562 (2004)
Bonami, P., Biegler, L.T., Conn, A.R., Cornuéjols, G., Grossmann, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N., et al.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5(2), 186–204 (2008)
Chalupa, D., Blum, C.: Mining k-reachable sets in real-world networks using domination in shortcut graphs. J. Comput. Sci. 22, 1–14 (2017)
Chalupa, D., Hawick, K.A., Walker, J.A.: Hybrid bridge-based memetic algorithms for finding bottlenecks in complex networks. Big Data Res. (2018, to appear)
Daskin, M.S., Snyder, L.V., Berger, R.T.: Facility location in supply chain design. In: Logistics Systems: Design and Optimization, pp. 39–65 (2005)
Do, N.A.D., Nielsen, I.E., Chen, G., Nielsen, P.: A simulation-based genetic algorithm approach for reducing emissions from import container pick-up operation at container terminal. Ann. Oper. Res. 242(2), 285–301 (2016)
Guner, A.R., Sevkli, M.: A discrete particle swarm optimization algorithm foruncapacitated facility location problem. J. Artif. Evol. Appl. 545(C), 39–58 (2008)
Jansen, T., Zarges, C.: Performance analysis of randomised search heuristics operating with a fixed budget. Theor. Comput. Sci. 545, 39–58 (2014)
Jaramillo, J.H., Bhadury, J., Batta, R.: On the use of genetic algorithms to solve location problems. Comput. Oper. Res. 29(6), 761–779 (2002)
Lančinskas, A., Fernández, P., Pelegín, B., Žilinskas, J.: Improving solution of discrete competitive facility location problems. Optim. Lett. 11(2), 259–270 (2017)
Linderoth, J.T., Lodi, A.: MILP software. In: Wiley Encyclopedia of Operations Research and Management Science (2011)
Melo, M.T., Nickel, S., Saldanha-Da-Gama, F.: Facility location and supply chain management-a review. Eur. J. Oper. Res. 196(2), 401–412 (2009)
Michel, L., Van Hentenryck, P.: A simple tabu search for warehouse location. Eur. J. Oper. Res. 157(3), 576–591 (2004)
Mourtzis, D., Doukas, M., Vandera, C.: Mobile apps for product customisation and design of manufacturing networks. Manuf. Lett. 2(2), 30–34 (2014)
Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity. Springer, Heidelberg (2010)
Nimrod, M., Arie, T.: On the complexity of locating linear facilities in the plane. Oper. Res. Lett. 1(5), 194–197 (1982)
Relich, M., Pawlewski, P.: A multi-agent system for selecting portfolio of new product development projects. Commun. Comput. Inform. Sci. 524, 102–114 (2015)
Sun, J., Xie, Y., Zhang, H., Faloutsos, C.: Less is more: sparse graph mining with compact matrix decomposition. Stat. Anal. Data Min.: ASA Data Sci. J. 1(1), 6–22 (2008)
Sun, M.: Solving the uncapacitated facility location problem using tabu search. Comput. Oper. Res. 33(9), 2563–2589 (2006)
Yigit, V., Aydin, M.E., Turkbey, O.: Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing. Int. J. Prod. Res. 44(22), 4773–4791 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Chalupa, D., Nielsen, P., Banaszak, Z., Bocewicz, G. (2020). A Large-Scale Customer-Facility Network Model for Customer Service Centre Location Applications. In: Borzemski, L., Świątek, J., Wilimowska, Z. (eds) Information Systems Architecture and Technology: Proceedings of 40th Anniversary International Conference on Information Systems Architecture and Technology – ISAT 2019. ISAT 2019. Advances in Intelligent Systems and Computing, vol 1050. Springer, Cham. https://doi.org/10.1007/978-3-030-30440-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-30440-9_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-30439-3
Online ISBN: 978-3-030-30440-9
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)