{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T14:23:55Z","timestamp":1769696635854,"version":"3.49.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T00:00:00Z","timestamp":1684108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T00:00:00Z","timestamp":1684108800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Directional sensor networks (DSNs) are ad-hoc networks which are utilized in different industrial applications. Their usual engagements are to monitor and to perform the coverage of all specific targets in the observing fields permanently. These kinds of networks include numerous configurable directional sensors in which they can be utilized in one of the possible directions along with the one of their adjustable ranges. Although the energy harvesting methodology is being applied for these battery-hungry applications, the battery management and network lifetime maximization are still prominent challenges. In this paper, the network lifetime extension is formulated to a discrete optimization problem which is a famous non-deterministic polynomial time hardness (NP-Hard) problem. To solve this combinatorial problem, a discrete cuckoo search algorithm (<jats:italic>D-CSA<\/jats:italic>) is designed and is called in several rounds. A <jats:italic>cover<\/jats:italic> is a sub set of configured sensors capable of monitoring all targets in the observing field. In each round, the most efficient <jats:italic>cover<\/jats:italic> is constituted along with its activation time. In the determined activation time, the sensors in the <jats:italic>cover<\/jats:italic> are scheduled in <jats:italic>wakeup<\/jats:italic> mode whereas others are set in <jats:italic>sleep<\/jats:italic> mode to save energy. Despite other meta-heuristic algorithms, this proposed algorithm utilizes the novel defined discrete walking around procedures that makes to reach a good balance between exploration and exploitation in this complex search space. The proposed algorithm has been tested in different scenarios to be evaluated. The simulation results in the variety circumstances prove the superiority of the proposed algorithm is about 20.29%, 19.55%, 14.40%, 14.51%, 7.70% and 8.03% in term of average lifespan improvement against <jats:italic>H-MNLAR<\/jats:italic>, <jats:italic>Hm-LifMax-BC<\/jats:italic>, <jats:italic>GA<\/jats:italic>, <jats:italic>ACOSC<\/jats:italic>, <jats:italic>H-GATS<\/jats:italic>, and <jats:italic>HDPSO<\/jats:italic> algorithms, respectively. The results also show the high potential scalability of the proposed algorithm.<\/jats:p>","DOI":"10.1007\/s40747-023-01078-4","type":"journal-article","created":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T13:51:02Z","timestamp":1684158662000},"page":"6459-6491","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Sleep-wakeup scheduling algorithm for lifespan maximization of directional sensor networks: a discrete cuckoo search optimization algorithm"],"prefix":"10.1007","volume":"9","author":[{"given":"Mir Gholamreza","family":"Mortazavi","sequence":"first","affiliation":[]},{"given":"Mirsaeid","family":"Hosseini Shirvani","sequence":"additional","affiliation":[]},{"given":"Arash","family":"Dana","sequence":"additional","affiliation":[]},{"given":"Mahmood","family":"Fathy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,15]]},"reference":[{"issue":"101973","key":"1078_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.adhoc.2019.101973","volume":"94","author":"J Jia","year":"2019","unstructured":"Jia J, Dong C, Hong Y, Guo L, Yu Y (2019) Maximizing full-view target coverage in camera sensor networks. Ad Hoc Netw 94(101973):1\u201310. https:\/\/doi.org\/10.1016\/j.adhoc.2019.101973","journal-title":"Ad Hoc Netw"},{"key":"1078_CR2","doi-asserted-by":"publisher","unstructured":"Elnaggar OE, Ramadan RA, Fayek MB (2015) WSN in monitoring oil pipelines using ACO and GA. In: 2015 The 2nd International Workshop on Wireless Networks and Energy Saving Techniques (WNTEST 2015). Procedia Comput Sci 52:1198\u20131205. https:\/\/doi.org\/10.1016\/j.adhoc.2019.101973","DOI":"10.1016\/j.adhoc.2019.101973"},{"issue":"102037","key":"1078_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.adhoc.2019.102037","volume":"98","author":"C Luo","year":"2019","unstructured":"Luo C, Hong Y, Li D, Wang Y, Chen W, Hu Q (2019) Maximizing network lifetime using coverage sets scheduling in wireless sensor networks. Ad Hoc Netw 98(102037):1\u201316. https:\/\/doi.org\/10.1016\/j.adhoc.2019.102037","journal-title":"Ad Hoc Netw"},{"key":"1078_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.pmcj.2018.10.009","volume":"52","author":"A Alibeiki","year":"2019","unstructured":"Alibeiki A, Motameni H, Mohamadi H (2019) A new genetic-based approach for maximizing network lifetime in directional sensor networks with adjustable sensing ranges. Pervasive Mob Comput 52:1\u201312. https:\/\/doi.org\/10.1016\/j.pmcj.2018.10.009","journal-title":"Pervasive Mob Comput"},{"key":"1078_CR5","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ejor.2012.01.046","volume":"220","author":"R Cerulli","year":"2012","unstructured":"Cerulli R, De Donato R, Raiconi A (2012) Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges. European J Oper Res 220:58\u201366. https:\/\/doi.org\/10.1016\/j.ejor.2012.01.046","journal-title":"European J Oper Res"},{"issue":"e00720","key":"1078_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.sciaf.2021.e00720","volume":"11","author":"F Mazunga","year":"2021","unstructured":"Mazunga F, Nechibvute A (2021) Ultra-low power techniques in energy harvesting wireless sensor networks: recent advances and issues. Sci Afr 11(e00720):1\u201314. https:\/\/doi.org\/10.1016\/j.sciaf.2021.e00720","journal-title":"Sci Afr"},{"key":"1078_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.dcan.2018.11.002","volume":"6","author":"S Kyi","year":"2020","unstructured":"Kyi S, Taparugssanagorn A (2020) Wireless sensing for a solar power system. Digit Commun Netw 6:51\u201357. https:\/\/doi.org\/10.1016\/j.dcan.2018.11.002","journal-title":"Digit Commun Netw"},{"key":"1078_CR8","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.jnca.2014.07.038","volume":"46","author":"H Mahamadi","year":"2014","unstructured":"Mahamadi H, Salleh S, Razali MN (2014) Heuristic methods to maximize network lifetime in directional sensor networks with adjustable sensing ranges. J Netw Comput Appl 46:26\u201335. https:\/\/doi.org\/10.1016\/j.jnca.2014.07.038","journal-title":"J Netw Comput Appl"},{"key":"1078_CR9","volume-title":"Introduction to algorithms","author":"C Thomas","year":"1990","unstructured":"Thomas C, Leiserson H, Rivest CE, Ronald L (1990) Introduction to algorithms, 1st edn. MIT Press and McGraw-Hill (ISBN\u00a00-262-03141-8)","edition":"1"},{"issue":"6","key":"1078_CR10","doi-asserted-by":"publisher","first-page":"8276","DOI":"10.1109\/JSEN.2020.3045138","volume":"21","author":"G Chen","year":"2021","unstructured":"Chen G, Xiong Y, She J, Wu M, Galkowski K (2021) Optimization of the directional sensor networks with rotatable sensors for target-barrier coverage. IEEE Sens J 21(6):8276\u20138288. https:\/\/doi.org\/10.1109\/JSEN.2020.3045138","journal-title":"IEEE Sens J"},{"key":"1078_CR11","volume-title":"Handbook of evolutionary computation","author":"D Kalyanmoy","year":"1997","unstructured":"Kalyanmoy D, Spears S, William M (1997) C6.2: speciation methods. Handbook of evolutionary computation. Institute of Physics Publishing (S2CID\u00a03547258)"},{"key":"1078_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jss.2014.11.014","volume":"101","author":"IA Moschakis","year":"2015","unstructured":"Moschakis IA, Karatza HD (2015) Multi-criteria scheduling of Bag-of-Tasks applications on heterogeneous interlinked Clouds with Simulated Annealing. J Syst Softw 101:1\u201314. https:\/\/doi.org\/10.1016\/j.jss.2014.11.014","journal-title":"J Syst Softw"},{"key":"1078_CR13","doi-asserted-by":"crossref","unstructured":"Yang XS, Deb S (2009) Cuckoo search via l\u00e9vy flights. In: 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC 2009). IEEE Publications. pp.\u00a0210\u2013214.\u00a0https:\/\/arXiv.oorg\/1003.1594v1","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"1078_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10878-006-5975-x","volume":"11","author":"J Ai","year":"2006","unstructured":"Ai J, Abouzeid AA (2006) Coverage by directional sensors in randomly deployed wireless sensor networks. J Combin Optim 11:21\u201341. https:\/\/doi.org\/10.1007\/s10878-006-5975-x","journal-title":"J Combin Optim"},{"key":"1078_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.ejor.2013.05.033","volume":"231","author":"A Rossi","year":"2013","unstructured":"Rossi A, Singh A, Sevaux M (2013) Lifetime maximization in wireless directional sensor network. Eur J Oper Res 231:229\u2013241. https:\/\/doi.org\/10.1016\/j.ejor.2013.05.033","journal-title":"Eur J Oper Res"},{"key":"1078_CR16","doi-asserted-by":"publisher","unstructured":"Singh P, Mini S (2016) A heuristic to deploy directional sensor nodes in wireless sensor networks. In: 2016 8th International Conference on Computational Intelligence and Communication Networks (CICN), pp 11\u201315, https:\/\/doi.org\/10.1109\/CICN.2016.11","DOI":"10.1109\/CICN.2016.11"},{"key":"1078_CR17","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.jnca.2016.02.011","volume":"65","author":"WM Tan","year":"2016","unstructured":"Tan WM, Jarvis SA (2016) Heuristic solutions to the target identifiability problem in directional sensor networks. J Netw Comput Appl 65:84\u2013102. https:\/\/doi.org\/10.1016\/j.jnca.2016.02.011","journal-title":"J Netw Comput Appl"},{"key":"1078_CR18","unstructured":"Xu J, Zhong F, Wang Y (2020) Learning multi-agent coordination for enhancing target coverage in directional sensor networks. In: 34th Conference on Neural Information Processing Systems (NeurIPS 2020), Vancouver, Canada"},{"key":"1078_CR19","doi-asserted-by":"publisher","first-page":"64005","DOI":"10.1109\/ACCESS.2019.2916407","volume":"7","author":"S Sharmin","year":"2019","unstructured":"Sharmin S, Nur FN, Islam M, Razzaque MA, Hassan MM, Alelaiwi A (2019) Target coverage-aware clustering in directional sensor networks: a distributed approach. IEEE Access 7:64005\u201364014. https:\/\/doi.org\/10.1109\/ACCESS.2019.2916407","journal-title":"IEEE Access"},{"issue":"4","key":"1078_CR20","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1504\/IJSNET.2017.085970","volume":"24","author":"Z Lu","year":"2017","unstructured":"Lu Z, Wu W, Li WW (2017) Target coverage maximization for directional sensor networks. Int J Sens Netw 24(4):253\u2013263. https:\/\/doi.org\/10.1504\/IJSNET.2017.085970","journal-title":"Int J Sens Netw"},{"key":"1078_CR21","doi-asserted-by":"publisher","unstructured":"Chaturvedi P, Daniel AK (2015) Trust based energy efficient coverage preserving protocol for wireless sensor networks. In: 2015 International Conference on Green Computing and Internet of Things (ICGCIoT), 2015, pp 860\u2013865https:\/\/doi.org\/10.1109\/ICGCIoT.2015.7380583","DOI":"10.1109\/ICGCIoT.2015.7380583"},{"key":"1078_CR22","doi-asserted-by":"publisher","first-page":"1995","DOI":"10.1007\/s11276-018-1792-2","volume":"25","author":"S Harizan","year":"2019","unstructured":"Harizan S, Kuila P (2019) Coverage and connectivity aware energy efficient scheduling in target based wireless sensor networks: an improved genetic algorithm based approach. Wirel Netw 25:1995\u20132011. https:\/\/doi.org\/10.1007\/s11276-018-1792-2","journal-title":"Wirel Netw"},{"issue":"2","key":"1078_CR23","doi-asserted-by":"publisher","first-page":"1888","DOI":"10.3390\/s110201888","volume":"11","author":"J-M Gil","year":"2011","unstructured":"Gil J-M, Han Y-H (2011) A target coverage scheduling scheme based on genetic algorithms in directional sensor networks. Sensors 11(2):1888\u20131906. https:\/\/doi.org\/10.3390\/s110201888","journal-title":"Sensors"},{"issue":"7","key":"1078_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1177\/1550147716657923","volume":"12","author":"A Wang","year":"2016","unstructured":"Wang A, Gao Y, Wu J, Sun G, Jia W (2016) A novel multi-objective coverage optimization memetic algorithm for directional sensor networks. Int J Distrib Sens Netw 12(7):1\u20139. https:\/\/doi.org\/10.1177\/1550147716657923","journal-title":"Int J Distrib Sens Netw"},{"key":"1078_CR25","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1007\/s11277-016-3801-z","volume":"95","author":"MN Razali","year":"2017","unstructured":"Razali MN, Salleh S, Mohamadi H (2017) Solving priority-based target coverage problem in directional sensor networks with adjustable sensing ranges. Wirel Pers Commun 95:847\u2013872. https:\/\/doi.org\/10.1007\/s11277-016-3801-z","journal-title":"Wirel Pers Commun"},{"issue":"13","key":"1078_CR26","doi-asserted-by":"publisher","first-page":"3733","DOI":"10.3390\/s20133733","volume":"20","author":"J Kim","year":"2020","unstructured":"Kim J, Yoo Y (2020) Sensor node activation using bat algorithm for connected target coverage in WSNs. Sensors (Basel Switzerland) 20(13):3733. https:\/\/doi.org\/10.3390\/s20133733","journal-title":"Sensors (Basel Switzerland)"},{"issue":"17","key":"1078_CR27","doi-asserted-by":"publisher","first-page":"8503","DOI":"10.3390\/app12178503","volume":"12","author":"Y-A Fan","year":"2022","unstructured":"Fan Y-A, Liang C-K (2022) Hybrid discrete particle swarm optimization algorithm with genetic operators for target coverage problem in directional wireless sensor networks. Appl Sci 12(17):8503. https:\/\/doi.org\/10.3390\/app12178503","journal-title":"Appl Sci"},{"key":"1078_CR28","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/484902","author":"P Huang","year":"2015","unstructured":"Huang P, Lin F, Liu C, Gao J, Zhou J (2015) ACO-based sweep coverage scheme in wireless sensor networks. J Sens. https:\/\/doi.org\/10.1155\/2015\/484902","journal-title":"J Sens"},{"key":"1078_CR29","doi-asserted-by":"publisher","first-page":"103501","DOI":"10.1016\/j.engappai.2020.103501","volume":"90","author":"M Hosseini-Shirvani","year":"2020","unstructured":"Hosseini-Shirvani M (2020) A hybrid meta-heuristic algorithm for scientific workflow scheduling in heterogeneous distributed computing systems. Eng Appl Artif Intell 90:103501. https:\/\/doi.org\/10.1016\/j.engappai.2020.103501","journal-title":"Eng Appl Artif Intell"},{"issue":"9","key":"1078_CR30","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1109\/TC.2009.40","volume":"58","author":"Y Cai","year":"2009","unstructured":"Cai Y, Lou W, Li M, Li X (2009) Energy efficient target-oriented scheduling in directional sensor networks. IEEE Trans Comput 58(9):1259\u20131274. https:\/\/doi.org\/10.1109\/TC.2009.40","journal-title":"IEEE Trans Comput"},{"key":"1078_CR31","doi-asserted-by":"publisher","unstructured":"Mortazavi MG, Shirvani MH, Dana A (2022) A Discrete Cuckoo Search Algorithm for Reliability-aware\u00a0Energy-efficient IoT Applications Multi-service Deployment in Fog Environment. Int\u00a0\u00a0Conf\u00a0Electr Comput\u00a0 Energ Technol (ICECET) Prague, Czech Republic. pp. 1\u20136.\u00a0https:\/\/doi.org\/10.1109\/ICECET55527.2022.9873056","DOI":"10.1109\/ICECET55527.2022.9873056"},{"key":"1078_CR32","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.jpdc.2021.03.006","volume":"154","author":"A Alibeiki","year":"2021","unstructured":"Alibeiki A, Motameni H, Mohamadi H (2021) A new genetic-based approach for solving k-coverage problem in directional sensor networks. J Parallel Distrib Comput 154:16\u201326. https:\/\/doi.org\/10.1016\/j.jpdc.2021.03.006","journal-title":"J Parallel Distrib Comput"},{"issue":"101719","key":"1078_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.phycom.2022.101719","volume":"54","author":"N Mottaki","year":"2022","unstructured":"Mottaki N, Motameni H, Mohammadi H (2022) A genetic algorithm-based approach for solving the target Q-coverage problem in over and under provisioned directional sensor networks. Phys Commun 54(101719):1\u201314. https:\/\/doi.org\/10.1016\/j.phycom.2022.101719","journal-title":"Phys Commun"},{"issue":"101719","key":"1078_CR34","doi-asserted-by":"publisher","first-page":"3277","DOI":"10.1007\/s11227-022-04710-1","volume":"79","author":"N Mottaki","year":"2023","unstructured":"Mottaki N, Motameni H, Mohammadi H (2023) An effective hybrid genetic algorithm and tabu search for maximizing network lifetime using coverage sets scheduling in wireless sensor networks. J Supercomput 79(101719):3277\u20133297. https:\/\/doi.org\/10.1007\/s11227-022-04710-1","journal-title":"J Supercomput"},{"key":"1078_CR35","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/2659901","author":"Y Hong","year":"2022","unstructured":"Hong Y, Luo C, Li D, Zhibo C, Wang X (2022) Lifetime-maximized strong barrier coverage of 3D camera. Wirel Commun Mob Comput. https:\/\/doi.org\/10.1155\/2022\/2659901","journal-title":"Wirel Commun Mob Comput"},{"issue":"2","key":"1078_CR36","doi-asserted-by":"publisher","first-page":"573","DOI":"10.3390\/s23020573","volume":"23","author":"P Gou","year":"2023","unstructured":"Gou P, Guo B, Guo M, Mao S (2023) VKECE-3D: energy-efficient coverage enhancement in three-dimensional heterogeneous wireless sensor networks based on 3D-voronoi and K-means algorithm. Sensors 23(2):573\u2013598. https:\/\/doi.org\/10.3390\/s23020573","journal-title":"Sensors"},{"key":"1078_CR37","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1049\/cmu2.12323","volume":"16","author":"A Qarehkhani","year":"2022","unstructured":"Qarehkhani A, Golsorkhtabaramiri M, Mohamadi H, Yadollahzadeh-Tabari M (2022) Solving the target coverage problem in multilevel wireless networks capable of adjusting the sensing angle using continuous learning automata. IET Commun 16:151\u2013163. https:\/\/doi.org\/10.1049\/cmu2.12323","journal-title":"IET Commun"},{"issue":"7732989","key":"1078_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2022\/7732989","volume":"2022","author":"Z Wang","year":"2022","unstructured":"Wang Z, Tian L, Wu W, Lin L, Li Z, Tong Y (2022) A meta-heuristic algorithm for coverage enhancement of wireless sensor networks. Wirel Commun Mob Comput 2022(7732989):1\u201323. https:\/\/doi.org\/10.1155\/2022\/7732989","journal-title":"Wirel Commun Mob Comput"},{"issue":"1","key":"1078_CR39","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1080\/21642583.2019.1708830","volume":"8","author":"JK Xue","year":"2020","unstructured":"Xue JK, Shen B (2020) A novel swarm intelligence optimization approach: sparrow search algorithm. Syst Sci Control Eng 8(1):22\u201334. https:\/\/doi.org\/10.1080\/21642583.2019.1708830","journal-title":"Syst Sci Control Eng"},{"key":"1078_CR40","doi-asserted-by":"publisher","first-page":"5233","DOI":"10.1007\/s00500-020-05523-1","volume":"25","author":"P Saeedi","year":"2021","unstructured":"Saeedi P, Hosseini-Shirvani M (2021) An improved thermodynamic simulated annealing-based approach for resource-skewness-aware and power-efficient virtual machine consolidation in cloud datacenters. Soft Comput 25:5233\u20135260. https:\/\/doi.org\/10.1007\/s00500-020-05523-1","journal-title":"Soft Comput"},{"key":"1078_CR41","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1007\/s11227-022-04703-0","volume":"79","author":"Y Asghari-Alaie","year":"2023","unstructured":"Asghari-Alaie Y, Hosseini-Shirvani M, Rahmani AM (2023) A hybrid bi-objective scheduling algorithm for execution of scientific workflows on cloud platforms with execution time and reliability approach. J Supercomput 79:1451\u20131503. https:\/\/doi.org\/10.1007\/s11227-022-04703-0","journal-title":"J Supercomput"},{"issue":"7430125","key":"1078_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2017\/7430125","volume":"2017","author":"A Hussain","year":"2017","unstructured":"Hussain A, Muhammad YS, Sasid MN, Hussain I, Shoukry AM, Gani S (2017) Genetic algorithm for traveling salesman problem with modified cycle crossover operator. Comput Intell Neurosci 2017(7430125):1\u20137. https:\/\/doi.org\/10.1155\/2017\/7430125","journal-title":"Comput Intell Neurosci"},{"key":"1078_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2012.09.002","volume":"9","author":"SA Mirjalili","year":"2013","unstructured":"Mirjalili SA, Lewis A (2013) S-shaped versus V-shaped transfer functions for binary particle swarm optimization. Swarm Evol Comput 9:1\u201314. https:\/\/doi.org\/10.1016\/j.swevo.2012.09.002","journal-title":"Swarm Evol Comput"}],"updated-by":[{"DOI":"10.1007\/s40747-023-01165-6","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T00:00:00Z","timestamp":1689638400000}}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01078-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-023-01078-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01078-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T19:16:23Z","timestamp":1698434183000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-023-01078-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,15]]},"references-count":43,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1078"],"URL":"https:\/\/doi.org\/10.1007\/s40747-023-01078-4","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s40747-023-01165-6","asserted-by":"object"}]},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,15]]},"assertion":[{"value":"18 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2023","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s40747-023-01165-6","URL":"https:\/\/doi.org\/10.1007\/s40747-023-01165-6","order":7,"name":"change_details","label":"Change Details","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 interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}