{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T14:22:20Z","timestamp":1769264540107,"version":"3.49.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"13-14","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"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":["Soft Comput"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s00500-024-09630-1","type":"journal-article","created":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T14:02:20Z","timestamp":1720101740000},"page":"8259-8277","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Two-stage metaheuristic for reliable and balanced network function virtualization-enabled networks"],"prefix":"10.1007","volume":"28","author":[{"given":"Hung","family":"Tran Huy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen Thi","family":"Tam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huynh Thi Thanh","family":"Binh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le Trong","family":"Vinh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,4]]},"reference":[{"key":"9630_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.116516","volume":"195","author":"I Ahmadianfar","year":"2022","unstructured":"Ahmadianfar I, Heidari AA, Noshadian S, Chen H, Gandomi AH (2022) Info: an efficient optimization algorithm based on weighted mean of vectors. Expert Syst Appl 195:116516","journal-title":"Expert Syst Appl"},{"key":"9630_CR2","doi-asserted-by":"crossref","unstructured":"Cao Z, Kodialam M, Lakshman T (2014) Traffic steering in software defined networks: Planning and online routing. In: Proceedings of the 2014 ACM SIGCOMM Workshop on Distributed Cloud Computing, pp. 65\u201370","DOI":"10.1145\/2627566.2627574"},{"key":"9630_CR3","doi-asserted-by":"publisher","first-page":"37109","DOI":"10.1109\/ACCESS.2019.2904539","volume":"7","author":"R Ding","year":"2019","unstructured":"Ding R, Xu Y, Gao F, Shen X, Wu W (2019) Deep reinforcement learning for router selection in network with heavy traffic. IEEE Access 7:37109\u201337120","journal-title":"IEEE Access"},{"issue":"1","key":"9630_CR4","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1109\/TWC.2019.2946797","volume":"19","author":"X Fu","year":"2019","unstructured":"Fu X, Yu FR, Wang J, Qi Q, Liao J (2019) Dynamic service function chain embedding for nfv-enabled iot: a deep reinforcement learning approach. IEEE Trans Wirel Commun 19(1):507\u2013519","journal-title":"IEEE Trans Wirel Commun"},{"issue":"3","key":"9630_CR5","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1007\/s42235-022-00303-z","volume":"20","author":"FS Gharehchopogh","year":"2023","unstructured":"Gharehchopogh FS (2023) An improved Harris hawks optimization algorithm with multi-strategy for community detection in social network. J Bionic Eng 20(3):1175\u20131197","journal-title":"J Bionic Eng"},{"issue":"4","key":"9630_CR6","doi-asserted-by":"publisher","first-page":"2683","DOI":"10.1007\/s11831-023-09883-3","volume":"30","author":"FS Gharehchopogh","year":"2023","unstructured":"Gharehchopogh FS, Ucan A, Ibrikci T, Arasteh B, Isik G (2023) Slime mould algorithm: a comprehensive survey of its variants and applications. Arch Comput Methods Eng 30(4):2683\u20132723","journal-title":"Arch Comput Methods Eng"},{"issue":"11","key":"9630_CR7","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1109\/JSAC.2017.2760178","volume":"35","author":"M Ghaznavi","year":"2017","unstructured":"Ghaznavi M, Shahriar N, Kamali S, Ahmed R, Boutaba R (2017) Distributed service function chaining. IEEE J Sel Areas Commun 35(11):2479\u20132489","journal-title":"IEEE J Sel Areas Commun"},{"key":"9630_CR8","doi-asserted-by":"crossref","unstructured":"Hamann M, Fischer M (2019) Path-based optimization of nfv-resource allocation in sdn networks. In: ICC 2019-2019 IEEE International Conference on Communications (ICC), pp. 1\u20136. IEEE","DOI":"10.1109\/ICC.2019.8761738"},{"issue":"5","key":"9630_CR9","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1364\/JON.3.000363","volume":"3","author":"X Hei","year":"2004","unstructured":"Hei X, Zhang J, Bensaou B, Cheung C-C (2004) Wavelength converter placement in least-load-routing-based optical networks using genetic algorithms. J Opt Netw 3(5):363\u2013378","journal-title":"J Opt Netw"},{"issue":"1","key":"9630_CR10","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","volume":"267","author":"JH Holland","year":"1992","unstructured":"Holland JH (1992) Genetic algorithms. Sci Am 267(1):66\u201373","journal-title":"Sci Am"},{"issue":"2","key":"9630_CR11","doi-asserted-by":"publisher","first-page":"1556","DOI":"10.1109\/TNSM.2020.3007712","volume":"18","author":"R Kang","year":"2020","unstructured":"Kang R, He F, Sato T, Oki E (2020) Virtual network function allocation to maximize continuous available time of service function chains with availability schedule. IEEE Trans Netw Serv Manag 18(2):1556\u20131570","journal-title":"IEEE Trans Netw Serv Manag"},{"key":"9630_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2021.108717","volume":"203","author":"A Khatiri","year":"2022","unstructured":"Khatiri A, Mirjalily G, Luo Z-Q (2022) Balanced resource allocation for vnf service chain provisioning in inter-datacenter elastic optical networks. Comput Netw 203:108717","journal-title":"Comput Netw"},{"issue":"4","key":"9630_CR13","doi-asserted-by":"publisher","first-page":"1562","DOI":"10.1109\/TNET.2018.2842798","volume":"26","author":"T-W Kuo","year":"2018","unstructured":"Kuo T-W, Liou B-H, Lin KC-J, Tsai M-J (2018) Deploying chains of virtual network functions: on the relation between link and server usage. IEEE\/ACM Trans Netw 26(4):1562\u20131576","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"12","key":"9630_CR14","first-page":"3557","volume":"68","author":"S Le","year":"2021","unstructured":"Le S, Wu Y, Guo Y, Del Vecchio C (2021) Game theoretic approach for a service function chain routing in nfv with coupled constraints. IEEE Trans Circuits Syst II Express Briefs 68(12):3557\u20133561","journal-title":"IEEE Trans Circuits Syst II Express Briefs"},{"issue":"1","key":"9630_CR15","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/2875951.2875956","volume":"46","author":"T Lukovszki","year":"2016","unstructured":"Lukovszki T, Rost M, Schmid S (2016) It\u2019s a match! near-optimal and incremental middlebox deployment. ACM SIGCOMM Comput Commun Rev 46(1):30\u201336","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"9630_CR16","doi-asserted-by":"crossref","unstructured":"Moens H, De Turck F (2014) Vnf-p: A model for efficient placement of virtualized network functions. In: 10th International Conference on Network and Service Management (CNSM) and Workshop, pp. 418\u2013423. IEEE","DOI":"10.1109\/CNSM.2014.7014205"},{"issue":"12","key":"9630_CR17","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1057\/jors.1978.263","volume":"29","author":"RM Nauss","year":"1978","unstructured":"Nauss RM (1978) An improved algorithm for the capacitated facility location problem. J Oper Res Soc 29(12):1195\u20131201","journal-title":"J Oper Res Soc"},{"issue":"4","key":"9630_CR18","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1109\/TSC.2018.2849712","volume":"14","author":"J Pei","year":"2018","unstructured":"Pei J, Hong P, Xue K, Li D (2018) Resource aware routing for service function chains in sdn and nfv-enabled network. IEEE Trans Serv Comput 14(4):985\u2013997","journal-title":"IEEE Trans Serv Comput"},{"issue":"10","key":"9630_CR19","doi-asserted-by":"publisher","first-page":"2179","DOI":"10.1109\/TPDS.2018.2880992","volume":"30","author":"J Pei","year":"2018","unstructured":"Pei J, Hong P, Xue K, Li D (2018) Efficiently embedding service function chains with dynamic virtual network function placement in geo-distributed cloud system. IEEE Trans Parallel Distrib Syst 30(10):2179\u20132192","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"9630_CR20","doi-asserted-by":"crossref","unstructured":"Pei J, Hong P, Li D (2018) Virtual network function selection and chaining based on deep learning in sdn and nfv-enabled networks. In: 2018 IEEE International Conference on Communications Workshops (ICC Workshops), pp. 1\u20136. IEEE","DOI":"10.1109\/ICCW.2018.8403657"},{"issue":"1","key":"9630_CR21","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/LCOMM.2017.2747509","volume":"22","author":"C Pham","year":"2017","unstructured":"Pham C, Tran NH, Hong CS (2017) Virtual network function scheduling: a matching game approach. IEEE Commun Lett 22(1):69\u201372","journal-title":"IEEE Commun Lett"},{"key":"9630_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2021.104558","volume":"135","author":"J Piri","year":"2021","unstructured":"Piri J, Mohapatra P (2021) An analytical study of modified multi-objective Harris hawk optimizer towards medical data feature selection. Comput Biol Med 135:104558","journal-title":"Comput Biol Med"},{"issue":"4","key":"9630_CR23","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1109\/TNSM.2019.2947905","volume":"16","author":"PTA Quang","year":"2019","unstructured":"Quang PTA, Hadjadj-Aoul Y, Outtagarts A (2019) A deep reinforcement learning approach for vnf forwarding graph embedding. IEEE Trans Netw Serv Manag 16(4):1318\u20131331","journal-title":"IEEE Trans Netw Serv Manag"},{"key":"9630_CR24","first-page":"109","volume-title":"Genetic algorithms","author":"CR Reeves","year":"2010","unstructured":"Reeves CR (2010) Genetic algorithms. Handbook of metaheuristics. Springer, Boston, pp 109\u2013139"},{"key":"9630_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2021.104712","volume":"136","author":"GI Sayed","year":"2021","unstructured":"Sayed GI, Soliman MM, Hassanien AE (2021) A novel melanoma prediction model for imbalanced data using optimized squeezenet by bald eagle search optimization. Comput Biol Med 136:104712","journal-title":"Comput Biol Med"},{"key":"9630_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119269","volume":"215","author":"Y Shen","year":"2023","unstructured":"Shen Y, Zhang C, Gharehchopogh FS, Mirjalili S (2023) An improved whale optimization algorithm based on multi-population evolution for global optimization and engineering design problems. Expert Syst Appl 215:119269","journal-title":"Expert Syst Appl"},{"key":"9630_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107401","volume":"107","author":"M Shokouhifar","year":"2021","unstructured":"Shokouhifar M (2021) Fh-aco: Fuzzy heuristic-based ant colony optimization for joint virtual network function placement and routing. Appl Soft Comput 107:107401","journal-title":"Appl Soft Comput"},{"key":"9630_CR28","first-page":"53","volume":"2016","author":"S Strasser","year":"2016","unstructured":"Strasser S, Goodman R, Sheppard J, Butcher S (2016) A new discrete particle swarm optimization algorithm. Proceedings of the Genetic and Evolutionary Computation Conference 2016:53\u201360","journal-title":"Proceedings of the Genetic and Evolutionary Computation Conference"},{"key":"9630_CR29","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.neucom.2023.02.010","volume":"532","author":"H Su","year":"2023","unstructured":"Su H, Zhao D, Heidari AA, Liu L, Zhang X, Mafarja M, Chen H (2023) Rime: a physics-based optimization. Neurocomputing 532:183\u2013214","journal-title":"Neurocomputing"},{"key":"9630_CR30","doi-asserted-by":"crossref","unstructured":"Tajiki MM, Salsano S, Shojafar M, Chiaraviglio L, Akbari B (2018) Energy-efficient path allocation heuristic for service function chaining. In: 2018 21st Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN), pp. 1\u20138. IEEE","DOI":"10.1109\/ICIN.2018.8401618"},{"key":"9630_CR31","doi-asserted-by":"crossref","unstructured":"Tam NT, Hung TH, Van\u00a0Hanh P, Binh HTT (2023) Genetic programming for resource allocation in network function virtualization. In: 2023 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE","DOI":"10.1109\/CEC53210.2023.10253997"},{"key":"9630_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2021.104968","volume":"139","author":"S Thawkar","year":"2021","unstructured":"Thawkar S, Sharma S, Khanna M, Kumar Singh L (2021) Breast cancer prediction using a hybrid method based on butterfly optimization algorithm and ant lion optimizer. Comput Biol Med 139:104968","journal-title":"Comput Biol Med"},{"key":"9630_CR33","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/s42235-021-0050-y","volume":"18","author":"J Tu","year":"2021","unstructured":"Tu J, Chen H, Wang M, Gandomi AH (2021) The colony predation algorithm. J Bionic Eng 18:674\u2013710","journal-title":"J Bionic Eng"},{"issue":"2","key":"9630_CR34","doi-asserted-by":"publisher","first-page":"1524","DOI":"10.1109\/TNSM.2021.3055693","volume":"18","author":"A Varasteh","year":"2021","unstructured":"Varasteh A, Madiwalar B, Van Bemten A, Kellerer W, Mas-Machuca C (2021) Holu: power-aware and delay-constrained vnf placement and chaining. IEEE Trans Netw Serv Manag 18(2):1524\u20131539","journal-title":"IEEE Trans Netw Serv Manag"},{"key":"9630_CR35","doi-asserted-by":"crossref","unstructured":"Velinska J, Mishkovski I, Mirchev M (2018) Routing, modulation and spectrum allocation in elastic optical networks. In: 2018 26th Telecommunications Forum (TELFOR), pp. 1\u20134. IEEE","DOI":"10.1109\/TELFOR.2018.8611929"},{"issue":"1","key":"9630_CR36","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/TNSM.2021.3049298","volume":"18","author":"L Wang","year":"2021","unstructured":"Wang L, Mao W, Zhao J, Xu Y (2021) Ddqp: a double deep q-learning approach to online fault-tolerant sfc placement. IEEE Trans Netw Serv Manag 18(1):118\u2013132","journal-title":"IEEE Trans Netw Serv Manag"},{"key":"9630_CR37","doi-asserted-by":"crossref","unstructured":"Wang X, Wu C, Le F, Lau FC (2017) Online learning-assisted vnf service chain scaling with network uncertainties. In: 2017 IEEE 10th International Conference on Cloud Computing (CLOUD), pp. 205\u2013213. IEEE","DOI":"10.1109\/CLOUD.2017.34"},{"key":"9630_CR38","doi-asserted-by":"crossref","unstructured":"Wang X, Wu C, Le F, Liu A, Li Z, Lau F (2016) Online vnf scaling in datacenters. In: 2016 IEEE 9th International Conference on Cloud Computing (CLOUD), pp. 140\u2013147. IEEE","DOI":"10.1109\/CLOUD.2016.0028"},{"key":"9630_CR39","doi-asserted-by":"crossref","unstructured":"Wang Y, Zhang X, Fan L, Yu S, Lin R (2019) Segment routing optimization for vnf chaining. In: ICC 2019-2019 IEEE International Conference on Communications (ICC), pp. 1\u20137. IEEE","DOI":"10.1109\/ICC.2019.8761103"},{"key":"9630_CR40","doi-asserted-by":"crossref","unstructured":"Wu B, Zeng J, Ge L, Shao S, Tang Y, Su X (2019) Resource allocation optimization in the nfv-enabled mec network based on game theory. In: ICC 2019\u20132019 IEEE International Conference on Communications (ICC), pp. 1\u20137. IEEE","DOI":"10.1109\/ICC.2019.8761912"},{"key":"9630_CR41","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1016\/j.asoc.2018.12.037","volume":"76","author":"H Xing","year":"2019","unstructured":"Xing H, Zhou X, Wang X, Luo S, Dai P, Li K, Yang H (2019) An integer encoding grey wolf optimizer for virtual network function placement. Appl Soft Comput 76:575\u2013594","journal-title":"Appl Soft Comput"},{"issue":"2","key":"9630_CR42","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1007\/s42235-022-00297-8","volume":"20","author":"J Xing","year":"2023","unstructured":"Xing J, Zhao H, Chen H, Deng R, Xiao L (2023) Boosting whale optimizer with quasi-oppositional learning and Gaussian barebone for feature selection and covid-19 image segmentation. J Bionic Eng 20(2):797-818","journal-title":"J Bionic Eng"},{"key":"9630_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114864","volume":"177","author":"Y Yang","year":"2021","unstructured":"Yang Y, Chen H, Heidari AA, Gandomi AH (2021) Hunger games search: visions, conception, implementation, deep analysis, perspectives, and towards performance shifts. Expert Syst Appl 177:114864","journal-title":"Expert Syst Appl"},{"issue":"4","key":"9630_CR44","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1090\/qam\/253822","volume":"27","author":"JY Yen","year":"1970","unstructured":"Yen JY (1970) An algorithm for finding shortest routes from all source nodes to a given destination in general networks. Q Appl Math 27(4):526\u2013530","journal-title":"Q Appl Math"},{"key":"9630_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108427","volume":"117","author":"SR Zahedi","year":"2022","unstructured":"Zahedi SR, Jamali S, Bayat P (2022) Emcfis: evolutionary multi-criteria fuzzy inference system for virtual network function placement and routing. Appl Soft Comput 117:108427","journal-title":"Appl Soft Comput"},{"issue":"2","key":"9630_CR46","doi-asserted-by":"publisher","first-page":"3698","DOI":"10.1002\/ett.3698","volume":"31","author":"S Zhang","year":"2020","unstructured":"Zhang S, Wang X, Qian X, Huang M (2020) An intelligent sdn-enabled ccn routing mechanism with community division. Trans Emerg Telecommun Technol 31(2):3698","journal-title":"Trans Emerg Telecommun Technol"},{"key":"9630_CR47","doi-asserted-by":"crossref","unstructured":"Zhou J, Hong P, Pei J, Li D (2019) Multi-task deep learning based dynamic service function chains routing in sdn\/nfv-enabled networks. In: ICC 2019\u20132019 IEEE International Conference on Communications (ICC), pp. 1\u20136. IEEE","DOI":"10.1109\/ICC.2019.8761116"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-09630-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-024-09630-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-09630-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T06:44:54Z","timestamp":1723877094000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-024-09630-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":47,"journal-issue":{"issue":"13-14","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["9630"],"URL":"https:\/\/doi.org\/10.1007\/s00500-024-09630-1","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7]]},"assertion":[{"value":"30 December 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2024","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 have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}