{"entities":{"Q2224310":{"pageid":2235053,"ns":120,"title":"Item:Q2224310","lastrevid":73832592,"modified":"2026-04-14T17:25:32Z","type":"item","id":"Q2224310","labels":{"en":{"language":"en","value":"Solving large-scale 0-1 knapsack problem by the social-spider optimisation algorithm"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7305554"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2224310$BECD4644-B805-45CE-8ADC-028BA449EFAF","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"aeadeef9165fe008b14a720d4eb448e9533fa578","datavalue":{"value":{"text":"Solving large-scale 0-1 knapsack problem by the social-spider optimisation algorithm","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2224310$8C895414-92AD-4F78-802F-E4783A6242E6","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"9181896d842b2e09a7244287ea8a919223a2e234","datavalue":{"value":"1453.90137","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2224310$F573AF10-DB37-40F6-A532-842AFAF3F759","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"cf221026a78faa42630d8798f6644335668d139c","datavalue":{"value":"10.1504/IJCSM.2018.095497","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2224310$11D6771C-A62D-47D0-A62C-F7221E3EA6D0","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"29be3874131afaa90cf5622264623a7b54213c5c","datavalue":{"value":{"entity-type":"item","numeric-id":2031352,"id":"Q2031352"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2224310$2DA98DFF-E093-45A6-83CA-F47C3993A679","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"58a35d0c04cb35218dbeae68575bdc4193b0fabf","datavalue":{"value":{"entity-type":"item","numeric-id":2224309,"id":"Q2224309"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2224310$212F011C-05DE-4887-B33A-15C1251E175D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d445fc01e968ad041a6cd9408e2e753d4b132037","datavalue":{"value":{"entity-type":"item","numeric-id":459873,"id":"Q459873"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2224310$B3E42EF8-C8AE-4AFB-B934-2BD46E2E4EE3","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"f306f7a0701f0c426c5681c314795b1e314a5dc6","datavalue":{"value":{"entity-type":"item","numeric-id":391694,"id":"Q391694"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2224310$15938CDF-ABCD-4234-B643-9936E25CE37F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"a4fdcf569a0845156edf00801a6025e0e3cf1d2e","datavalue":{"value":{"time":"+2021-02-03T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2224310$77887310-4781-4D7C-A0C6-D7BD3FC86B5E","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"c83d0a162d46cdad03da72667bbcd2d9dc795b1e","datavalue":{"value":"Summary: This paper uses the social-spider optimisation (SSO) algorithm to solve large-scale 0-1 knapsack problems. The SSO algorithm is based on the simulation of cooperative behaviour of social-spiders. In SSO algorithm, individuals emulate a group of spiders which interact to each other based on the biological laws of the cooperative colony. The algorithm considers two different search agents (spiders): males and females. Depending on gender, each individual is conducted by a set of different evolutionary operators which mimic different cooperative behaviour which are typically found in the colony. The experiment results show that the social-spider optimisation algorithm can be an efficient alternative for large-scale 0-1 knapsack problems.","type":"string"},"datatype":"string"},"type":"statement","id":"Q2224310$C8C478AC-39C1-48FB-9869-531B00026A05","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2224310$FD31DC8A-6072-4F6D-BE20-A606C84B44CA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8d42ae7884b9335550c4d21f090798ce9c56a9bf","datavalue":{"value":"90C59","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2224310$176D70FA-E763-4177-8BFF-496E72016BA1","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"5be834d07632cb189d7a548a776fea279c92922d","datavalue":{"value":"7305554","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2224310$D08D66D4-83E3-46D4-9F93-93A7AA4D5ADD","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a713c3cf310c4bbff8b5c3fd105e1a4f588c55ba","datavalue":{"value":"large-scale 0-1 knapsack problems","type":"string"},"datatype":"string"},"type":"statement","id":"Q2224310$8E24DEEB-39F3-49CC-9E28-D7AEF875A850","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d1ca8caaa93807d3b50f88930b811bd12e668ac7","datavalue":{"value":"cooperative behaviour","type":"string"},"datatype":"string"},"type":"statement","id":"Q2224310$5AD61BBE-8989-45A7-954E-281D8A85E25C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"268553eabd97e0fccefc7b009b35f1125a037bba","datavalue":{"value":"social-spider optimisation algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q2224310$9832D394-71FC-4E28-8AF9-4EBDFC138F83","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2224310$82B70654-0EA4-47D3-8432-1C07C13F88BF","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"83e57929a4af3ac966fa0398d157e1a1d152a9c4","datavalue":{"value":"Q129117634","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2224310$573B90A3-7D31-41DF-8697-46EA71F4BB5A","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"7db40bc389ae812cc1e665b285388f26d3737503","datavalue":{"value":{"entity-type":"item","numeric-id":5295791,"id":"Q5295791"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ffdba8a9c035ce9e78920cfb19dd931bfe15d349","datavalue":{"value":{"amount":"+0.865507","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2224310$9CCCEA9F-A500-40A6-B046-765B87A17D77","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"5a66e5a37078c7ae10e165f0b088449d0ef5eb57","datavalue":{"value":{"entity-type":"item","numeric-id":894546,"id":"Q894546"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"5bf6115ba9e86254c76318300ab5298097337318","datavalue":{"value":{"amount":"+0.8641342","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2224310$39FFBCFC-6590-49C6-9632-DEBA28E328FA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"adf8faf2bd1ac6b6ec1953f0de250c55187713f6","datavalue":{"value":{"entity-type":"item","numeric-id":4984226,"id":"Q4984226"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"c2ae321d9fdc410f53c1b0d552c618e228da20ac","datavalue":{"value":{"amount":"+0.85448253","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2224310$568C4FD7-4540-4D4B-B88E-F5118D7D0BC9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f003fab59071e474d5112abe0e076fe1a5149e69","datavalue":{"value":{"entity-type":"item","numeric-id":947962,"id":"Q947962"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"4f7ac646556a45e79b00d510e4cc829e56a6ae48","datavalue":{"value":{"amount":"+0.85381186","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2224310$CFFD0332-3C5F-4A71-94A4-40B75F6CFFEC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"499a3b230faa0de4724ce4f70cce9369c0b39536","datavalue":{"value":{"entity-type":"item","numeric-id":342027,"id":"Q342027"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"6b5d773bf37213f02ec9a85656e722eb03c172fc","datavalue":{"value":{"amount":"+0.8504539","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2224310$699D85DB-5A8A-4E27-9E45-09BBCE3A724C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"cb72134757c5778b6f22c09af345c3cc8885849a","datavalue":{"value":{"entity-type":"item","numeric-id":2859967,"id":"Q2859967"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d76837572e7502c561d314619bd0eb39a16dc95b","datavalue":{"value":{"amount":"+0.8429635","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2224310$9FC9B2E1-D1BF-40D3-9600-8D29453F480B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Solving large-scale 0-1 knapsack problem by the social-spider optimisation algorithm","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Solving_large-scale_0-1_knapsack_problem_by_the_social-spider_optimisation_algorithm"}}}}}