Abstract
The maximal covering location problem refers to the problem of finding an optimal placement of given number of facilities to a network. The objective is to maximize the total demands of the covered population within some constraints. Several metaheuristic approaches were proposed to solve the problem as it is an NP hard problem. In this article, we have proposed a chemical reaction optimization (CRO)-based approach to solve MCLP. CRO is a metaheuristic based on population to solve optimization problems. We are proposing a method to solve MCLP by redesigning four fundamental operators of CRO. Sometimes the solutions get trapped into local maxima, so an additional repair operator is also designed to find optimal solutions. The proposed algorithm is tested for both small and large scales of instances of datasets, which include benchmark as well as random ones. The proposed method gives best percentage of coverage results in 91.60% of instances, and for the remaining 8.40% of instances it produces results with average error value 0.10% which is very close to the optimal value. Nevertheless, the proposed method performs very well in terms of computational time for all test instances (100%) on all datasets compared to state-of-the-art method (Atta_GA). Wilcoxon signed-rank test has been performed on the results of the proposed method to observe the statistical significance. For both real-world and random instances, the results of the statistical test are significant.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data availability
The data generated and analyzed during the study are included.
References
Al-Janabi S, Alkaim A (2022) A novel optimization algorithm (Lion-AYAD) to find optimal DNA protein synthesis. Egypt Inform J 23(2):271–290. https://doi.org/10.1016/j.eij.2022.01.004
Atta S, Mahapatra PRS, Mukhopadhyay A (2018) Solving maximal covering location problem using genetic algorithm with local refinement. Soft Comput 22:3891–3906. https://doi.org/10.1007/s00500-017-2598-3
Bagherinejad J, Bashiri M, Nikzad H (2018) General form of a cooperative gradual maximal covering location problem. J Indust Eng Int 14:241–253. https://doi.org/10.1007/s40092-017-0219-5
Bargaoui H, Driss OB, Ghédira K (2017) A novel chemical reaction optimization for the distributed permutation flowshop scheduling problem with makespan criterion. Comput Indust Eng 111:239–250. https://doi.org/10.1016/j.cie.2017.07.020
Barham R, Sharieh A, Sliet A (2016) Chemical reaction optimization for max flow problem. IJACSA Int J Adv Comput Sci Appl 7(8):189–196
Berman O, Krass D (2002) The generalized maximal covering location problem. Comput Oper Res 29(6):563–581. https://doi.org/10.1016/S0305-0548(01)00079-X
Bhoi NK, Singh H, Pratap S, Jain PK (2022) Chemical reaction optimization algorithm for machining parameter of abrasive water jet cutting. OPSEARCH 59:350–363. https://doi.org/10.1007/s12597-021-00547-z
Crama Y, Schyns M (2003) Simulated annealing for complex portfolio selection problems. Eur J Oper Res 150(3):546–571. https://doi.org/10.1016/S0377-2217(02)00784-1
Davari S, Zarandi MHF, Hemmati A (2011) Maximal covering location problem (MCLP) with fuzzy travel times. Expert Syst Appl 38(12):14535–14541. https://doi.org/10.1016/j.eswa.2011.05.031
Hajipour V, Fattahi P, Bagheri H et al (2022) Dynamic maximal covering location problem for fire stations under uncertainty: soft-computing approaches. Int J Syst Assur Eng Manag 13:90–112. https://doi.org/10.1007/s13198-021-01109-8
Islam MR, Saifullah CMK, Asha ZT, Ahamed R (2019) Chemical reaction optimization for solving longest common subsequence problem for multiple string. Soft Comput 23:5485–5509. https://doi.org/10.1007/s00500-018-3200-3
Islam MR, Smrity RA, Chatterjee S, Mahmud MR (2020) Optimization of protein folding using chemical reaction optimization in HP cubic lattice model. Neural Comput Appl 32:3117–3134. https://doi.org/10.1007/s00521-019-04447-8
Islam MR, Protik P, Das S, Boni PK (2021) Mobile robot path planning with obstacle avoidance using chemical reaction optimization. Soft Comput 25:6283–6310. https://doi.org/10.1007/s00500-021-05615-6
Islam MR, Islam MS, Sakeef N (2021) RNA secondary structure prediction with pseudoknots using chemical reaction optimization algorithm. IEEE/ACM Trans Comput Biol Bioinform 18(3):1195–1207. https://doi.org/10.1109/TCBB.2019.2936570
Janabi SA, Alkaim A, Taleby GA (2023) Triple steps for verifying chemical reaction based on deep whale optimization algorithm (VCR-WOA). Recurrent neural networks. CRC Press, Boca Raton, pp. 183–201. https://doi.org/10.1201/9781003307822-14
Jin Xu, Lam Albert Y.S., Li Victor O.K (2011) Chemical reaction optimization for task scheduling in grid computing. IEEE Trans Parallel Distrib Syst 22(10):1624–1631. https://doi.org/10.1109/TPDS.2011.35
Kabir R, Islam R (2019) Chemical reaction optimization for RNA structure prediction. Appl Intell 49(2):352–375. https://doi.org/10.1007/s10489-018-1281-4
Kadhuim ZA, Janabi SA (2023) Codon-mRNA prediction using deep optimal neurocomputing technique (DLSTM-DSN-WOA) and multivariate analysis. Results Eng 17:100847. https://doi.org/10.1016/j.rineng.2022.100847
Lam AYS, Li VOK (2012) Chemical reaction optimization: a tutorial. Math Comput Modell 4(1):3–17. https://doi.org/10.1007/s12293-012-0075-1
Li JQ, Pan QK (2012) Chemical-reaction optimization for flexible job-shop scheduling problems with maintenance activity. Appl Soft Comput 12(9):2896–2912. https://doi.org/10.1016/j.asoc.2012.04.012
Li H, Mukhopadhyay SK, Wu J, Zhou L, Du Z (2020) Balanced maximal covering location problem and its application in bike-sharing. Int J Prod Econ 223:107513. https://doi.org/10.1016/j.ijpe.2019.09.034
Lorena LAN, Pereira MA (2002) A Lagrangean/surrogate heuristic for the maximal covering location problem using Hillman’s edition. Int J Indust Eng 9(1):57–67
Mahmud MR, Pritom RM, Islam MR (2017) Optimization of collaborative transportation scheduling in supply chain management with TPL using chemical reaction optimization. 2017 20th international conference of computer and information technology (ICCIT), Dhaka, pp 1–6. https://doi.org/10.1109/ICCITECHN.2017.8281767
Máximo VR, Nascimento MCV, Carvalho AC (2017) Intelligent-guided adaptive search for the maximum covering location problem. Comput Oper Res 78:129–137. https://doi.org/10.1016/j.cor.2016.08.018
Megiddo N, Zemel E, Hakimi SL (1983) The maximum coverage location problem. SIAM J Algebr Discret Methods 4(2):253–261. https://doi.org/10.1137/0604028
Saha SK, Islam MR, Hasan M (2020) DNA motif discovery using chemical reaction optimization. Evol Intell. https://doi.org/10.1007/s12065-020-00444-2
Saifullah CMK, Islam MR (2016) Solving shortest common supersequence problem using chemical reaction optimization. 2016 5th international conference on informatics, electronics and vision (ICIEV), Dhaka, pp 50–55. https://doi.org/10.1109/ICIEV.2016.7760187
Salman S, Alaswad S (2022) Designing reduced congestion road networks via an elitist adaptive chemical reaction optimization. Comput Indust Eng 163:107788. https://doi.org/10.1016/j.cie.2021.107788
Syah R, Guerrero JWG, Poltarykhin AL, Suksatan W et al (2023) Developed teamwork optimizer for model parameter estimation of the proton exchange membrane fuel cell. Energy Rep 8:10776–10785. https://doi.org/10.1016/j.egyr.2022.08.177
Truong TK, Li K, Xu Y (2013) Chemical reaction optimization with greedy strategy for the 0–1 knapsack problem. Appl Soft Comput 13(4):1774–1780. https://doi.org/10.1016/j.asoc.2012.11.048
Xu J, Lam AYS, Li VOK (2010) Parallel chemical reaction optimization for the quadratic assignment problem. The 2010 world congress in computer science, computer engineering, and applied computing (Worldcomp 2010), Las Vegas, NV, pp. 12-15 July 2010. In Conference proceedings, 2010
Zain AM, Yousif A (2020) Chemical reaction optimization (CRO) for cloud job scheduling. SN Appl Sci 2(1):23. https://doi.org/10.1007/s42452-019-1758-8
Zarandi MHF, Davari S, Sisakht SAH (2011) The large scale maximal covering location problem. Sci Iran 18(6):1564–1570. https://doi.org/10.1016/j.scient.2011.11.008
Zarandi MHF, Davari S, Sisakht SAH (2013) The large-scale dynamic maximal covering location problem. Math Comput Modell 57(13):710–719
Funding
The authors (authors including corresponding author) declare that they have no funding for this work.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Ethical approval
This article does not contain any studies with human participants or animals performed by any of the authors.
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Islam, M.S., Islam, M.R. A solution method to maximal covering location problem based on chemical reaction optimization (CRO) algorithm. Soft Comput 27, 7337–7361 (2023). https://doi.org/10.1007/s00500-023-07972-w
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-023-07972-w