{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T04:27:04Z","timestamp":1783571224638,"version":"3.55.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"19","license":[{"start":{"date-parts":[[2021,4,18]],"date-time":"2021-04-18T00:00:00Z","timestamp":1618704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,4,18]],"date-time":"2021-04-18T00:00:00Z","timestamp":1618704000000},"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":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2021,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The cloud computing systems are sorts of shared collateral structure which has been in demand from its inception. In these systems, clients are able to access existing services based on their needs and without knowing where the service is located and how it is delivered, and only pay for the service used. Like other systems, there are challenges in the cloud computing system. Because of a wide array of clients and the variety of services available in this system, it can be said that the issue of scheduling and, of course, energy consumption is essential challenge of this system. Therefore, it should be properly provided to users, which minimizes both the cost of the provider and consumer and the energy consumption, and this requires the use of an optimal scheduling algorithm. In this paper, we present a two-step hybrid method for scheduling tasks aware of energy and time called Genetic Algorithm and Energy-Conscious Scheduling Heuristic based on the Genetic Algorithm. The first step involves prioritizing tasks, and the second step consists of assigning tasks to the processor. We prioritized tasks and generated primary chromosomes, and used the Energy-Conscious Scheduling Heuristic model, which is an energy-conscious model, to assign tasks to the processor. As the simulation results show, these results demonstrate that the proposed algorithm has been able to outperform other methods.<\/jats:p>","DOI":"10.1007\/s00521-021-06002-w","type":"journal-article","created":{"date-parts":[[2021,4,18]],"date-time":"2021-04-18T07:02:33Z","timestamp":1618729353000},"page":"13075-13088","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":113,"title":["Multi-objective hybrid genetic algorithm for task scheduling problem in cloud computing"],"prefix":"10.1007","volume":"33","author":[{"given":"Poria","family":"Pirozmand","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ali Asghar Rahmani","family":"Hosseinabadi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maedeh","family":"Farrokhzad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mehdi","family":"Sadeghilalimi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Seyedsaeid","family":"Mirkamali","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2542-9842","authenticated-orcid":false,"given":"Adam","family":"Slowik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,4,18]]},"reference":[{"key":"6002_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.eij.2015.07.001","volume":"16","author":"M Kalra","year":"2015","unstructured":"Kalra M, Singh S (2015) A review of metaheuristic scheduling techniques in cloud computing. Egypt Inf J 16(3):275\u2013295. https:\/\/doi.org\/10.1016\/j.eij.2015.07.001","journal-title":"Egypt Inf J"},{"key":"6002_CR2","doi-asserted-by":"publisher","first-page":"5901","DOI":"10.1007\/s00521-019-04067-2","volume":"32","author":"KR Prasanna Kumar","year":"2019","unstructured":"Prasanna Kumar KR, Kousalya K (2019) Amelioration of task scheduling in cloud computing using crow search algorithm. Neural Comput Appl 32:5901\u20135907","journal-title":"Neural Comput Appl"},{"key":"6002_CR3","doi-asserted-by":"crossref","unstructured":"Srichandan S, Ashok\u00a0Kumar T, Bibhudatta S (2018) Task scheduling for cloud computing using multi-objective hybrid bacteria foraging algorithm. Future Comput Inf J, vol. 3, pp. 210-230","DOI":"10.1016\/j.fcij.2018.03.004"},{"key":"6002_CR4","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.future.2018.05.056","volume":"88","author":"S Basu","year":"2018","unstructured":"Basu S, Karuppiah M, Selvakumar K, Li K, Islam SKH, Hassan MM, Bhuiyan MZA (2018) An intelligent\/cognitive model of task scheduling for IoT applications in cloud computing environment. Future Generat Comput Syst 88:254\u2013261","journal-title":"Future Generat Comput Syst"},{"key":"6002_CR5","first-page":"289","volume":"801","author":"M Gamal","year":"2019","unstructured":"Gamal M, Rizk R, Mahdi H, Elhady B (2019) Bio-inspired based task scheduling in cloud computing. Mach Learn Paradig: Theor Appl 801:289\u2013308","journal-title":"Mach Learn Paradig: Theor Appl"},{"key":"6002_CR6","doi-asserted-by":"crossref","unstructured":"George\u00a0Amalarethinam DI, Kavitha S (2018) Rescheduling enhanced Min-Min (REMM) algorithm for meta-task scheduling in cloud computing. International Conference on Intelligent Data Communication Technologies and Internet of Things, vol. 26, pp. 895\u2013902","DOI":"10.1007\/978-3-030-03146-6_102"},{"key":"6002_CR7","doi-asserted-by":"crossref","unstructured":"Alworafi MA, Mallappa S (2019) A collaboration of deadline and budget constraints for task scheduling in cloud computing. Cluster Comput, pp. 1-11","DOI":"10.1007\/s10586-019-02978-2"},{"key":"6002_CR8","doi-asserted-by":"publisher","first-page":"11975","DOI":"10.1007\/s10586-017-1534-8","volume":"22","author":"R Valarmathi","year":"2019","unstructured":"Valarmathi R, Sheela T (2019) Ranging and tuning based particle swarm optimization with bat algorithm for task scheduling in cloud computing. Cluster Comput 22:11975\u201311988. https:\/\/doi.org\/10.1007\/s10586-017-1534-8","journal-title":"Cluster Comput"},{"key":"6002_CR9","doi-asserted-by":"publisher","unstructured":"Lee YC, Zomaya AY (2009) Minimizing energy consumption for precedence-constrained applications using dynamic voltage scaling. In: 2009 9th IEEE\/ACM International Symposium on Cluster Computing and the Grid, Shanghai, China, 2009, pp 92\u201399. https:\/\/doi.org\/10.1109\/CCGRID.2009.16","DOI":"10.1109\/CCGRID.2009.16"},{"key":"6002_CR10","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1016\/j.jpdc.2011.04.007","volume":"71","author":"M Mezmaz","year":"2011","unstructured":"Mezmaz M, Melab N, Kessaci Y, Lee YC, Talbi EG, Zomaya AY, Tuyttens D (2011) A parallel bi-objective hybrid metaheuristic for energy-aware scheduling for cloud computing systems. J Parallel Distribut Comput 71:1497\u20131508","journal-title":"J Parallel Distribut Comput"},{"key":"6002_CR11","doi-asserted-by":"crossref","unstructured":"Shojafar M, Kardgar M, Hosseinabadi AR, Shamshirband S, Abraham A (2016) TETS: A genetic-based scheduler in cloud computing to decrease energy and makespan. The 15th International Conference on Hybrid Intelligent Systems (HIS 2015), Chapter Advances in Intelligent Systems and Computing 420, Seoul, South Korea, vol. 420, pp. 103\u2013115,","DOI":"10.1007\/978-3-319-27221-4_9"},{"key":"6002_CR12","first-page":"1","volume":"22","author":"V Polepally","year":"2017","unstructured":"Polepally V, Chatrapati KS (2017) Dragonfly optimization and constraint measure-based load balancing in cloud computing. Clust Comput 22:1\u201313","journal-title":"Clust Comput"},{"issue":"2","key":"6002_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/s20020539","volume":"20","author":"AK Sangaiah","year":"2020","unstructured":"Sangaiah AK, Hosseinabadi AR, Shareh MB, Bozorgi Rad SY, Zolfagharian A, Chilamkurti N (2020) IoT resource allocation and optimization based on heuristic algorithm\u2019\u2019. Sensors 20(2):1\u201326","journal-title":"Sensors"},{"issue":"1","key":"6002_CR14","first-page":"745","volume":"10","author":"AR Hosseinabadi","year":"2013","unstructured":"Hosseinabadi AR, Farahabadi AB, Rostami MS, Lateran AF (2013) Presentation of a new and beneficial method through problem solving timing of open shop by random algorithm gravitational emulation local search. Int J Comput Sci Issues 10(1):745\u2013752","journal-title":"Int J Comput Sci Issues"},{"issue":"3","key":"6002_CR15","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/71.993206","volume":"13","author":"H Topcuoglu","year":"2002","unstructured":"Topcuoglu H, Hariri S, Wu M-Y (2002) Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans Parallel Distrib Syst 13(3):260\u2013274","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"6002_CR16","doi-asserted-by":"crossref","unstructured":"Raju YHP, Devarakonda N (2018) Makespan efficient task scheduling in cloud computing. Emerging Technol Data Mining Inf Secur, pp. 283-298","DOI":"10.1007\/978-981-13-1951-8_26"},{"issue":"9","key":"6002_CR17","first-page":"1870","volume":"4","author":"AB Farahabadi","year":"2013","unstructured":"Farahabadi AB, Hosseinabadi AR (2013) Present a new hybrid algorithm scheduling flexible manufacturing system consideration cost maintenance. Int J Sci Eng Res 4(9):1870\u20131875","journal-title":"Int J Sci Eng Res"},{"key":"6002_CR18","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10586-018-2856-x","volume":"22","author":"SHH Madni","year":"2019","unstructured":"Madni SHH, Abd Latiff MS, Ali J (2019) Hybrid gradient descent cuckoo search (HGDCS) algorithm for resource scheduling in IaaS cloud computing environment. Cluster Comput 22:301\u2013334","journal-title":"Cluster Comput"},{"key":"6002_CR19","doi-asserted-by":"crossref","unstructured":"Kashikolaei SMG, Hosseinabadi AR, Saemi B, Shareh MB, Sangaiah AK, Bian GB (2019) An enhancement of task scheduling in cloud computing based on imperialist competitive algorithm and firefly algorithm. J Supercomput, p. 1-28","DOI":"10.1007\/s11227-019-02816-7"},{"key":"6002_CR20","doi-asserted-by":"crossref","unstructured":"Zhu X, Hussain M, Li X (2019) Energy-efficient independent task scheduling in cloud computing\u201d. Human Center Comput, pp. 428\u2013439","DOI":"10.1007\/978-3-030-15127-0_43"},{"key":"6002_CR21","doi-asserted-by":"crossref","unstructured":"Lee YC, Zomaya AY (2009) Minimizing Energy Consumption for Precedence-constrained Applications Using Dynamic Voltage Scaling, Cluster Comput Grid, pp. 92-99","DOI":"10.1109\/CCGRID.2009.16"},{"key":"6002_CR22","unstructured":"Hosseinabadi AR, Vahidi J, Saemi B, Sangaiah AK, Elhoseny M (2018) Extended genetic algorithm for solving open-shop scheduling problem. Soft Comput, pp. 1\u201318"},{"key":"6002_CR23","doi-asserted-by":"crossref","unstructured":"Hosseinabadi AR, Kardgar M, Shojafar M, Shamshirband S, Abraham A (2014) GELS-GA: Hybrid metaheuristic algorithm for solving multiple travelling salesman problem In: IEEE International Conference on Intelligent Systems Design and Applications (ISDA), pp. 76\u201381","DOI":"10.1109\/ISDA.2014.7066271"},{"issue":"2","key":"6002_CR24","first-page":"699","volume":"9","author":"AS Rostami","year":"2015","unstructured":"Rostami AS, Mohanna F, Keshavarz H, Hosseinabadi AR (2015) Solving multiple traveling salesman problem using the gravitational emulation local search algorithm. Appl Math Inf Sci 9(2):699\u2013709","journal-title":"Appl Math Inf Sci"},{"issue":"10","key":"6002_CR25","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1007\/s00521-016-2608-x","volume":"29","author":"AR Hosseinabadi","year":"2018","unstructured":"Hosseinabadi AR, Vahidi J, Balas VE, Mirkamali SS (2018) OVRP\\_GELS: Solving open vehicle routing problem using the gravitational emulation local search algorithm. Neural Comput Appl 29(10):955\u2013968","journal-title":"Neural Comput Appl"},{"issue":"13","key":"6002_CR26","doi-asserted-by":"publisher","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","volume":"179","author":"E Rashedi","year":"2009","unstructured":"Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232\u20132248","journal-title":"Inf Sci"},{"key":"6002_CR27","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/j.promfg.2018.10.061","volume":"17","author":"J Delaram","year":"2018","unstructured":"Delaram J, Fatahi Valilai O (2018) A mathematical model for task scheduling in cloud manufacturing systems focusing on global logistics. Procedia Manuf 17:387\u2013394","journal-title":"Procedia Manuf"},{"key":"6002_CR28","doi-asserted-by":"crossref","unstructured":"Karaboga D, Basturk B (2007) Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems. In: International Fuzzy Systems Association World Congress, pp. 789-798, Springer","DOI":"10.1007\/978-3-540-72950-1_77"},{"issue":"12","key":"6002_CR29","doi-asserted-by":"publisher","first-page":"2948","DOI":"10.1049\/iet-ipr.2020.0223","volume":"14","author":"A Carballal","year":"2020","unstructured":"Carballal A, Pazos-Perez RI, Rodriguez-Fernandez N, Santos I, Garca-Vidaurrazaga MD, Rabunal J (2020) A point-based redesign algorithm for designing geometrically complex surfaces. A case study: Miralles\u2019s croissant paradox. IET Image Process 14(12):2948\u20132956","journal-title":"IET Image Process"},{"key":"6002_CR30","doi-asserted-by":"crossref","unstructured":"Pierezan J, Coelho LDS (2018) Coyote optimization algorithm: A new metaheuristic for global optimization problems. In: Proc. of IEEE Congress on Evolutionary Computation (CEC), Rio de Janeiro, pp. 1\u20138","DOI":"10.1109\/CEC.2018.8477769"},{"key":"6002_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.enconman.2019.111932","volume":"199","author":"J Pierezan","year":"2019","unstructured":"Pierezan J, Maidl G, Yamao EM, Coelho LDS, Mariani VC (2019) Cultural coyote optimization algorithm applied to a heavy duty gas turbine operation. Energy Convers Manage 199:1\u201318","journal-title":"Energy Convers Manage"},{"key":"6002_CR32","volume-title":"Emergence: the connected lives of ants, brains, cities, and software","author":"S Johnson","year":"2012","unstructured":"Johnson S (2012) Emergence: the connected lives of ants, brains, cities, and software. Scribner, New York, NY, USA"},{"key":"6002_CR33","doi-asserted-by":"crossref","unstructured":"Alworafi MA, Dhari A, El-Booz SA, Nasr AA, Arpitha A, Mallappa S (2018) An enhanced task scheduling in cloud computing based on hybrid approach\u201d. Data Analyt Learn, pp. 11-25","DOI":"10.1007\/978-981-13-2514-4_2"},{"key":"6002_CR34","unstructured":"Kundra V (2011) \u201cFederal cloud computing strategy\u201d"},{"key":"6002_CR35","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1016\/j.procs.2015.09.064","volume":"65","author":"AI Awad","year":"2015","unstructured":"Awad AI, El-Hefnawy NA, Abdel-Kader HM (2015) Enhanced particle swarm optimization for task scheduling in cloud computing environments. Procedia Comput Sci 65:920\u2013929","journal-title":"Procedia Comput Sci"},{"key":"6002_CR36","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.procs.2015.04.158","volume":"48","author":"AV Lakraa","year":"2015","unstructured":"Lakraa AV, Yadav DK (2015) Multi-objective tasks scheduling algorithm for cloud computing throughput optimization. Procedia Comput Sci 48:107\u2013113","journal-title":"Procedia Comput Sci"},{"key":"6002_CR37","first-page":"214","volume":"19","author":"T Wang","year":"2018","unstructured":"Wang T, Wei X, Liang T, Fan J (2018) Dynamic tasks scheduling based on weighted bi-graph in mobile cloud computing. Sustain Comput: Inf Syst 19:214\u2013222","journal-title":"Sustain Comput: Inf Syst"},{"key":"6002_CR38","volume-title":"Scheduling: theory, algorithms, and systems","author":"M Pinedo","year":"2008","unstructured":"Pinedo M (2008) Scheduling: theory, algorithms, and systems. Springer, Berlin. https:\/\/www.springer.com\/gp\/book\/9781489990433"},{"key":"6002_CR39","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s12065-019-00216-7","volume":"12","author":"AS Ajeena Beegom","year":"2019","unstructured":"Ajeena Beegom AS, Rajasree MS (2019) Integer-PSO: a discrete PSO algorithm for task scheduling in cloud computing systems\u2019\u2019. Evolut Intell 12:227\u2013239","journal-title":"Evolut Intell"},{"key":"6002_CR40","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1016\/j.apm.2017.02.042","volume":"49","author":"AR Hosseinabadi","year":"2017","unstructured":"Hosseinabadi AR, Rostami NSH, Kardgar M, Mirkamali SS, Abraham A (2017) A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm. Appl Math Model 49:663\u2013679","journal-title":"Appl Math Model"},{"issue":"1","key":"6002_CR41","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10479-014-1770-8","volume":"229","author":"AR Hosseinabadi","year":"2015","unstructured":"Hosseinabadi AR, Siar H, Shamshirband S et al. (2015) Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises. Ann Oper Res 229:451\u2013474. https:\/\/doi.org\/10.1007\/s10479-014-1770-8","journal-title":"Annal Oper Res"},{"key":"6002_CR42","doi-asserted-by":"publisher","first-page":"165","DOI":"10.3390\/sym11020165","volume":"11","author":"AK Sangaiah","year":"2019","unstructured":"Sangaiah AK, Suraki MY, Sadeghilalimi M, Bozorgi SM, Hosseinabadi AAR, Wang J (2019) A new meta-heuristic algorithm for solving the flexible dynamic job-shop problem with parallel machines. Symmetry 11:165. https:\/\/doi.org\/10.3390\/sym11020165","journal-title":"Symmetry"},{"issue":"3","key":"6002_CR43","first-page":"315","volume":"11","author":"MN Nategh","year":"2018","unstructured":"Nategh MN, Hosseinabadi AR, Balas VE (2018) Ant\\_VRP: ant-colony-based meta-heuristic algorithm to solve the vehicle routing problem. Int J Adv Intel Paradig 11(3):315\u2013334","journal-title":"Int J Adv Intel Paradig"},{"key":"6002_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/su10051366","volume":"10","author":"EB Tirkolaee","year":"2018","unstructured":"Tirkolaee EB, Hosseinabadi AR, Soltani M, Sangaiah AK, Wang J (2018) A hybrid genetic algorithm for multi-trip green capacitated arc routing problem in the scope of urban services. Sustainability 10:1\u201321","journal-title":"Sustainability"},{"key":"6002_CR45","first-page":"357","volume":"104","author":"G Narendrababu Reddy","year":"2018","unstructured":"Narendrababu Reddy G, Phani Kumar S (2018) Modified ant colony optimization algorithm for task scheduling in cloud computing systems. Smart Intel Comput Appl 104:357\u2013365","journal-title":"Smart Intel Comput Appl"},{"key":"6002_CR46","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.knosys.2019.01.023","volume":"169","author":"M Abd Elaziz","year":"2019","unstructured":"Abd Elaziz M, Xiong S, Jayasena KPN, Li L (2019) Task scheduling in cloud computing based on hybrid moth search algorithm and differential evolution. Knowl-Based Syst 169:39\u201352","journal-title":"Knowl-Based Syst"},{"key":"6002_CR47","doi-asserted-by":"publisher","first-page":"175454","DOI":"10.1109\/ACCESS.2019.2957722","volume":"7","author":"AR Hosseinabadi","year":"2019","unstructured":"Hosseinabadi AR, Slowik A, Sadeghilalimi M, Farokhzad M, Babazadeh M, Sangaiah AK (2019) \u201cAn ameliorative hybrid meta-heuristic algorithm for solving the capacitated vehicle routing problem. IEEE Access 7:175454\u2013175465","journal-title":"IEEE Access"},{"key":"6002_CR48","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1007\/s10586-019-02983-5","volume":"23","author":"X Huang","year":"2020","unstructured":"Huang X, Li C, Chen H, An D (2020) Task scheduling in cloud computing using particle swarm optimization with time varying inertia weight strategies. Cluster Comput 23:1137\u20131147","journal-title":"Cluster Comput"},{"key":"6002_CR49","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1016\/j.asoc.2019.04.027","volume":"80","author":"H Peng","year":"2019","unstructured":"Peng H, Wena W, Tseng M, Li L (2019) Joint optimization method for task scheduling time and energy consumption in mobile cloud computing environment. Appl Soft Comput 80:534\u2013545","journal-title":"Appl Soft Comput"},{"key":"6002_CR50","doi-asserted-by":"crossref","unstructured":"Sanaj MS, Joe\u00a0Prathap PM, Jayasena KPN, Li L (2019) Nature inspired chaotic squirrel search algorithm (CSSA) for multi objective task scheduling in an IAAS cloud computing atmosphere. Engineering Science and Technology, an International Journal","DOI":"10.1016\/j.jestch.2019.11.002"}],"updated-by":[{"DOI":"10.1007\/s00521-021-06790-1","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2021,12,23]],"date-time":"2021-12-23T00:00:00Z","timestamp":1640217600000}}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-06002-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-021-06002-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-06002-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,24]],"date-time":"2021-12-24T07:03:27Z","timestamp":1640329407000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-021-06002-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,18]]},"references-count":50,"journal-issue":{"issue":"19","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["6002"],"URL":"https:\/\/doi.org\/10.1007\/s00521-021-06002-w","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s00521-021-06790-1","asserted-by":"object"}]},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,18]]},"assertion":[{"value":"5 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2021","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\/s00521-021-06790-1","URL":"https:\/\/doi.org\/10.1007\/s00521-021-06790-1","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"In the present work, we have not used any material from previously published. So we have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}