Abstract
The continuous p-median location problem is to locate p facilities in the Euclidean plane in such a way that the sum of distances between each demand point and its nearest median/facility is minimized. In this paper, the continuous p-median problem is studied, and a proposed Grey Wolf Optimizer (GWO) algorithm, which has not previously been applied to this problem, is presented and compared to a proposed Particle Swarm Optimization (PSO) algorithm. As an experimental evidence for the NFL theorem, the experimental results showed that the no algorithm can outperformed the other in all cases, however the proposed PSO has better performance in most of the cases. The experimental results show that the two proposed algorithms have better performance than other PSO methods in the literature.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Farahani, R.Z., Hekmatfar, M.: Facility Location Concepts, Models, Algorithms and Case Studies. Springer-Verlag, Heidelberg (2009)
Love, R.F., Morris, J.G., Wesolowsky, G.O.: Facilities Location: Models & Methods. North-Holland, Amsterdam (1988)
Megiddo, N., Supowit, K.J.: On the complexity of some common geometric location problems. SIAM J. Comput. 13(1), 182–196 (1984)
Daskin, M.S.: Network and Discrete Location: Models, Algorithms, 2nd edn. Wiley, New York (2013)
Laporte, G., Nickel, S., da Gama, F.S.: Location Science. Springer, Cham (2015)
Ghaderi, A., Jabalameli, M.S., Barzinpour, F., Rahmaniani, R.J.N.: An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem. Netw. Spat. Econ. 12(3), 421–439 (2012)
Hakimi, S.L.: Optimum locations of switching centers and the absolute centers and medians of a graph. Oper. Res. 12(3), 450–459 (1964)
Hakimi, S.L.: Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper. Res. 13(3), 462–475 (1965)
Cooper, L.: Location-allocation problems. Oper. Res. 11(3), 331–343 (1963)
Cooper, L.: Heuristic methods for location-allocation problems. SIAM Rev. 6(1), 37–53 (1964)
Salhi, S., Gamal, M.: A genetic algorithm based approach for the uncapacitated continuous location–allocation problem. Ann. Oper. Res. 123(1–4), 203–222 (2003)
Brimberg, J., Drezner, Z., Mladenovic, N., Salhi, S.: A new local search for continuous location problems. Eur. J. Oper. Res. 232, 256–265 (2014)
Kuenne, R., Soland, R.: Exact and approximate solutions to the multisource weber problem. Math. Program. 3, 193–209 (1972)
Ostresh, J.L.M.: Multi-exact solutions to the M-center location-allocation problem. In: Rushton, G., Goodchild, M.F., Ostresh Jr, L.M. (eds.) Computer Programs for Location-Allocation Problems. Monograph No. 6. University of Iowa, IA (1973)
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)
ReVelle, C.S., Eiselt, H.A., Daskin, M.S.: A bibliography for some fundamental problem categories in discrete location science. Eur. J. Oper. Res. 184, 817–848 (2008)
Mladenovic, N., Brimberg, J., Hansen, P., Moreno-Perez, J.A.: The p-median problem: a survey of metaheuristic approaches. Eur. J. Oper. Res. 179, 927–939 (2007)
Irawan, C.A., Salhi, S., Scaparra, M.P.: An adaptive multiphase approach for large unconditional and conditional p-median problems. Eur. J. Oper. Res. 237, 590–605 (2014)
Mirjalili, S., Mirjalili, S.M., Lewis, A.: Grey wolf optimizer. Adv. Eng. Softw. 69, 46–61 (2014)
Elsevier: Most Cited Advances in Engineering Software Articles, 16 February 2019. https://www.journals.elsevier.com/advances-in-engineering-software/most-cited-articles
Martinez, W.L., Martinez, A.R., Solka, J.: Exploratory Data Analysis with MATLAB. Chapman and Hall/CRC, Boca Raton (2017)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neutral Networks, pp. 1942–1948 (1995)
Ahmed, H., Glasgow, J.: Swarm intelligence: concepts, models and applications, vol. K7L3N6. Technical report 2012-585, School of Computing, Queen’s University, Kingston, Ontario, Canada (2012)
Yang, X.-S.: Nature-Inspired Optimization Algorithms. Elsevier, Amsterdam (2014)
Shelokar, P.S., Siarry, P., Jayaraman, V.K., Kulkarni, B.D.: Particle swarm and ant colony algorithms hybridized for improved continuous optimization. Appl. Math. Comput. 188, 129–142 (2007)
Sumathi, S., Paneerselvam, S.: Computational Intelligence Paradigms: Theory & Applications Using MATLAB. Taylor and Francis Group, Milton Park (2010)
Reinelt, G.: TSLIB—a traveling salesman library. ORSA J. Comput. 3, 376–384 (1991)
Brimberg, J., Hansen, P., Mladenovi, N., Taillard, E.D.: Improvements and comparison of heuristics for solving the uncapacitated multisource weber problem. Oper. Res. 48(3), 444–460 (2000)
Drezner, Z., Brimberg, J., Mladenović, N., Salhi, S.: New heuristic algorithms for solving the planar p-median problem. Comput. Oper. Res. 62, 296–304 (2014)
Brito, J., MartÃnez, F.J., Moreno, J.A.: Particle swarm optimization for the continuous p-median problem. In: 6th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics, CIMMACS, pp. 14–16 (2007)
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
Rabie, H.M. (2020). Particle Swarm Optimization and Grey Wolf Optimizer to Solve Continuous p-Median Location Problems. In: Hassanien, A., Shaalan, K., Tolba, M. (eds) Proceedings of the International Conference on Advanced Intelligent Systems and Informatics 2019. AISI 2019. Advances in Intelligent Systems and Computing, vol 1058. Springer, Cham. https://doi.org/10.1007/978-3-030-31129-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-31129-2_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-31128-5
Online ISBN: 978-3-030-31129-2
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)