{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:44:27Z","timestamp":1743039867212,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811513763"},{"type":"electronic","value":"9789811513770"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-981-15-1377-0_11","type":"book-chapter","created":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T07:03:36Z","timestamp":1573628616000},"page":"143-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Bat Algorithm for Multiple Knapsack Problems"],"prefix":"10.1007","author":[{"given":"Sicong","family":"Li","sequence":"first","affiliation":[]},{"given":"Saihua","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Ruizhi","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Gang","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Zeqiu","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Xiaochen","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,14]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004). https:\/\/doi.org\/10.1007\/978-3-540-24777-7"},{"key":"11_CR2","first-page":"598","volume":"228","author":"S Sitarz","year":"2014","unstructured":"Sitarz, S.: Multiple criteria dynamic programming and multiple knapsack problem. Appl. Math. Comput. 228, 598\u2013605 (2014)","journal-title":"Appl. Math. Comput."},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-642-38679-4_55","volume-title":"Advances in Computational Intelligence","author":"Y Laalaoui","year":"2013","unstructured":"Laalaoui, Y.: Improved swap heuristic for the multiple knapsack problem. In: Rojas, I., Joya, G., Gabestany, J. (eds.) IWANN 2013. LNCS, vol. 7902, pp. 547\u2013555. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38679-4_55"},{"key":"11_CR4","unstructured":"Xiong, W., Wei, P., Jiang, B.: Binary ant colony algorithm with congestion control strategy for the 0\/1 multiple knapsack problems. In: 8th World Congress on Intelligent Control and Automation, pp. 3296\u20133301. IEEE, Jinan (2010)"},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1587\/transinf.E97.D.455","volume":"3","author":"Q Liu","year":"2014","unstructured":"Liu, Q., Odaka, T., Kuroiwa, J., Shirai, H., Ogura, H.: A new artificial fish swarm algorithm for the multiple knapsack problem. IEICE Trans. Inf. Syst. D 3, 455\u2013468 (2014)","journal-title":"IEICE Trans. Inf. Syst. D"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Fukunaga, A., Tazoe, S.: Combining multiple representations in a genetic algorithm for the multiple knapsack problem. In: 2009 IEEE Congress on Evolutionary Computation, pp. 2423+. IEEE, Trondheim (2009)","DOI":"10.1109\/CEC.2009.4983244"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s40747-017-0050-z","volume":"4","author":"R Rizk-Allah","year":"2017","unstructured":"Rizk-Allah, R., Hassanien, A.: New binary bat algorithm for solving 0\u20131 knapsack problem. Complex Intell. Syst. 4(1), 31\u201353 (2017)","journal-title":"Complex Intell. Syst."},{"issue":"4","key":"11_CR8","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1166\/jmihi.2019.2654","volume":"9","author":"W Bangyal","year":"2019","unstructured":"Bangyal, W., Ahmad, J., Rauf, H.: Optimization of neural network using improved bat algorithm for data classification. J. Med. Imaging Health Inform. 9(4), 670\u2013681 (2019)","journal-title":"J. Med. Imaging Health Inform."},{"issue":"9","key":"11_CR9","doi-asserted-by":"publisher","first-page":"2226","DOI":"10.1364\/AO.58.002226","volume":"58","author":"L Huang","year":"2019","unstructured":"Huang, L., Wang, P., Liu, A., Nan, X., Jiao, L., Guo, L.: Indoor three-dimensional high-precision positioning system with bat algorithm based on visible light communication. Appl. Opt. 58(9), 2226\u20132234 (2019)","journal-title":"Appl. Opt."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Fusai, D.: The application research of improved bat algorithm based on chaos for job shop scheduling. In: 3rd Workshop on Advanced Research and Technology in Industry Applications, Guilin, China, pp. 353\u2013356 (2017)","DOI":"10.2991\/wartia-17.2017.67"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.eswa.2018.03.015","volume":"104","author":"C Gan","year":"2018","unstructured":"Gan, C., Cao, W., Wu, M., Chen, X.: A new bat algorithm based on iterative local search and stochastic inertia weight. Expert Syst. Appl. 104, 202\u2013212 (2018)","journal-title":"Expert Syst. Appl."},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.eswa.2016.10.050","volume":"69","author":"A Chakri","year":"2017","unstructured":"Chakri, A., Khelif, R., Benouaret, M., Yang, X.: New directional bat algorithm for continuous optimization problems. Expert Syst. Appl. 69, 159\u2013175 (2017)","journal-title":"Expert Syst. Appl."},{"issue":"3\u20134","key":"11_CR13","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/s00521-013-1525-5","volume":"25","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili, S., Mirjalili, S.M., Yang, X.: Binary bat algorithm. Neural Comput. Appl. 25(3\u20134), 663\u2013681 (2014)","journal-title":"Neural Comput. Appl."},{"issue":"3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/s10489-016-0855-2","volume":"46","author":"Y Zhou","year":"2017","unstructured":"Zhou, Y., Bao, Z., Luo, Q., Zhang, S.: A complex-valued encoding wind driven optimization for the 0\u20131 knapsack problem. Appl. Intell. 46(3), 684\u2013702 (2017)","journal-title":"Appl. Intell."},{"key":"11_CR15","first-page":"1","volume":"8","author":"X Huang","year":"2017","unstructured":"Huang, X., Zeng, X., Han, R.: Dynamic inertia weight binary bat algorithm with neighborhood search. Comput. Intell. Neurosci. 8, 1\u201315 (2017)","journal-title":"Comput. Intell. Neurosci."},{"issue":"3","key":"11_CR16","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/S0377-2217(98)00120-9","volume":"114","author":"D Pisinger","year":"1999","unstructured":"Pisinger, D.: An exact algorithm for large multiple knapsack problems. Eur. J. Oper. Res. 114(3), 528\u2013541 (1999)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Communications in Computer and Information Science","Computer Supported Cooperative Work and Social Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-1377-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,4]],"date-time":"2022-10-04T21:02:01Z","timestamp":1664917321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-1377-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9789811513763","9789811513770"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-1377-0_11","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ChineseCSCW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"CCF Conference on Computer Supported Cooperative Work and Social Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kunming","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"chinesecscw2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.scholat.com\/confweb\/CCSCW2019","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}