{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T05:22:23Z","timestamp":1769923343189,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"31","license":[{"start":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T00:00:00Z","timestamp":1693353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T00:00:00Z","timestamp":1693353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s00521-023-08853-x","type":"journal-article","created":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T07:02:11Z","timestamp":1693378931000},"page":"23177-23197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A discrete heuristic algorithm with swarm and evolutionary features for data replication problem in distributed systems"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5202-6315","authenticated-orcid":false,"given":"Bahman","family":"Arasteh","sequence":"first","affiliation":[]},{"given":"Tofigh","family":"Allahviranloo","sequence":"additional","affiliation":[]},{"given":"Peri","family":"Funes","sequence":"additional","affiliation":[]},{"given":"Mahsa","family":"Torkamanian-Afshar","sequence":"additional","affiliation":[]},{"given":"Manju","family":"Khari","sequence":"additional","affiliation":[]},{"given":"Muammer","family":"Catak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,30]]},"reference":[{"key":"8853_CR1","doi-asserted-by":"publisher","first-page":"103017","DOI":"10.1016\/j.jnca.2021.103017","volume":"180","author":"C Li","year":"2021","unstructured":"Li C, Liu J, Lu B, Luo Y (2021) Cost-aware automatic scaling and workload-aware replica management for edge-cloud environment. J Netw Comput Appl 180:103017. https:\/\/doi.org\/10.1016\/j.jnca.2021.103017","journal-title":"J Netw Comput Appl"},{"key":"8853_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comcom.2019.07.013","volume":"146","author":"C Li","year":"2019","unstructured":"Li C, Wang Y, Tang H, Zhang Y, Xin Y, Luo Y (2019) Flexible replica placement for enhancing the availability in edge computing environment. Comput Commun 146:1\u201314. https:\/\/doi.org\/10.1016\/j.comcom.2019.07.013","journal-title":"Comput Commun"},{"key":"8853_CR3","unstructured":"Qiu L, Padmanabhan VN and Voelker GM (2001) On the placement of web server replicas. In: Twentieth annual joint conference of the IEEE computer and communications societies. Proceedings. IEEE, pp 1587\u20131596"},{"key":"8853_CR4","doi-asserted-by":"crossref","unstructured":"Golin B, Li M, Italiano F, Deng X, Sohraby K (1999) On the optimal placement of web proxies in the internet. In: Eighteenth annual joint conference of the IEEE computer and communications societies. Proceedings. IEEE, pp 1282\u20131290","DOI":"10.1109\/INFCOM.1999.752146"},{"key":"8853_CR5","unstructured":"Ng TSE and Zhang H (2002) Predicting internet network distance with coordinates-based approaches. In: Twenty-first annual joint conference of the IEEE computer and communications societies. Proceedings. IEEE, pp 170\u2013179"},{"key":"8853_CR6","doi-asserted-by":"crossref","unstructured":"Szymaniak M, Pierre G, Van Steen M (2005) Latency-driven replica placement. In: Applications and the internet, proceedings, pp 399\u2013405","DOI":"10.1109\/SAINT.2005.37"},{"key":"8853_CR7","doi-asserted-by":"crossref","unstructured":"Safaee S and Haghighat AT (2012) Replica placement using genetic algorithm.In: Innovation management and technology research (ICIMTR), international conference on, pp 507\u2013512","DOI":"10.1109\/ICIMTR.2012.6236448"},{"issue":"12","key":"8853_CR8","doi-asserted-by":"publisher","first-page":"2975","DOI":"10.1109\/tc.2013.183","volume":"63","author":"JH Abawajy","year":"2014","unstructured":"Abawajy JH, Deris MM (2014) Data replication approach with consistency guarantee for data grid. IEEE Trans Comput 63(12):2975\u20132987. https:\/\/doi.org\/10.1109\/tc.2013.183","journal-title":"IEEE Trans Comput"},{"key":"8853_CR9","doi-asserted-by":"crossref","unstructured":"Shamsa Z and Dehghan M (2013) Placement of replica in distributed system using swarm optimization algorithm and its fuzzy generalization. In: 13th International conference on fuzzy system (IFSC), pp 1\u20136","DOI":"10.1109\/IFSC.2013.6675641"},{"issue":"1","key":"8853_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s00291-013-0358-z","volume":"37","author":"R Kolisch","year":"2014","unstructured":"Kolisch R, Dahlmann A (2014) The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic. OR Spectr 37(1):217\u2013242. https:\/\/doi.org\/10.1007\/s00291-013-0358-z","journal-title":"OR Spectr"},{"issue":"2","key":"8853_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1080\/03052150500384759","volume":"38","author":"M Eusuff","year":"2006","unstructured":"Eusuff M, Lansey K, Pasha F (2006) Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Eng Optim 38(2):129\u2013154. https:\/\/doi.org\/10.1080\/03052150500384759","journal-title":"Eng Optim"},{"key":"8853_CR12","doi-asserted-by":"publisher","DOI":"10.1002\/smr.2228","author":"A Ghaemi","year":"2019","unstructured":"Ghaemi A, Arasteh B (2019) SFLA-based heuristic method to generate software structural test data. J Softw Evol Process. https:\/\/doi.org\/10.1002\/smr.2228","journal-title":"J Softw Evol Process"},{"issue":"2","key":"8853_CR13","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10836-014-5438-8","volume":"30","author":"B Arasteh","year":"2014","unstructured":"Arasteh B, Miremadi SG, Rahmani AM (2014) Developing inherently resilient software against soft-errors based on algorithm level inherent features. J Electron Test 30(2):193\u2013212. https:\/\/doi.org\/10.1007\/s10836-014-5438-8","journal-title":"J Electron Test"},{"issue":"4","key":"8853_CR14","doi-asserted-by":"publisher","first-page":"449","DOI":"10.3233\/idt-200070","volume":"14","author":"B Arasteh","year":"2021","unstructured":"Arasteh B, Sadegi R, Arasteh K (2021) ARAZ: a software modules clustering method using the combination of particle swarm optimization and genetic algorithms. Intell Decis Technol 14(4):449\u2013462. https:\/\/doi.org\/10.3233\/idt-200070","journal-title":"Intell Decis Technol"},{"issue":"9","key":"8853_CR15","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1007\/s00607-018-0592-y","volume":"100","author":"B Arasteh","year":"2018","unstructured":"Arasteh B, Najafi J (2018) Programming guidelines for improving software resiliency against soft errors without performance overhead. Computing 100(9):971\u20131003. https:\/\/doi.org\/10.1007\/s00607-018-0592-y","journal-title":"Computing"},{"key":"8853_CR16","doi-asserted-by":"publisher","DOI":"10.1002\/smr.2408","author":"B Arasteh","year":"2021","unstructured":"Arasteh B, Fatolahzadeh A, Kiani F (2021) Savalan: multi objective and homogeneous method for software modules clustering. J Softw Evol Process. https:\/\/doi.org\/10.1002\/smr.2408","journal-title":"J Softw Evol Process"},{"key":"8853_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-022-07781-6","author":"B Arasteh","year":"2022","unstructured":"Arasteh B (2022) Clustered design-model generation from a program source code using chaos-based metaheuristic algorithms. Neural Comput Appl. https:\/\/doi.org\/10.1007\/s00521-022-07781-6","journal-title":"Neural Comput Appl"},{"key":"8853_CR18","doi-asserted-by":"publisher","first-page":"103252","DOI":"10.1016\/j.advengsoft.2022.103252","volume":"173","author":"B Arasteh","year":"2022","unstructured":"Arasteh B, Abdi M, Bouyer A (2022) Program source code comprehension by module clustering using combination of discretized gray wolf and genetic algorithms. Adv Eng Softw 173:103252. https:\/\/doi.org\/10.1016\/j.advengsoft.2022.103252","journal-title":"Adv Eng Softw"},{"key":"8853_CR19","unstructured":"Bouyer A, Arasteh B, Movaghar A (2007) A new hybrid model using case-based reasoning and decision tree methods for improving speedup and accuracy. In: IADIS international conference of applied computing, pp 20\u201328"},{"issue":"9","key":"8853_CR20","doi-asserted-by":"publisher","first-page":"6786","DOI":"10.1007\/s11227-019-03112-0","volume":"76","author":"E Hatami","year":"2019","unstructured":"Hatami E, Arasteh B (2019) An efficient and stable method to cluster software modules using ant colony optimization algorithm. J Supercomput 76(9):6786\u20136808. https:\/\/doi.org\/10.1007\/s11227-019-03112-0","journal-title":"J Supercomput"},{"key":"8853_CR21","doi-asserted-by":"publisher","DOI":"10.5815\/ijcnis.2017.05.03","author":"A Keshtgar","year":"2017","unstructured":"Keshtgar A, Arasteh B (2017) Enhancing software reliability against soft-error using minimum redundancy on critical data. J Comput Netw Inf Secur. https:\/\/doi.org\/10.5815\/ijcnis.2017.05.03","journal-title":"J Comput Netw Inf Secur"},{"key":"8853_CR22","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.sbspro.2011.11.037","volume":"28","author":"M Zadahmad","year":"2011","unstructured":"Zadahmad M, Arasteh B, YousefzadehFard P (2011) A pattern-oriented and web-based architecture to support mobile learning software development. Procedia Soc Behav Sci 28:194\u2013199. https:\/\/doi.org\/10.1016\/j.sbspro.2011.11.037","journal-title":"Procedia Soc Behav Sci"},{"issue":"1","key":"8853_CR23","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1080\/00207721.2022.2153635","volume":"54","author":"H Chen","year":"2022","unstructured":"Chen H, Li C, Mafarja M, Heidari AA, Chen Y, Cai Z (2022) Slime mould algorithm: a comprehensive review of recent variants and applications. Int J Syst Sci 54(1):204\u2013235. https:\/\/doi.org\/10.1080\/00207721.2022.2153635","journal-title":"Int J Syst Sci"},{"issue":"14","key":"8853_CR24","doi-asserted-by":"publisher","first-page":"3095","DOI":"10.1080\/00207721.2022.2070793","volume":"53","author":"HC Wu","year":"2022","unstructured":"Wu HC (2022) Solving multiobjective optimization problems using genetic algorithms and solutions concepts of cooperative games. Int J Syst Sci 53(14):3095\u20133111. https:\/\/doi.org\/10.1080\/00207721.2022.2070793","journal-title":"Int J Syst Sci"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-08853-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-023-08853-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-08853-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T18:06:58Z","timestamp":1697566018000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-023-08853-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,30]]},"references-count":24,"journal-issue":{"issue":"31","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["8853"],"URL":"https:\/\/doi.org\/10.1007\/s00521-023-08853-x","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,30]]},"assertion":[{"value":"9 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors state that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"All authors state that this study is the authors\u2019 original work, which has not been previously published elsewhere. The paper is not currently being considered for publication elsewhere. The paper reflects the author\u2019s own research and analysis truthfully and completely.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}