{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:38:40Z","timestamp":1743079120851,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031366215"},{"type":"electronic","value":"9783031366222"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-36622-2_28","type":"book-chapter","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T12:02:36Z","timestamp":1688731356000},"page":"345-355","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Beam-GBAS for Multidimensional Knapsack Problems"],"prefix":"10.1007","author":[{"given":"Jianjun","family":"Cao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3854-2772","authenticated-orcid":false,"given":"Chumei","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Baowei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zhen","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Nianfeng","family":"Weng","sequence":"additional","affiliation":[]},{"given":"Yuxin","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,8]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Yang, L., Li, K., Zhang, W., et al.: An improved chaotic ACO clustering algorithm. In: 20th International Conference on High Performance Computing and Communications, pp. 1642\u20131649. IEEE (2018)","DOI":"10.1109\/HPCC\/SmartCity\/DSS.2018.00267"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Manuel, L., Christian, B., Dhananjay, T., et al.: Beam-ACO based on stochastic sampling for makespan optimization concerning the TSP with time windows. In: Proceedings of Conference on LNCS, pp. 97\u2013108 (2009)","DOI":"10.1007\/978-3-642-01009-5_9"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Liu, R., Li, L., Zhao, Y., et al.: Beam-ACO for the lock chamber arrangement. In: 3rd International Conference on Computer and Communication Engineering Technology, pp. 186\u2013189. IEEE (2020)","DOI":"10.1109\/CCET50901.2020.9213160"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Dhananjay, T., Christian, B., Bernd, M., et al.: Hybridizing beam-ACO with constraint programming for single machine job scheduling. In: Proceedings of Conference on LNCS, pp. 30\u201344 (2009)","DOI":"10.1007\/978-3-642-04918-7_3"},{"issue":"8","key":"28_CR5","first-page":"1900","volume":"22","author":"H Sun","year":"2016","unstructured":"Sun, H., Han, J.: Virtual resequencing in automobile paint shops based on beam search-based algorithm. Comput. Integr. Manuf. Syst. 22(8), 1900\u20131906 (2016)","journal-title":"Comput. Integr. Manuf. Syst."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Manuel, L., Christian, B.: Beam-ACO based on stochastic sampling: a case study on the TSP with time windows. In: Proceedings of the Conference on LNCS, pp. 59\u201373 (2009)","DOI":"10.1007\/978-3-642-11169-3_5"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Hajewski, J., Oliveira, S., Stewart, D.E., et al.: gBeam-ACO: a greedy and faster variant of beam-ACO. In: Proceedings of the 20th Conference on GECCO, pp. 1434\u20131440 (2020)","DOI":"10.1145\/3377929.3398081"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Hajewski, J., Oliveira, S., Stewart, D.E, et al.: Exploring trade-offs in parallel beam-ACO. In: Proceedings of the 11th Annual Computing and Communication Workshop and Conference (CCWC), pp. 1525\u20131534 (2021)","DOI":"10.1109\/CCWC51732.2021.9376177"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Blum, C., Blesa, M.J., Calvo, B., et al.: Beam-ACO for therepetition-free longest common subsequence problem. In: Proceedings of the Conference on EA, pp. 79\u201390 (2014)","DOI":"10.1007\/978-3-319-11683-9_7"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Simoes, L.F., Izzo, D., Haasdijk, E., et al.: Multi-rendezvousspacecraft trajectory optimization with Beam P-ACO. In: Proceedings of the Conference on EvoCOP, pp. 141\u2013156 (2017)","DOI":"10.1007\/978-3-319-55453-2_10"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Caldeira, J., Azevedo, R., Silva, C.A., et al.: Beam-ACO distributedoptimization applied to supply-chain management. In: Proceedings of the Conference on IFSA, pp. 799-809 (2007)","DOI":"10.1007\/978-3-540-72950-1_78"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Blum, C., Bautista, J., Pereira, J.: An extended Beam-ACO approachto the time and space constrained simple assembly line balancing problem. In: Proceedings of the Conference on EvoCOP, pp. 85\u201396 (2008)","DOI":"10.1007\/978-3-540-78604-7_8"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Blum, C., Bautista, J., Pereira, J.: Beam-ACO appliedto assembly line balancing. In: Proceedings of the Conference on ANTS, pp. 96-107 (2006)","DOI":"10.1007\/11839088_9"},{"issue":"7","key":"28_CR14","first-page":"1178","volume":"31","author":"Z Ren","year":"2016","unstructured":"Ren, Z., Zhao, S., Huang, S., et al.: Hybrid optimization algorithm of ant colony optimization and Lagrangian relaxation for solving multidimensional knapsack problem. Control Decis. 31(7), 1178\u20131184 (2016)","journal-title":"Control Decis."},{"issue":"5","key":"28_CR15","first-page":"1291","volume":"40","author":"Y Yang","year":"2020","unstructured":"Yang, Y., Liu, J., Zhou, Y.: Greedy binary lion swarm optimization algorithm for solving multidimensional knapsack problem. J. Comput. Appl. 40(5), 1291\u20131294 (2020)","journal-title":"J. Comput. Appl."},{"issue":"22","key":"28_CR16","first-page":"6146","volume":"20","author":"J Cao","year":"2008","unstructured":"Cao, J., Zhang, P., Wang, Y., et al.: Graph-based ant system for subset problems. J. Syst. Simul. 20(22), 6146\u20136150 (2008)","journal-title":"J. Syst. Simul."},{"issue":"7","key":"28_CR17","first-page":"858","volume":"56","author":"Q Yan","year":"2022","unstructured":"Yan, Q., Lu, J., Jiang, W., et al.: Path optimization of stacker in compact storage system with dual-port layout. J. Shanghai Jiao Tong Univ. 56(7), 858\u2013867 (2022)","journal-title":"J. Shanghai Jiao Tong Univ."},{"issue":"9","key":"28_CR18","first-page":"113","volume":"35","author":"K Wu","year":"2021","unstructured":"Wu, K., Zhou, X., Li, Z., et al.: Path selection for Chinese knowledge base question answering. J. Chin. Inf. Process. 35(9), 113\u2013122 (2021)","journal-title":"J. Chin. Inf. Process."}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36622-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T20:18:36Z","timestamp":1729714716000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36622-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031366215","9783031366222"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36622-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","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":"14 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2023","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":"swarm2023","order":10,"name":"conference_id","label":"Conference ID","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":"170","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":"81","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":"0","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.6","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":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}