{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T22:42:52Z","timestamp":1781736172110,"version":"3.54.5"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,9,11]],"date-time":"2023-09-11T00:00:00Z","timestamp":1694390400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,11]],"date-time":"2023-09-11T00:00:00Z","timestamp":1694390400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Science and Technology Project of Jiangxi Provincial Department of Education","award":["GJJ211816"],"award-info":[{"award-number":["GJJ211816"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s11227-023-05571-y","type":"journal-article","created":{"date-parts":[[2023,9,11]],"date-time":"2023-09-11T10:02:10Z","timestamp":1694426530000},"page":"4248-4285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["An optimized resource scheduling algorithm based on GA and ACO algorithm in fog computing"],"prefix":"10.1007","volume":"80","author":[{"given":"Chao","family":"Yin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qin","family":"Fang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongyi","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yingjian","family":"Peng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaogang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dan","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,9,11]]},"reference":[{"key":"5571_CR1","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/ACCESS.2014.2332453","volume":"2","author":"H Hu","year":"2014","unstructured":"Hu H, Wen Y, Chua T, Li X (2014) Toward scalable systems for big data analytics: a technology tutorial. IEEE Access 2:652\u2013687","journal-title":"IEEE Access"},{"key":"5571_CR2","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1109\/ACCESS.2016.2529723","volume":"4","author":"Y Sun","year":"2016","unstructured":"Sun Y, Song H, Jara AJ, Bie R (2016) Internet of things and big data analytics for smart and connected communities. IEEE Access 4:766\u2013773","journal-title":"IEEE Access"},{"key":"5571_CR3","doi-asserted-by":"crossref","unstructured":"Sumi L, Ranga V (2016) Sensor enabled internet of things for smart cities. In: 2016 Fourth International Conference on Parallel, Distributed and Grid Computing (PDGC), pp. 295\u2013300","DOI":"10.1109\/PDGC.2016.7913163"},{"key":"5571_CR4","doi-asserted-by":"crossref","unstructured":"Yu\u00a0L, Cai\u00a0Z (2016) Dynamic scaling of virtual clusters with bandwidth guarantee in cloud datacenters. In: IEEE INFOCOM 2016-The 35th annual IEEE International Conference on Computer Communications, pp. 1\u20139","DOI":"10.1109\/INFOCOM.2016.7524355"},{"key":"5571_CR5","doi-asserted-by":"crossref","unstructured":"Zhao TC, Zhou S, Guo XY, Niu ZS (2017) Tasks scheduling and resource allocation in heterogeneous cloud for delay-bounded mobile edge computing. In: 2017 IEEE International Conference on Communications (ICC), pp 1\u20137","DOI":"10.1109\/ICC.2017.7996858"},{"key":"5571_CR6","first-page":"1","volume":"5","author":"W Lin","year":"2016","unstructured":"Lin W, Wu W, Wang JZ (2016) A heuristic task scheduling algorithm for heterogeneous virtual clusters. Sci Program 5:1\u201310","journal-title":"Sci Program"},{"issue":"4","key":"5571_CR7","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/1721654.1721672","volume":"53","author":"M Armbrust","year":"2010","unstructured":"Armbrust M, Fox A, Griffith R, Joseph AD, Katz R, Konwinski A, Lee G, Patterson D, Rabkin A, Stoica I, Zaharia M (2010) A view of cloud computing. Commun ACM 53(4):50\u201358","journal-title":"Commun ACM"},{"issue":"2","key":"5571_CR8","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1109\/TPDS.2017.2754366","volume":"29","author":"L Yu","year":"2018","unstructured":"Yu L, Shen H, Cai Z, Liu L, Pu C (2018) Towards bandwidth guarantee for virtual clusters under demand uncertainty in multi-tenant clouds. IEEE Trans Parallel Distrib Syst 29(2):450\u2013465","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"5571_CR9","first-page":"446","volume":"28","author":"L Yu","year":"2017","unstructured":"Yu L, Shen H, Sapra K, Ye L, Cai Z (2017) Core: cooperative end-to-end traffic redundancy elimination for reducing cloud bandwidth cost. IEEE Trans Parallel Distrib Syst 28(2):446\u2013461","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"5571_CR10","doi-asserted-by":"publisher","first-page":"19286","DOI":"10.1109\/ACCESS.2020.2968378","volume":"8","author":"Y Wan","year":"2020","unstructured":"Wan Y, Zuo T, Chen L, Tang W, Chen J (2020) Efficiency-oriented production scheduling scheme: an ant colony system method. IEEE Access 8:19286\u201319296","journal-title":"IEEE Access"},{"key":"5571_CR11","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.future.2019.05.052","volume":"100","author":"BN Silva","year":"2019","unstructured":"Silva BN, Han K (2019) Mutation operator integrated ant colony optimization based domestic appliance scheduling for lucrative demand side management. Futur Gener Comput Syst 100:557\u2013568","journal-title":"Futur Gener Comput Syst"},{"issue":"10","key":"5571_CR12","doi-asserted-by":"publisher","first-page":"4712","DOI":"10.1109\/TII.2018.2851241","volume":"14","author":"L Yin","year":"2018","unstructured":"Yin L, Luo J, Luo H (2018) Tasks scheduling and resource allocation in fog computing based on containers for smart manufacturing. IEEE Trans Ind Inf 14(10):4712\u20134721","journal-title":"IEEE Trans Ind Inf"},{"key":"5571_CR13","first-page":"1","volume":"12","author":"J Bisht","year":"2022","unstructured":"Bisht J, Vampugani VS (2022) Load and cost-aware min-min workflow scheduling algorithm for heterogeneous resources in fog, cloud, and edge scenarios. Int J Cloud Appl Comput (IJCAC) 12:1\u201320","journal-title":"Int J Cloud Appl Comput (IJCAC)"},{"issue":"8","key":"5571_CR14","doi-asserted-by":"publisher","first-page":"8252","DOI":"10.1007\/s11227-020-03606-2","volume":"77","author":"KL Devi","year":"2021","unstructured":"Devi KL, Valli S (2021) Multi-objective heuristics algorithm for dynamic resource scheduling in the cloud computing environment. J Supercomput 77(8):8252\u20138280","journal-title":"J Supercomput"},{"key":"5571_CR15","doi-asserted-by":"publisher","first-page":"325","DOI":"10.3390\/a14110325","volume":"14","author":"L Liu","year":"2021","unstructured":"Liu L, Yang X (2021) Travel time reliability-based rescue resource scheduling for accidents concerning transport of dangerous goods by rail. Algorithms 14:325","journal-title":"Algorithms"},{"key":"5571_CR16","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1049\/ntw2.12001","volume":"10","author":"K Loheswaran","year":"2021","unstructured":"Loheswaran K (2021) An upgraded fruit fly optimisation algorithm for solving task scheduling and resource management problem in cloud infrastructure. IET Netw. 10:24\u201333","journal-title":"IET Netw."},{"key":"5571_CR17","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1007\/s10586-021-03481-3","volume":"25","author":"AM Yadav","year":"2022","unstructured":"Yadav AM, Tripathi KN, Sharma SC (2022) An enhanced multi-objective fireworks algorithm for task scheduling in fog computing environment. Clust Comput 25:983\u2013998","journal-title":"Clust Comput"},{"key":"5571_CR18","doi-asserted-by":"crossref","unstructured":"Gu J, Mo J, Li B, Zhang Y, Wang W (2021) A multi-objective fog computing task scheduling strategy based on ant colony algorithm. In: 2021 IEEE 4th International Conference on Information Systems and Computer Aided Education (ICISCAE), pp. 12\u201316","DOI":"10.1109\/ICISCAE52414.2021.9590674"},{"key":"5571_CR19","first-page":"809","volume":"37","author":"J Ye","year":"2009","unstructured":"Ye J, Zhang Y, Ruan Y (2009) A new genetic algorithm based on improved crossover and self-identify high mutation operators. J Fuzhou Univ 37:809\u2013817","journal-title":"J Fuzhou Univ"},{"key":"5571_CR20","unstructured":"Xie Y, Xu Q, Jiang W (2014) Research on improved genetic algorithm based on crossover and mutation operator. Computer Technology and Development"},{"issue":"4","key":"5571_CR21","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/j.comnet.2004.12.001","volume":"47","author":"IF Akyildiz","year":"2005","unstructured":"Akyildiz IF, Wang X, Wang W (2005) Wireless mesh networks: a survey. Comput Netw 47(4):445\u2013487","journal-title":"Comput Netw"},{"key":"5571_CR22","doi-asserted-by":"publisher","first-page":"25645","DOI":"10.1109\/ACCESS.2022.3155767","volume":"10","author":"C Qian","year":"2022","unstructured":"Qian C, Fu C, Li H (2022) Route planning for chain restaurants with improved delivery mode using an adaptive genetic algorithm. IEEE Access 10:25645\u201325656","journal-title":"IEEE Access"},{"key":"5571_CR23","doi-asserted-by":"publisher","first-page":"1813","DOI":"10.3233\/JIFS-211214","volume":"42","author":"L Zhai","year":"2022","unstructured":"Zhai L, Feng S (2022) A novel evacuation path planning method based on improved genetic algorithm. J Intell Fuzzy Syst 42:1813\u20131823","journal-title":"J Intell Fuzzy Syst"},{"key":"5571_CR24","doi-asserted-by":"publisher","first-page":"150878","DOI":"10.1109\/ACCESS.2020.3016762","volume":"8","author":"S Liu","year":"2020","unstructured":"Liu S, Wang N (2020) Collaborative optimization scheduling of cloud service resources based on improved genetic algorithm. IEEE Access 8:150878\u2013150890","journal-title":"IEEE Access"},{"key":"5571_CR25","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.swevo.2019.04.008","volume":"48","author":"J Del Ser","year":"2019","unstructured":"Del Ser J, Osaba E, Molina D, Yang XS, Salcedo-Sanz S, Camacho D, Das S, Suganthan PN, Coello CA, Herrera F (2019) Bio-inspired computation: where we stand and what\u2019s next. Swarm Evol Comput 48:220\u2013250","journal-title":"Swarm Evol Comput"},{"key":"5571_CR26","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.swevo.2016.09.002","volume":"33","author":"P Rakshit","year":"2017","unstructured":"Rakshit P, Konar A, Das S (2017) Noisy evolutionary optimization algorithms\u2014a comprehensive survey. Swarm Evol Comput 33:18\u201345","journal-title":"Swarm Evol Comput"},{"key":"5571_CR27","doi-asserted-by":"crossref","unstructured":"Xie X, Wu P (2010) Research on the optimal combination of ACO parameters based on PSO. In: 2010 International Conference on Networking and Digital Society, vol 1. pp. 94\u201397","DOI":"10.1109\/ICNDS.2010.5479311"},{"key":"5571_CR28","doi-asserted-by":"publisher","first-page":"56317","DOI":"10.1109\/ACCESS.2019.2900029","volume":"7","author":"J Chen","year":"2019","unstructured":"Chen J, You X, Liu S, Li J (2019) Entropy-based dynamic heterogeneous ant colony optimization. IEEE Access 7:56317\u201356328","journal-title":"IEEE Access"},{"issue":"11","key":"5571_CR29","doi-asserted-by":"publisher","first-page":"5595","DOI":"10.1109\/TCYB.2020.2989309","volume":"51","author":"T Huang","year":"2021","unstructured":"Huang T, Lin W, Xiong C, Pan R, Huang J (2021) An ant colony optimization-based multiobjective service replicas placement strategy for fog computing. IEEE Trans Cybern 51(11):5595\u20135608","journal-title":"IEEE Trans Cybern"},{"key":"5571_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cogsys.2020.03.001","volume":"62","author":"J Li","year":"2020","unstructured":"Li J, Xia Y, Li B, Zeng Z (2020) A pseudo-dynamic search ant colony optimization algorithm with improved negative feedback mechanism. Cogn Syst Res 62:1\u20139","journal-title":"Cogn Syst Res"},{"key":"5571_CR31","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.future.2021.11.019","volume":"129","author":"J Peake","year":"2022","unstructured":"Peake J, Amos M, Costen N, Masala G, Lloyd H (2022) PACO-VMP: parallel ant colony optimization for virtual machine placement. Futur Gener Comput Syst 129:174\u2013186","journal-title":"Futur Gener Comput Syst"},{"key":"5571_CR32","doi-asserted-by":"publisher","first-page":"20281","DOI":"10.1109\/ACCESS.2019.2897580","volume":"7","author":"W Deng","year":"2019","unstructured":"Deng W, Xu J, Zhao H (2019) An improved ant colony optimization algorithm based on hybrid strategies for scheduling problem. IEEE Access 7:20281\u201320292","journal-title":"IEEE Access"},{"key":"5571_CR33","first-page":"1585","volume":"9","author":"L Tang","year":"2018","unstructured":"Tang L, Zhang X, Li Z, Zhang Y (2018) A new hybrid task scheduling algorithm designed based on ACO and GA. J Inf Hiding Multim Signal Process 9:1585\u20131594","journal-title":"J Inf Hiding Multim Signal Process"},{"key":"5571_CR34","doi-asserted-by":"publisher","first-page":"28322","DOI":"10.1109\/ACCESS.2021.3064831","volume":"10","author":"Q Jin","year":"2022","unstructured":"Jin Q, Tang C, Cai W (2022) Research on dynamic path planning based on the fusion algorithm of improved ant colony optimization and rolling window method. IEEE Access 10:28322\u201328332","journal-title":"IEEE Access"},{"key":"5571_CR35","doi-asserted-by":"publisher","first-page":"5773","DOI":"10.3233\/JIFS-212220","volume":"42","author":"L Zhai","year":"2022","unstructured":"Zhai L, Feng S (2022) An improved ant colony algorithm based on artificial potential field and quantum evolution theory. J Intell Fuzzy Syst 42:5773\u20135788","journal-title":"J Intell Fuzzy Syst"},{"key":"5571_CR36","doi-asserted-by":"publisher","first-page":"9102","DOI":"10.1007\/s11227-021-04262-w","volume":"78","author":"MVSS Nagendranth","year":"2022","unstructured":"Nagendranth MVSS, Khanna MR, Krishnaraj N, Sikkandar MY, Aboamer MA, Surendran R (2022) Type II fuzzy-based clustering with improved ant colony optimization-based routing (t2fcatr) protocol for secured data transmission in manet. J Supercomput 78:9102\u20139120","journal-title":"J Supercomput"},{"key":"5571_CR37","doi-asserted-by":"publisher","first-page":"104513","DOI":"10.1109\/ACCESS.2021.3094876","volume":"9","author":"Q Zhou","year":"2021","unstructured":"Zhou Q, Wang X, Zhou C (2021) DNA design based on improved ant colony optimization algorithm with bloch sphere. IEEE Access 9:104513\u2013104521","journal-title":"IEEE Access"},{"issue":"3","key":"5571_CR38","first-page":"508","volume":"24","author":"T Huang","year":"2020","unstructured":"Huang T, Gong YJ, Kwong S, Wang H, Zhang J (2020) A niching memetic algorithm for multi-solution traveling salesman problem. IEEE Trans Evol Comput 24(3):508\u2013522","journal-title":"IEEE Trans Evol Comput"},{"issue":"7","key":"5571_CR39","first-page":"2944","volume":"29","author":"YJ Gong","year":"2018","unstructured":"Gong YJ, Zhang J, Zhou YC (2018) Learning multimodal parameters: a bare-bones niching differential evolution approach. IEEE Trans Neural Netw Learn Syst 29(7):2944\u20132959","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"5","key":"5571_CR40","doi-asserted-by":"publisher","first-page":"1280","DOI":"10.1016\/j.jcss.2011.12.014","volume":"78","author":"LL Wu","year":"2012","unstructured":"Wu LL, Garg SK, Buyya R (2012) Sla-based admission control for a software-as-a-service provider in cloud computing environments. J Comput Syst Sci 78(5):1280\u20131299","journal-title":"J Comput Syst Sci"},{"key":"5571_CR41","volume-title":"Monte Carlo statistical methods","author":"PR Christian","year":"2004","unstructured":"Christian PR, George C (2004) Monte Carlo statistical methods. Springer, Berlin"},{"issue":"2","key":"5571_CR42","first-page":"239","volume":"21","author":"MD McKay","year":"1979","unstructured":"McKay MD, Beckman RJ, Conover WJ (1979) Comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 21(2):239\u2013245","journal-title":"Technometrics"},{"issue":"3","key":"5571_CR43","first-page":"197","volume":"11","author":"JC Helton","year":"1996","unstructured":"Helton JC, Davis FM (1996) On Latin hypercube sampling for structural reliability analysis. Probab Eng Mech 11(3):197\u2013206","journal-title":"Probab Eng Mech"},{"key":"5571_CR44","unstructured":"Ronald\u00a0S (1995) Finding multiple solutions with an evolutionary algorithm. In: Proceedings of 1995 IEEE International Conference on Evolutionary Computation, vol 2. pp 641\u2013646"},{"key":"5571_CR45","unstructured":"Ke\u00a0HW, Han\u00a0XC (2018) Multimodal tsp instances"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05571-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05571-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05571-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T11:18:34Z","timestamp":1705922314000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05571-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,11]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["5571"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05571-y","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,11]]},"assertion":[{"value":"3 August 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interests regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}