{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T18:10:07Z","timestamp":1732126207131,"version":"3.28.0"},"reference-count":30,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1016\/j.asoc.2024.112136","type":"journal-article","created":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T05:05:22Z","timestamp":1724475922000},"page":"112136","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A parallel social spider algorithm based on population mining"],"prefix":"10.1016","volume":"166","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-2819-927X","authenticated-orcid":false,"given":"Zhi-bin","family":"Huang","sequence":"first","affiliation":[]},{"given":"Yi-Ming","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Tian-Liang","family":"Huang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"12","key":"10.1016\/j.asoc.2024.112136_b1","doi-asserted-by":"crossref","first-page":"1919","DOI":"10.3390\/electronics11121919","article-title":"Recent advances in harris hawks optimization: A comparative study and applications","volume":"11","author":"Hussien","year":"2022","journal-title":"Electronics"},{"key":"10.1016\/j.asoc.2024.112136_b2","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2021.100844","article-title":"A survey on population-based meta-heuristic algorithms for motion planning of aircraft","volume":"62","author":"Wu","year":"2021","journal-title":"Swarm Evol. Comput."},{"issue":"4","key":"10.1016\/j.asoc.2024.112136_b3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3400031","article-title":"Parallel genetic algorithms: a useful survey","volume":"53","author":"Harada","year":"2020","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"10.1016\/j.asoc.2024.112136_b4","article-title":"Velocity tentative PSO: An optimal velocity implementation based particle swarm optimization to solve traveling salesman problem","volume":"42","author":"Akhand","year":"2015","journal-title":"IAENG Int. J. Comput. Sci."},{"key":"10.1016\/j.asoc.2024.112136_b5","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1016\/j.asoc.2015.02.014","article-title":"A social spider algorithm for global optimization","volume":"30","author":"James","year":"2015","journal-title":"Appl. Soft Comput."},{"year":"2019","series-title":"Ant Colony Optimization: Overview and Recent Advances","author":"Dorigo","key":"10.1016\/j.asoc.2024.112136_b6"},{"key":"10.1016\/j.asoc.2024.112136_b7","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.jpdc.2016.04.014","article-title":"The GPU-based parallel ant colony system","volume":"98","author":"Skinderowicz","year":"2016","journal-title":"J. Parallel Distrib. Comput."},{"issue":"03","key":"10.1016\/j.asoc.2024.112136_b8","doi-asserted-by":"crossref","DOI":"10.1142\/S1469026821500206","article-title":"Discrete social spider algorithm for solving traveling salesman problem","volume":"20","author":"Khosravanian","year":"2021","journal-title":"Int. J. Comput. Intell. Appl."},{"key":"10.1016\/j.asoc.2024.112136_b9","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.113618","article-title":"A binary social spider algorithm for uncapacitated facility location problem","volume":"161","author":"Ba\u015f","year":"2020","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2024.112136_b10","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.110549","article-title":"A local binary social spider algorithm for feature selection in credit scoring model","volume":"144","author":"Zhang","year":"2023","journal-title":"Appl. Soft Comput."},{"issue":"5","key":"10.1016\/j.asoc.2024.112136_b11","doi-asserted-by":"crossref","first-page":"3539","DOI":"10.1007\/s10462-020-09931-5","article-title":"Improved social spider algorithm for large scale optimization","volume":"54","author":"Ba\u015f","year":"2021","journal-title":"Artif. Intell. Rev."},{"issue":"7","key":"10.1016\/j.asoc.2024.112136_b12","doi-asserted-by":"crossref","first-page":"2250","DOI":"10.1080\/00207543.2022.2069059","article-title":"Improved social spider algorithm for partial disassembly line balancing problem considering the energy consumption involved in tool switching","volume":"61","author":"Liang","year":"2023","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.asoc.2024.112136_b13","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/j.epsr.2016.09.002","article-title":"Social spider algorithm for solving the transmission expansion planning problem","volume":"143","author":"El-Bages","year":"2017","journal-title":"Electr. Power Syst. Res."},{"key":"10.1016\/j.asoc.2024.112136_b14","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1016\/j.neucom.2015.07.037","article-title":"A social spider algorithm for solving the non-convex economic load dispatch problem","volume":"171","author":"James","year":"2016","journal-title":"Neurocomputing"},{"issue":"4","key":"10.1016\/j.asoc.2024.112136_b15","first-page":"1672","article-title":"Modified social spider algorithm for solving the economic dispatch problem","volume":"19","author":"Elsayed","year":"2016","journal-title":"Eng. Sci. Technol. Int. J."},{"issue":"4","key":"10.1016\/j.asoc.2024.112136_b16","first-page":"713","article-title":"Multi-level image thresholding based on social spider algorithm for global optimization","volume":"11","author":"Rahkar Farshi","year":"2019","journal-title":"Int. J. Inf. Technol."},{"key":"10.1016\/j.asoc.2024.112136_b17","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1016\/j.procs.2023.01.037","article-title":"EVMPCSA: Efficient VM packing mechanism in cloud computing using chaotic social spider algorithm","volume":"218","author":"Mangalampalli","year":"2023","journal-title":"Procedia Comput. Sci."},{"issue":"3","key":"10.1016\/j.asoc.2024.112136_b18","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1504\/IJAHUC.2020.108424","article-title":"Detection of malware applications using social spider algorithm in mobile cloud computing environment","volume":"34","author":"Nisha","year":"2020","journal-title":"Int. J. Ad Hoc Ubiquitous Comput."},{"issue":"1","key":"10.1016\/j.asoc.2024.112136_b19","doi-asserted-by":"crossref","DOI":"10.1080\/23311916.2019.1588681","article-title":"An adaptive bio-inspired optimisation model based on the foraging behaviour of a social spider","volume":"6","author":"Otor","year":"2019","journal-title":"Cogent Eng."},{"issue":"2","key":"10.1016\/j.asoc.2024.112136_b20","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1007\/s10462-020-09869-8","article-title":"D\u0131screte soc\u0131al sp\u0131der algor\u0131thm for the travel\u0131ng salesman problem","volume":"54","author":"Ba\u015f","year":"2021","journal-title":"Artif. Intell. Rev."},{"key":"10.1016\/j.asoc.2024.112136_b21","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.122744","article-title":"Deadlock control and hybrid social spider scheduling algorithm for two-stage assembly permutation flowshop with limited buffers","volume":"245","author":"Cao","year":"2024","journal-title":"Expert Syst. Appl."},{"issue":"16","key":"10.1016\/j.asoc.2024.112136_b22","doi-asserted-by":"crossref","first-page":"6374","DOI":"10.1016\/j.eswa.2013.05.041","article-title":"A swarm optimization algorithm inspired in the behavior of the social-spider","volume":"40","author":"Cuevas","year":"2013","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"10.1016\/j.asoc.2024.112136_b23","doi-asserted-by":"crossref","DOI":"10.1002\/cpe.7481","article-title":"A predictive vampire attack detection by social spider optimized Gaussian mixture model clustering","volume":"35","author":"Juneja","year":"2023","journal-title":"Concurr. Comput.: Pract. Exper."},{"key":"10.1016\/j.asoc.2024.112136_b24","first-page":"1","article-title":"An enhanced QoS approach for multi-objective optimization using social spider optimization 5G enable IoMT network","author":"Jena","year":"2024","journal-title":"Int. J. Inf. Technol."},{"issue":"1","key":"10.1016\/j.asoc.2024.112136_b25","doi-asserted-by":"crossref","first-page":"5032","DOI":"10.1038\/s41598-024-54910-3","article-title":"Hippopotamus optimization algorithm: a novel nature-inspired optimization algorithm","volume":"14","author":"Amiri","year":"2024","journal-title":"Sci. Rep."},{"key":"10.1016\/j.asoc.2024.112136_b26","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.engappai.2015.10.006","article-title":"An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems","volume":"48","author":"Osaba","year":"2016","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"7","key":"10.1016\/j.asoc.2024.112136_b27","doi-asserted-by":"crossref","DOI":"10.1002\/cpe.4974","article-title":"Parallel iterative hill climbing algorithm to solve TSP on GPU","volume":"31","author":"Yelmewad","year":"2019","journal-title":"Concurr. Comput.: Pract. Exper."},{"key":"10.1016\/j.asoc.2024.112136_b28","first-page":"1","article-title":"Novel hybrid classifier based on fuzzy type-III decision maker and ensemble deep learning model and improved chaos game optimization","author":"Mehrabi Hashjin","year":"2024","journal-title":"Cluster Comput."},{"key":"10.1016\/j.asoc.2024.112136_b29","series-title":"2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum","first-page":"1788","article-title":"High performance GPU accelerated local optimization in TSP","author":"Rocki","year":"2013"},{"key":"10.1016\/j.asoc.2024.112136_b30","doi-asserted-by":"crossref","unstructured":"M.A. O\u2019Neil, M. Burtscher, Rethinking the parallelization of random-restart hill climbing: a case study in optimizing a 2-opt TSP solver for GPU execution, in: Proceedings of the 8th Workshop on General Purpose Processing using GPUs, 2015, pp. 99\u2013108.","DOI":"10.1145\/2716282.2716287"}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494624009104?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494624009104?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T17:53:06Z","timestamp":1732125186000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494624009104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":30,"alternative-id":["S1568494624009104"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2024.112136","relation":{},"ISSN":["1568-4946"],"issn-type":[{"type":"print","value":"1568-4946"}],"subject":[],"published":{"date-parts":[[2024,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A parallel social spider algorithm based on population mining","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2024.112136","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"112136"}}