{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:38:28Z","timestamp":1742913508986,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819708369"},{"type":"electronic","value":"9789819708376"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-0837-6_17","type":"book-chapter","created":{"date-parts":[[2024,2,21]],"date-time":"2024-02-21T06:02:43Z","timestamp":1708495363000},"page":"243-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Ant-Antlion Optimizer with Similarity Information for Multidimensional Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Yi","family":"Liu","sequence":"first","affiliation":[]},{"given":"Guoli","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Qibin","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Xiang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Kun","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Qiang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Qin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,22]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"105692","DOI":"10.1016\/j.cor.2021.105692","volume":"143","author":"V Cacchiani","year":"2022","unstructured":"Cacchiani, V., Iori, M., Locatelli, A., Martello, S.: Knapsack problems \u2014 an overview of recent advances. Part I: single knapsack problems. Comput. Oper. Res. 143, 105692 (2022)","journal-title":"Comput. Oper. Res."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Liu, Y., Zheng, Q., Li, G., Zhang, J., Ren, X., Qin, W.: Discrete baby search algorithm for combinatorial optimization problems. In: 2022 3rd International Conference on Big Data, Artificial Intelligence and Internet of Things Engineering (ICBAIE), pp. 595\u2013599. IEEE (2022)","DOI":"10.1109\/ICBAIE56435.2022.9985880"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Liu, Y., Li, M., Zheng, Q., Qin, W., Wang, J.: Baby search algorithm. In: 2021 4th International Conference on Advanced Electronic Materials, Computers and Software Engineering (AEMCSE), pp. 502\u2013508. IEEE (2021)","DOI":"10.1109\/AEMCSE51986.2021.00109"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.advengsoft.2015.01.010","volume":"83","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili, S.: The ant lion optimizer. Adv. Eng. Softw. 83, 80\u201398 (2015)","journal-title":"Adv. Eng. Softw."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"2717","DOI":"10.1587\/transinf.2020EDL8055","volume":"E103-D","author":"M Li","year":"2020","unstructured":"Li, M., Ren, X., Wang, Y., Qin, W., Liu, Y.: Advanced antlion optimizer with discrete ant behavior for feature selection. IEICE Trans. Inf. Syst. E103-D, 2717\u20132720 (2020)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"105645","DOI":"10.1016\/j.asoc.2019.105645","volume":"83","author":"K Luo","year":"2019","unstructured":"Luo, K., Zhao, Q.: A binary grey wolf optimizer for the multidimensional knapsack problem. Appl. Soft Comput. 83, 105645 (2019)","journal-title":"Appl. Soft Comput."},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Shahbandegan, A., Naderi, M.: A binary butterfly optimization algorithm for the multidimensional knapsack problem. In: 2020 6th Iranian Conference on Signal Processing and Intelligent Systems (ICSPIS), pp. 1\u20135. IEEE (2020)","DOI":"10.1109\/ICSPIS51611.2020.9349589"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.future.2021.07.033","volume":"126","author":"Y Feng","year":"2022","unstructured":"Feng, Y., Wang, G.: A binary moth search algorithm based on self-learning for multidimensional knapsack problems. Future Gener. Comput. Syst. 126, 48\u201364 (2022)","journal-title":"Future Gener. Comput. Syst."},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/s00366-019-00853-7","volume":"37","author":"Y He","year":"2021","unstructured":"He, Y., Zhang, X., Li, W., Wang, J., Li, N.: An efficient binary differential evolution algorithm for the multidimensional knapsack problem. Eng. Comput. 37, 745\u2013761 (2021). https:\/\/doi.org\/10.1007\/s00366-019-00853-7","journal-title":"Eng. Comput."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s12065-019-00222-9","volume":"12","author":"I Ben Mansour","year":"2019","unstructured":"Ben Mansour, I., Alaya, I., Tagina, M.: A gradual weight-based ant colony approach for solving the multiobjective multidimensional knapsack problem. Evol. Intell. 12, 253\u2013272 (2019). https:\/\/doi.org\/10.1007\/s12065-019-00222-9","journal-title":"Evol. Intell."},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"107077","DOI":"10.1016\/j.asoc.2020.107077","volume":"102","author":"J Garc\u00eda","year":"2021","unstructured":"Garc\u00eda, J., Maureira, C.: A KNN quantum cuckoo search algorithm applied to the multidimensional knapsack problem. Appl. Soft Comput. 102, 107077 (2021)","journal-title":"Appl. Soft Comput."},{"issue":"4","key":"17_CR12","doi-asserted-by":"publisher","first-page":"2284","DOI":"10.1109\/TCYB.2020.3002495","volume":"52","author":"Z Li","year":"2020","unstructured":"Li, Z., Tang, L., Liu, J.: A memetic algorithm based on probability learning for solving the multidimensional knapsack problem. IEEE Trans. Cybern. 52(4), 2284\u20132299 (2020)","journal-title":"IEEE Trans. Cybern."},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"109682","DOI":"10.1016\/j.asoc.2022.109682","volume":"130","author":"S Gupta","year":"2022","unstructured":"Gupta, S., Su, R., Singh, S.: Diversified sine-cosine algorithm based on differential evolution for multidimensional knapsack problem. Appl. Soft Comput. 130, 109682 (2022)","journal-title":"Appl. Soft Comput."},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"113310","DOI":"10.1016\/j.eswa.2020.113310","volume":"149","author":"X Lai","year":"2020","unstructured":"Lai, X., Hao, J., Fu, Z., Yue, D.: Diversity-preserving quantum particle swarm optimization for the multidimensional knapsack problem. Expert Syst. Appl. 149, 113310 (2020)","journal-title":"Expert Syst. Appl."},{"issue":"8","key":"17_CR15","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1587\/transinf.2021EDL8095","volume":"E105-D","author":"Y Liu","year":"2022","unstructured":"Liu, Y., Qin, W., Zheng, Q., Li, G., Li, M.: An interpretable feature selection based on particle swarm optimization. IEICE Trans. Inf. Syst. E105-D(8), 1495\u20131500 (2022)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"17_CR16","unstructured":"Beasley, J.E.: Orlib operations research library, (2005). http:\/\/people.brunel.ac.uk\/\u223cmastjjb\/jeb\/orlib\/mknapinfo.html"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Nand, R., Sharma, P.: Iteration split with firefly algorithm and genetic algorithm to solve multidimensional knapsack problems. In: 2019 IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE), pp. 1\u20137. IEEE (2019)","DOI":"10.1109\/CSDE48274.2019.9162422"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Baroni, M.D.V., Varej\u00e3o, F.M.: A shuffled complex evolution algorithm for the multidimensional knapsack problem using core concept. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 2718\u20132723. IEEE (2016)","DOI":"10.1109\/CEC.2016.7744131"},{"issue":"3","key":"17_CR19","first-page":"486","volume":"18","author":"ME Berberler","year":"2013","unstructured":"Berberler, M.E., Guler, A., Nuriyev, U.G.: A genetic algorithm to solve the multidimensional knapsack problem. Math. Comput. Appl. 18(3), 486\u2013494 (2013)","journal-title":"Math. Comput. Appl."},{"key":"17_CR20","first-page":"11042","volume":"218","author":"JC Bansal","year":"2012","unstructured":"Bansal, J.C., Deep, K.: A modified binary particle swarm optimization for knapsack problems. Appl. Math. Comput. 218, 11042\u201311061 (2012)","journal-title":"Appl. Math. Comput."},{"issue":"14","key":"17_CR21","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.3390\/math9131456","volume":"9","author":"S Fidanova","year":"2021","unstructured":"Fidanova, S., Atanassov, K.T.: ACO with intuitionistic fuzzy pheromone updating applied on multiple-constraint knapsack problem. Mathematics 9(14), 1456 (2021)","journal-title":"Mathematics"}],"container-title":["Communications in Computer and Information Science","Data Mining and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0837-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,12]],"date-time":"2024-11-12T01:40:21Z","timestamp":1731375621000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0837-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819708369","9789819708376"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0837-6_17","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DMBD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Data Mining and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sanya","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dmbd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iasei.org\/dmbd2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"79","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}