{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T06:19:40Z","timestamp":1774160380088,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789811941085","type":"print"},{"value":"9789811941092","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-19-4109-2_30","type":"book-chapter","created":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T14:38:26Z","timestamp":1659364706000},"page":"327-344","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Adaptive Search Algorithm with Scatter and Tabu Strategy for Multidimensional Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Song","family":"He","sequence":"first","affiliation":[]},{"given":"Wei","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,1]]},"reference":[{"issue":"2","key":"30_CR1","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"GB Dantzig","year":"1957","unstructured":"Dantzig, G.B.: Discrete-variable extremum problems. Oper. Res. 5(2), 266\u2013288 (1957)","journal-title":"Oper. Res."},{"issue":"1","key":"30_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.cor.2011.01.019","volume":"39","author":"L Davis","year":"2012","unstructured":"Davis, L., Samanlioglu, F., Jiang, X., et al.: A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP). Comput. Oper. Res. 39(1), 93\u2013104 (2012)","journal-title":"Comput. Oper. Res."},{"key":"30_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100802","volume":"60","author":"M Alinaghian","year":"2021","unstructured":"Alinaghian, M., Tirkolaee, E.B., Dezaki, Z.K., et al.: An augmented Tabu search algorithm for the green inventory-routing problem with time windows. Swarm Evol. Comput. 60, 100802 (2021)","journal-title":"Swarm Evol. Comput."},{"key":"30_CR4","series-title":"Intelligent Systems, Control and Automation: Science and Engineering","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-94-017-8044-5_10","volume-title":"Optimization and Control Methods in Industrial Engineering and Construction","author":"C Wu","year":"2014","unstructured":"Wu, C., Wang, X., Lin, J.: Optimizations in project scheduling: a state-of-art survey. In: Xu, H., Wang, X. (eds.) Optimization and Control Methods in Industrial Engineering and Construction. ISCASE, vol. 72, pp. 161\u2013177. Springer, Dordrecht (2014). https:\/\/doi.org\/10.1007\/978-94-017-8044-5_10"},{"issue":"1","key":"30_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S1007-0214(08)70019-1","volume":"13","author":"R Liang","year":"2008","unstructured":"Liang, R., Gao, J.: Dependent-chance programming models for capital budgeting in fuzzy environments. Tsinghua Sci. Technol. 13(1), 117\u2013120 (2008)","journal-title":"Tsinghua Sci. Technol."},{"issue":"9","key":"30_CR6","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1287\/mnsc.13.9.723","volume":"13","author":"PJ Kolesar","year":"1967","unstructured":"Kolesar, P.J.: A branch and bound algorithm for the knapsack problem. Manag. Sci. 13(9), 723\u2013735 (1967)","journal-title":"Manag. Sci."},{"issue":"1","key":"30_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF02243880","volume":"25","author":"P Toth","year":"1980","unstructured":"Toth, P.: Dynamic programming algorithms for the zero-one knapsack problem. Computing 25(1), 29\u201345 (1980)","journal-title":"Computing"},{"issue":"2","key":"30_CR8","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"30_CR9","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search\u2014part I. ORSA J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"30_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02242185","volume":"40","author":"A Drexl","year":"1988","unstructured":"Drexl, A.: A simulated annealing approach to the multiconstraint zero-one knapsack problem. Computing 40(1), 1\u20138 (1988)","journal-title":"Computing"},{"issue":"1","key":"30_CR11","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"PC Chu","year":"1998","unstructured":"Chu, P.C., Beasley, J.E.: A genetic algorithm for the multidimensional knapsack problem. J. Heurist. 4(1), 63\u201386 (1998)","journal-title":"J. Heurist."},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B (Cybernetics) 26(1), 29\u201341 (1996)","DOI":"10.1109\/3477.484436"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.eswa.2019.06.007","volume":"135","author":"G Lin","year":"2019","unstructured":"Lin, G., Guan, J., Li, Z., et al.: A hybrid binary particle swarm optimization with tabu search for the set-union knapsack problem. Expert Syst. Appl. 135, 201\u2013211 (2019)","journal-title":"Expert Syst. Appl."},{"issue":"11","key":"30_CR14","first-page":"153","volume":"54","author":"C Wu","year":"2018","unstructured":"Wu, C., Zhao, J., Liu, X., et al.: Modified differential evolution algorithm for solving multidimensional knapsack problem. Comput. Eng. Appl. 54(11), 153\u2013160 (2018)","journal-title":"Comput. Eng. Appl."},{"issue":"4","key":"30_CR15","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1016\/j.apm.2013.08.009","volume":"38","author":"M Chih","year":"2014","unstructured":"Chih, M., Lin, C.J., Chern, M.S., et al.: Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem. Appl. Math. Model. 38(4), 1338\u20131350 (2014)","journal-title":"Appl. Math. Model."},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.asoc.2014.10.030","volume":"26","author":"M Chih","year":"2015","unstructured":"Chih, M.: Self-adaptive check and repair operator-based particle swarm optimization for the multidimensional knapsack problem. Appl. Soft Comput. 26, 378\u2013389 (2015)","journal-title":"Appl. Soft Comput."},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.engappai.2016.05.006","volume":"55","author":"B Haddar","year":"2016","unstructured":"Haddar, B., Khemakhem, M., Hanafi, S., et al.: A hybrid quantum particle swarm optimization for the multidimensional knapsack problem. Eng. Appl. Artif. Intell. 55, 1\u201313 (2016)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"4","key":"30_CR18","doi-asserted-by":"publisher","first-page":"43","DOI":"10.4018\/jamc.2012100103","volume":"3","author":"M Khemakhem","year":"2012","unstructured":"Khemakhem, M., Haddar, B., Chebil, K., et al.: A filter-and-fan metaheuristic for the 0-1 multidimensional knapsack problem. Int. J. Appl. Metaheurist. Comput. (IJAMC) 3(4), 43\u201363 (2012)","journal-title":"Int. J. Appl. Metaheurist. Comput. (IJAMC)"},{"key":"30_CR19","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.ins.2018.01.026","volume":"436","author":"X Lai","year":"2018","unstructured":"Lai, X., Hao, J.K., Glover, F., et al.: A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem. Inf. Sci. 436, 282\u2013301 (2018)","journal-title":"Inf. Sci."},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Martins, J.P., Ribas, B.C.: A randomized heuristic repair for the multidimensional knapsack problem. Optim. Lett. 1\u201319 (2020)","DOI":"10.1007\/s11590-020-01611-1"},{"key":"30_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107260","volume":"105","author":"Z Wei","year":"2021","unstructured":"Wei, Z., Hao, J.K.: Multistart solution-based tabu search for the Set-Union Knapsack Problem. Appl. Soft Comput. 105, 107260 (2021)","journal-title":"Appl. Soft Comput."},{"key":"30_CR22","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.knosys.2013.04.003","volume":"48","author":"L Wang","year":"2013","unstructured":"Wang, L., Zheng, X., Wang, S.: A novel binary fruit fly optimization algorithm for solving the multidimensional knapsack problem. Knowl.-Based Syst. 48, 17\u201323 (2013)","journal-title":"Knowl.-Based Syst."},{"key":"30_CR23","first-page":"66","volume":"33","author":"Q Liu","year":"2008","unstructured":"Liu, Q., Zhou, Y.: Scatter search for multi-objective optimization problem. Comput. Eng. Appl. 33, 66\u201368 (2008)","journal-title":"Comput. Eng. Appl."},{"issue":"3","key":"30_CR24","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1109\/TASE.2017.2731981","volume":"15","author":"X Guo","year":"2017","unstructured":"Guo, X., Liu, S., Zhou, M.C., et al.: Dual-objective program and scatter search for the optimization of disassembly sequences subject to multiresource constraints. IEEE Trans. Autom. Sci. Eng. 15(3), 1091\u20131103 (2017)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"30_CR25","doi-asserted-by":"crossref","unstructured":"Lasdon L. Z., Plummer, J., et al.: Scatter search and local NLP solvers: a multistart framework for global optimization. INFORMS J. Comput. 19(3), 328\u2013340 (2007)","DOI":"10.1287\/ijoc.1060.0175"},{"issue":"4","key":"30_CR26","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1109\/TEVC.2007.913109","volume":"12","author":"AJ Nebro","year":"2008","unstructured":"Nebro, A.J., Luna, F., Alba, E., et al.: AbYSS: adapting scatter search to multiobjective optimization. IEEE Trans. Evol. Comput. 12(4), 439\u2013457 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"30_CR27","doi-asserted-by":"publisher","first-page":"2093","DOI":"10.1007\/978-1-4613-0303-9_33","volume-title":"Handbook of Combinatorial Optimization","author":"F Glover","year":"1998","unstructured":"Glover, F., Laguna, M.: Tabu search. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 2093\u20132229. Springer, Boston (1998). https:\/\/doi.org\/10.1007\/978-1-4613-0303-9_33"},{"key":"30_CR28","doi-asserted-by":"crossref","unstructured":"Mart\u00ed, R., Laguna, M., Glover, F.: Principles of scatter search. Eur. J. Oper. Res. 169(2), 359\u2013372 (2006)","DOI":"10.1016\/j.ejor.2004.08.004"},{"issue":"3","key":"30_CR29","first-page":"653","volume":"29","author":"F Glover","year":"2000","unstructured":"Glover, F., Laguna, M., Mart\u00ed, R.: Fundamentals of scatter search and path relinking. Control. Cybern. 29(3), 653\u2013684 (2000)","journal-title":"Control. Cybern."},{"issue":"2","key":"30_CR30","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/ijoc.1090.0344","volume":"22","author":"J Puchinger","year":"2010","unstructured":"Puchinger, J., Raidl, G.R., Pferschy, U.: The multidimensional Knapsack Problem: structure and algorithms. INFORMS J. Comput. 22(2), 250\u2013265 (2010)","journal-title":"INFORMS J. Comput."}],"container-title":["Communications in Computer and Information Science","Exploration of Novel Intelligent Optimization Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-4109-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T14:45:17Z","timestamp":1659365117000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-4109-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811941085","9789811941092"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-4109-2_30","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISICA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Intelligence Computation and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Giangzhou","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isica2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/gdstinfo.scau.edu.cn\/isica2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"99","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":"48","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":"3","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)"}}]}}