Abstract
k-median and facility location problems are classical NP-hard combinatorial optimization problems. Although there are many experimental studies on them, their theoretical results are relatively few. This paper mainly contributes to investigating the approximation performance of two evolutionary algorithms for the k-median and facility location problems from a theoretical perspective. For k-median problem, we show that the evolutionary algorithms with standard bit mutation (SBM) operator can obtain approximation ratios 5 and \(3{+}2/p\) in expected polynomial time while the evolutionary algorithm with somatic contiguous hypermutation (CHM) operator cannot obtain them. For facility location problem, we show that the evolutionary algorithms with SBM operator can obtain approximation ratio 3 in expected polynomial time while the evolutionary algorithm with CHM operator cannot obtain it. Further, we prove that on a facility location instance the evolutionary algorithm with CHM operator greatly outperforms the evolutionary algorithm with SBM operator.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Al-Ayyoub M, Rabab’Ah A, Jararweh Y, Al-Kabi MN, Gupta BB (2018) Studying the controversy in online crowds’ interactions. Appl Soft Comput 66:557–563
Alzain MA, Li AS, Soh B (2015) Multi-cloud data management using Shamir’s secret sharing and quantum byzantine agreement schemes. Int J Cloud Appl Comput 5(3):35–52
Arya V, Garg N, Khandekar R (2004) Local search heuristic for \(k\)-median and facility location problems. SIAM J Sci Comput 33(3):21–29
Bäck T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming. Oxford University Press, Oxford
Bhattacharya R, Bandyopadhyay S (2010) Solving conflicting bi-objective facility location problem by NSGA II evolutionary algorithm. Int J Adv Manuf Technol 51(1–4):397–414
Charikar M, Guha S (1999) Improved combinatorial algorithms for the facility location and \(k\)-median problems. In: Foundations of computer science annual symposium on, New York, USA, pp 378–388
Chrobak M, Kenyon C, Young NE (2005) The reverse greedy algorithm for the metric \(k\)-median problem. Inform Process Lett 97(2):654–660
Cooper L (1963) Location-allocation problems. Oper Res 11(3):331–343
Doerr B, Happ E, Klein C (2007) A tight analysis of the \((1{+}1)\)-EA for the single source shortest path problem. In: Proceedings of the IEEE congress on evolutionary computation. Singapore, pp 1890–1895
Droste S, Jansen T, Wegener I (2002) On the analysis of the \((1{+}1)\) evolutionary algorithm. Theor Comput Sci 276(1):51–81
Droste S, Jansen T, Wegener I (2002) On the analysis of the \((1{+}1)\) evolutionary algorithm. Theor Comput Sci 276(1–2):51–81
Giel O, Wegener I (2003) Evolutionary algorithms and the maximum matching problem. Inform Process Lett 15(82):14–19
He P, Deng ZL, Gao CZ, Wang XN, Li J (2017) Model approach to grammatical evolution: deep-structured analyzing of model and representation. Soft Comput 21(18):5413–5423
Jansen T, Zarges C (2009) A theoretical analysis of immune inspired somatic contiguous hypermutations for function optimization. Lect Notes Comput Sci 5666:80–94
Jansen T, Zarges C (2011) Analyzing different variants of immune inspired somatic contiguous hypermutations. Theor Comput Sci 412(6):517–533
Korupolu MR, Plaxton CG, Rajaraman R (2000) Analysis of a local search heuristic for facility location problems. J Algorithm 37(1):146–188
Lai XS, Zhou YR, He J, Zhang J (2014) Performance analysis of evolutionary algorithms for the minimum label spanning tree problem. IEEE Trans Evol Comput 18(6):860–872
Lehre PK, Yao X (2014) Runtime analysis of the \((1{+}1)\) EA on computing unique input output sequences. Inf Sci 259:510–531
Lin WW, Xu SY, Li J, Xu LL, Peng ZP (2017) Design and theoretical analysisi of virtual machine placement algorithm based on peak workload characteristics. Soft Comput 21(5):1301–1314
Neumann F, Wegener I (2007) Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theor Comput Sci 378(1):32–40
Neumann F, Witt C, et al (2010) Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. Nat Comput, pp 1035–1058
Oliveto PS, He J, Yao X (2009) Analysis of the \((1{+}1)\)-EA for finding approximate solutions to vertex cover problems. IEEE Trans Evol Comput 13(5):1006–1029
Pandit V (2018) Local search based approximation algorithms the \(k\)-median problem. http://www.cse.iitd.ernet.in/~pandit/localsearch.pdf. Accessed 26 Mar 2018
Peng X, Xia XY, Liao WZ, Guo ZW (2018) Runtime analysis of the Pareto archived evolution strategy on pseudo-Boolean functions. Multimed Tools Appl 77(9):11203–11217
Plageras AP, Stergiou C, Psannis KE (2018) Efficient IoT-based sensor BIG Data collection-processing and analysis in smart buildings. Future Gener Comput Syst 82:349–357
Stergiou C, Psannis KE, Kim BG, Gupta BB (2018) Secure integration of internet-of-things and cloud computing. Future Gener Comput Syst 78:964–975
Wang Y, Li KL, Li KQ (2017) Partition scheduling on heterogeneous multicore processors for multi-dimensional loops applications. Int J Parallel Prog 45(4):827–852
Wang Y, Liu Q, Hou HD, Rho S, Gupta B, Mu YX (2018) Big data driven outlier detection for soybean straw near infrared spectroscopy. J Comput Sci 26:178–189
Xia XY, Peng X (2018) Performance guarantees of evolutionary algorithms for the bank account location problem. IEEE Access 6:17756–17767
Xia XY, Zhou YR (2018) On the effectiveness of immune inspired mutation operators in some discrete optimization problems. Inf Sci 426:87–100
Zhang SH, Yang ZB, Xing XF, Gao Y, Xie DQ, Wong HS (2017) Generalized pair-counting similartiy measures for clustering and cluster ensembles. IEEE Access 5:16904–16918
Zhou YR, He J, Nie Q (2009) A comparative runtime analysis of heuristic algorithms for satisfiability problems. Artif Intell 173(2):240–257
Zhou YR, Zhang J, Wang Y (2015) Performance analysis of the \((1{+}1)\) evolutionary algorithm for the multiprocessor scheduling problem. Algorithmica 73(1):21–41
Acknowledgements
This work was supported by the National Natural Science Foundation of China (61703183, 61773410, 61601131), the Scientific Research Special Plan of Guangzhou Science and Technology Programme (201607010045), and Zhejiang Provincial Natural Science Foundation of China (LY15F020039, LY15F030021).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Ethical standards
All procedures performed in studies involving human participants were in accordance with the ethical standards of the institutional and/or national research committee and with the 1964 Helsinki Declaration and its later amendments or comparable ethical standards.
Human and animal rights statement
This article does not contain any studies with animals performed by any of the authors.
Informed consent
Informed consent was obtained from all individual participants included in the study.
Additional information
Communicated by B. B. Gupta.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Peng, X., Xia, X., Zhu, R. et al. A comparative performance analysis of evolutionary algorithms on \({\varvec{k}}\)-median and facility location problems. Soft Comput 22, 7787–7796 (2018). https://doi.org/10.1007/s00500-018-3462-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-018-3462-9