{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T20:54:18Z","timestamp":1765486458483,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,6,15]],"date-time":"2020-06-15T00:00:00Z","timestamp":1592179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,15]],"date-time":"2020-06-15T00:00:00Z","timestamp":1592179200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s11036-020-01565-9","type":"journal-article","created":{"date-parts":[[2020,6,15]],"date-time":"2020-06-15T08:02:52Z","timestamp":1592208172000},"page":"1805-1815","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Dynamic Weighted Fog Computing Device Placement Using a Bat-Inspired Algorithm with Dynamic Local Search Selection"],"prefix":"10.1007","volume":"25","author":[{"given":"Chun-Cheng","family":"Lin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8410-164X","authenticated-orcid":false,"given":"Der-Jiunn","family":"Deng","sequence":"additional","affiliation":[]},{"given":"Sirirat","family":"Suwatcharachaitiwong","sequence":"additional","affiliation":[]},{"given":"Yan-Sing","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,15]]},"reference":[{"issue":"10","key":"1565_CR1","doi-asserted-by":"publisher","first-page":"4674","DOI":"10.1109\/TII.2018.2855198","volume":"14","author":"M Aazam","year":"2018","unstructured":"Aazam M, Zeadally S, Harras K (2018) Deploying fog computing in industrial internet of things and industry 4.0. IEEE Trans. Ind. Inf. 14(10):4674\u20134682","journal-title":"IEEE Trans. Ind. Inf."},{"issue":"3","key":"1565_CR2","doi-asserted-by":"publisher","first-page":"1826","DOI":"10.1109\/COMST.2018.2814571","volume":"20","author":"M Mukherjee","year":"2018","unstructured":"Mukherjee M, Shu L, Wang D (2018) Survey of fog computing: fundamental, network applications, and research challenges. IEEE Commun. Surv. Tutorials 20(3):1826\u20131857","journal-title":"IEEE Commun. Surv. Tutorials"},{"key":"1565_CR3","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.future.2018.04.057","volume":"87","author":"M Aazam","year":"2018","unstructured":"Aazam M, Zeadally S, Harras K (2018) Offloading in fog computing for IoT: review, enabling technologies, and research opportunities. Futur Gener Comput Syst 87:278\u2013289","journal-title":"Futur Gener Comput Syst"},{"issue":"10","key":"1565_CR4","doi-asserted-by":"publisher","first-page":"4603","DOI":"10.1109\/TII.2018.2827920","volume":"14","author":"C Lin","year":"2018","unstructured":"Lin C, Yang J (2018) Cost-efficient deployment of fog computing systems at logistics centers in industry 4.0. IEEE Trans. Ind. Inf. 14(10):4603\u20134611","journal-title":"IEEE Trans. Ind. Inf."},{"key":"1565_CR5","first-page":"652","volume-title":"Fog server deployment considering network topology and flow state in local area networks. In: Proc. Conf. Ubiquitous and Future Networks","author":"J Lee","year":"2017","unstructured":"Lee J, Chung S, Kim W (2017) Fog server deployment considering network topology and flow state in local area networks. In: Proc. Conf. Ubiquitous and Future Networks, pp 652\u2013657"},{"issue":"1","key":"1565_CR6","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1109\/TETC.2015.2508382","volume":"5","author":"L Gu","year":"2017","unstructured":"Gu L, Zeng D, Guo S, Barnawi A, Xiang Y (2017) Cost-efficient resource management in fog computing supported medical CPS. IEEE Trans Emerg Top Comput 5(1):108\u2013119","journal-title":"IEEE Trans Emerg Top Comput"},{"key":"1565_CR7","first-page":"2058","volume-title":"Proc. IEEE Trustcom\/BigDataSE\/I SPA","author":"P Guo","year":"2016","unstructured":"Guo P, Lin B, Li X, He R, Li S (2016) optimal deployment and dimensioning of fog computing supported vehicular network. In: Proc. IEEE Trustcom\/BigDataSE\/I SPA, pp 2058\u20132062"},{"issue":"10","key":"1565_CR8","doi-asserted-by":"publisher","first-page":"2866","DOI":"10.1109\/TPDS.2015.2510638","volume":"27","author":"Z Xu","year":"2016","unstructured":"Xu Z, Liang W, Xu W, Jia M, Guo S (2016) Efficient algorithms for capacitated cloudlet placements. IEEE Trans Parallel Distrib Syst 27(10):2866\u20132880","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"10","key":"1565_CR9","doi-asserted-by":"publisher","first-page":"2120","DOI":"10.1109\/LCOMM.2018.2861766","volume":"22","author":"C Ng","year":"2018","unstructured":"Ng C, Wu C, Ip W, Yung K (2018) A smart bat algorithm for wireless sensor network deployment in 3-D environment. IEEE Commun Lett 22(10):2120\u20132123","journal-title":"IEEE Commun Lett"},{"key":"1565_CR10","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.ins.2012.12.023","volume":"232","author":"CC Lin","year":"2013","unstructured":"Lin CC (2013) Dynamic router node placement in wireless mesh networks: a PSO approach with constriction coefficient and its convergence analysis. Inf Sci 232:294\u2013308","journal-title":"Inf Sci"},{"issue":"1","key":"1565_CR11","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/S0377-2217(00)00087-4","volume":"128","author":"PJ Zwaneveld","year":"2001","unstructured":"Zwaneveld PJ, Kroon LG, van Hoesel SPM (2001) Routing trains through a railway station based on a node packing model. Eur J Oper Res 128(1):14\u201333","journal-title":"Eur J Oper Res"},{"issue":"6","key":"1565_CR12","doi-asserted-by":"publisher","first-page":"1398","DOI":"10.1137\/S0097539702419650","volume":"34","author":"S Pettie","year":"2005","unstructured":"Pettie S, Ramachandran V (2005) A shortest path algorithm for real-weighted undirected graphs. SIAM J Comput 34(6):1398\u20131431","journal-title":"SIAM J Comput"},{"key":"1565_CR13","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.tcs.2017.02.007","volume":"674","author":"W Ding","year":"2017","unstructured":"Ding W, Qiu K (2017) Incremental single-source shortest paths in digraphs with arbitrary positive arc weights. Theor Comput Sci 674:16\u201331","journal-title":"Theor Comput Sci"},{"issue":"1","key":"1565_CR14","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/net.21464","volume":"61","author":"B \u00c1brego","year":"2012","unstructured":"\u00c1brego B et al (2012) Proximity graphs inside large weighted graphs. Networks 61(1):29\u201339","journal-title":"Networks"},{"key":"1565_CR15","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1145\/3167132.3167217","volume-title":"Proc. of the ACM Symposium on Applied Computing","author":"MI Naas","year":"2018","unstructured":"Naas MI, Lemarchand L, Boukhobza J, Raipin P (2018) A graph partitioning-based heuristic for runtime IoT data placement strategies in a fog infrastructure. In: Proc. of the ACM Symposium on Applied Computing, pp 767\u2013774"},{"issue":"11","key":"1565_CR16","doi-asserted-by":"publisher","first-page":"2127","DOI":"10.1109\/JSAC.2006.881606","volume":"24","author":"B Aoun","year":"2006","unstructured":"Aoun B, Kenward G, Boutaba R, Iraqi Y (2006) Gateway placement optimization in wireless mesh networks with QoS constraints. IEEE J. Sel. Areas Commun. 24(11):2127\u20132136","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"3","key":"1565_CR17","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1094549.1094554","volume":"9","author":"A Mishra","year":"2005","unstructured":"Mishra A, Banerjee S, Arbaugh WA (2005) Weighted coloring based channel assignment for WLANs. ACM SIGMOBILE Mobile Computing and Communications Review 9(3):19\u201331","journal-title":"ACM SIGMOBILE Mobile Computing and Communications Review"},{"key":"1565_CR18","volume-title":"Computers and intractability - a guide to the theory of NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey M, Johnson D (1979) Computers and intractability - a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"1565_CR19","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-12538-6_6","volume-title":"Proc. of Nature Inspired Cooperative Strategies for Optimization (NICSO 2010), vol. 284 of studies in computational intelligence","author":"XS Yang","year":"2010","unstructured":"Yang XS (2010) A new metaheuristic bat-inspired algorithm. In: Proc. of Nature Inspired Cooperative Strategies for Optimization (NICSO 2010), vol. 284 of studies in computational intelligence, pp 65\u201374"},{"issue":"6","key":"1565_CR20","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1007\/s00521-012-1028-9","volume":"22","author":"AH Gandomi","year":"2012","unstructured":"Gandomi AH, Yang XS, Alavi AH, Talatahari S (2012) Bat algorithm for constrained optimization tasks. Neural Comput Applic 22(6):1239\u20131255","journal-title":"Neural Comput Applic"},{"issue":"1","key":"1565_CR21","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.asoc.2009.11.024","volume":"11","author":"C Soza","year":"2011","unstructured":"Soza C, Becerra RL, Riff MC, Coello CA (2011) Solving timetabling problems using a cultural algorithm. Appl Soft Comput 11(1):337\u2013344","journal-title":"Appl Soft Comput"},{"issue":"4","key":"1565_CR22","doi-asserted-by":"publisher","first-page":"1402","DOI":"10.1109\/JSYST.2014.2341033","volume":"10","author":"CC Lin","year":"2014","unstructured":"Lin CC, Shu L (2014) Deng DJ (2014) router node placement with service priority in wireless mesh networks using simulated annealing with momentum terms. IEEE Syst J 10(4):1402\u20131411","journal-title":"IEEE Syst J"},{"issue":"3","key":"1565_CR23","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1109\/JSYST.2012.2223071","volume":"8","author":"G Parker","year":"2014","unstructured":"Parker G, Zbeda R (2014) Learning area coverage for a self-sufficient hexapod robot using a cyclic genetic algorithm. IEEE Syst J 8(3):778\u2013790","journal-title":"IEEE Syst J"},{"issue":"5","key":"1565_CR24","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1504\/IJBIC.2011.042259","volume":"3","author":"XS Yang","year":"2011","unstructured":"Yang XS (2011) Bat algorithm for multi-objective optimization. International Journal of Bio-Inspired Computation 3(5):267\u2013274","journal-title":"International Journal of Bio-Inspired Computation"},{"issue":"10","key":"1565_CR25","doi-asserted-by":"publisher","first-page":"4497","DOI":"10.1109\/TII.2018.2791619","volume":"14","author":"S Mishra","year":"2018","unstructured":"Mishra S, Puthal D, Rodrigues J, Sahoo B, Dutkiewicz E (2018) Sustainable service allocation using a metaheuristic technique in a fog server for industrial applications. IEEE Trans. Ind. Inf. 14(10):4497\u20134506","journal-title":"IEEE Trans. Ind. Inf."},{"key":"1565_CR26","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.future.2018.02.043","volume":"87","author":"M Zineddine","year":"2018","unstructured":"Zineddine M (2018) Optimizing security and quality of service in a real-time operating system using multi-objective bat algorithm. Futur Gener Comput Syst 87:102\u2013114","journal-title":"Futur Gener Comput Syst"},{"key":"1565_CR27","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.asoc.2014.11.029","volume":"28","author":"S Y\u0131lmaz","year":"2015","unstructured":"Y\u0131lmaz S, K\u00fc\u00e7\u00fcksille E (2015) A new modification approach on bat algorithm for solving optimization problems. Appl Soft Comput 28:259\u2013275","journal-title":"Appl Soft Comput"},{"key":"1565_CR28","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.ast.2015.11.040","volume":"49","author":"G Wang","year":"2016","unstructured":"Wang G, Chu H, Mirjalili S (2016) Three-dimensional path planning for UCAV using an improved bat algorithm. Aerosp Sci Technol 49:231\u2013238","journal-title":"Aerosp Sci Technol"},{"issue":"5","key":"1565_CR29","doi-asserted-by":"publisher","first-page":"5052","DOI":"10.1109\/TPWRS.2018.2812711","volume":"33","author":"H Liang","year":"2018","unstructured":"Liang H, Liu Y, Shen Y, Li F, Man Y (2018) A hybrid bat algorithm for economic dispatch with random wind power. IEEE Trans Power Syst 33(5):5052\u20135061","journal-title":"IEEE Trans Power Syst"},{"key":"1565_CR30","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.swevo.2018.04.001","volume":"44","author":"E Osaba","year":"2019","unstructured":"Osaba E, Yang XS, Fister I Jr, del Ser J, Lopez-Garcia P, Vazquez-Pardavila AJ (2019) A discrete and improved bat algorithm for solving a medical goods distribution problem with pharmacological waste collection. Swarm and Evolutionary Computation 44:273\u2013286","journal-title":"Swarm and Evolutionary Computation"},{"key":"1565_CR31","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.petrol.2018.09.031","volume":"172","author":"M Naderi","year":"2019","unstructured":"Naderi M, Khamehchi E, Karimi B (2019) Novel statistical forecasting models for crude oil price, gas price, and interest rate based on meta-heuristic bat algorithm. J Pet Sci Eng 172:13\u201322","journal-title":"J Pet Sci Eng"},{"issue":"3","key":"1565_CR32","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1109\/JSYST.2013.2260626","volume":"8","author":"S Li","year":"2014","unstructured":"Li S, Zhao S, Wang X, Zhang K, Li L (2014) Adaptive and secure load-balancing routing protocol for service-oriented wireless sensor networks. IEEE Syst J 8(3):858\u2013867","journal-title":"IEEE Syst J"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-020-01565-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11036-020-01565-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-020-01565-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,14]],"date-time":"2021-06-14T23:11:13Z","timestamp":1623712273000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11036-020-01565-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,15]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["1565"],"URL":"https:\/\/doi.org\/10.1007\/s11036-020-01565-9","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"type":"print","value":"1383-469X"},{"type":"electronic","value":"1572-8153"}],"subject":[],"published":{"date-parts":[[2020,6,15]]},"assertion":[{"value":"15 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}