{"id":"https://openalex.org/W2893148000","doi":"https://doi.org/10.1504/ijcsm.2018.10016491","title":"Solving large-scale 0-1 knapsack problem by the social-spider optimisation algorithm","display_name":"Solving large-scale 0-1 knapsack problem by the social-spider optimisation algorithm","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2893148000","doi":"https://doi.org/10.1504/ijcsm.2018.10016491","mag":"2893148000"},"language":"en","primary_location":{"id":"doi:10.1504/ijcsm.2018.10016491","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijcsm.2018.10016491","pdf_url":null,"source":{"id":"https://openalex.org/S84141356","display_name":"International Journal of Computing Science and Mathematics","issn_l":"1752-5055","issn":["1752-5055","1752-5063"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computing Science and Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029467707","display_name":"Yongquan Zhou","orcid":"https://orcid.org/0000-0001-6801-3375"},"institutions":[{"id":"https://openalex.org/I167274908","display_name":"Guangxi Minzu University","ror":"https://ror.org/0495efn48","country_code":"CN","type":"education","lineage":["https://openalex.org/I167274908"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yongquan Zhou","raw_affiliation_strings":["College of Information Science and Engineering, Guangxi University for Nationalities, 530006, Nanning, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering, Guangxi University for Nationalities, 530006, Nanning, China","institution_ids":["https://openalex.org/I167274908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103022173","display_name":"Guo Zhou","orcid":"https://orcid.org/0000-0002-2750-8061"},"institutions":[{"id":"https://openalex.org/I177955009","display_name":"China University of Political Science and Law","ror":"https://ror.org/00e49gy82","country_code":"CN","type":"education","lineage":["https://openalex.org/I177955009"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guo Zhou","raw_affiliation_strings":["Department of Science and Technology Teaching, China University of Political Science and Law, 100088, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Science and Technology Teaching, China University of Political Science and Law, 100088, Beijing, China","institution_ids":["https://openalex.org/I177955009"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056644321","display_name":"Ruixin Zhao","orcid":null},"institutions":[{"id":"https://openalex.org/I167274908","display_name":"Guangxi Minzu University","ror":"https://ror.org/0495efn48","country_code":"CN","type":"education","lineage":["https://openalex.org/I167274908"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ruixin Zhao","raw_affiliation_strings":["College of Information Science and Engineering, Guangxi University for Nationalities, 530006, Nanning, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering, Guangxi University for Nationalities, 530006, Nanning, China","institution_ids":["https://openalex.org/I167274908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.819,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.80000542,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"9","issue":"5","first_page":"433","last_page":"433"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9886999726295471,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9842476844787598},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6547373533248901},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5910977721214294},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.5777938365936279},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5163363218307495},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4984016418457031},{"id":"https://openalex.org/keywords/spider","display_name":"Spider","score":0.4973500072956085},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.42829155921936035},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2502732276916504},{"id":"https://openalex.org/keywords/ecology","display_name":"Ecology","score":0.11743861436843872},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.06487792730331421}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9842476844787598},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6547373533248901},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5910977721214294},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.5777938365936279},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5163363218307495},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4984016418457031},{"id":"https://openalex.org/C2780181586","wikidata":"https://www.wikidata.org/wiki/Q3966705","display_name":"Spider","level":2,"score":0.4973500072956085},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.42829155921936035},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2502732276916504},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.11743861436843872},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.06487792730331421},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1504/ijcsm.2018.10016491","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijcsm.2018.10016491","pdf_url":null,"source":{"id":"https://openalex.org/S84141356","display_name":"International Journal of Computing Science and Mathematics","issn_l":"1752-5055","issn":["1752-5055","1752-5063"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computing Science and Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Gender equality","score":0.44999998807907104,"id":"https://metadata.un.org/sdg/5"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W246960280","https://openalex.org/W2087209118","https://openalex.org/W2168163332","https://openalex.org/W179363847","https://openalex.org/W2381035939","https://openalex.org/W2005493932","https://openalex.org/W2378557713","https://openalex.org/W2141701778","https://openalex.org/W3169691842","https://openalex.org/W2089402478"],"abstract_inverted_index":{"This":[0],"paper":[1],"uses":[2],"the":[3,20,43,47,85,92],"social-spider":[4,93],"optimisation":[5,94],"(SSO)":[6],"algorithm":[7,16,51,95],"to":[8,38],"solve":[9],"large-scale":[10,102],"0-1":[11,103],"knapsack":[12,104],"problems.":[13,105],"The":[14,50,87],"SSO":[15,28],"is":[17,66],"based":[18,41],"on":[19,42,62],"simulation":[21],"of":[22,25,34,46,71],"cooperative":[23,48,78],"behaviour":[24,79],"social-spiders.":[26],"In":[27],"algorithm,":[29],"individuals":[30],"emulate":[31],"a":[32,69],"group":[33],"spiders":[35],"which":[36,75,80],"interact":[37],"each":[39,64],"other":[40],"biological":[44],"laws":[45],"colony.":[49,86],"considers":[52],"two":[53],"different":[54,72,77],"search":[55],"agents":[56],"(spiders):":[57],"males":[58],"and":[59],"females.":[60],"Depending":[61],"gender,":[63],"individual":[65],"conducted":[67],"by":[68],"set":[70],"evolutionary":[73],"operators":[74],"mimic":[76],"are":[81],"typically":[82],"found":[83],"in":[84],"experiment":[88],"results":[89],"show":[90],"that":[91],"can":[96],"be":[97],"an":[98],"efficient":[99],"alternative":[100],"for":[101]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}