{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:55:54Z","timestamp":1743137754791,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":10,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811555763"},{"type":"electronic","value":"9789811555770"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-981-15-5577-0_42","type":"book-chapter","created":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T13:02:46Z","timestamp":1590411766000},"page":"541-550","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Iterated Tabu Search Algorithm for the Multidemand Multidimensional Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Dongni","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangjing","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,26]]},"reference":[{"key":"42_CR1","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. Heuristics 4, 63\u201386 (1998)","journal-title":"J. Heuristics"},{"issue":"1","key":"42_CR2","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1287\/ijoc.1030.0050","volume":"17","author":"P Cappanera","year":"2005","unstructured":"Cappanera, P., Trubian, M.: A local-search-based heuristic for the demand-constrained multidimensional knapsack problem. INFORMS J. Comput. 17(1), 82\u201398 (2005)","journal-title":"INFORMS J. Comput."},{"issue":"1\u20133","key":"42_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(03)00431-1","volume":"33","author":"P Cappanera","year":"2003","unstructured":"Cappanera, P., Gallo, G., Maffioli, F.: Discrete facility location and routing of obnoxious activities. Discrete Appl. Math. 33(1\u20133), 3\u201328 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"42_CR4","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/S0377-2217(00)00169-7","volume":"129","author":"F Plastria","year":"2001","unstructured":"Plastria, F.: Static competitive facility location: An overview of optimisation approaches. Eur. J. Oper. Res. 129(3), 461\u2013470 (2001)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"42_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/S0377-2217(97)00110-0","volume":"102","author":"D Romero-Morales","year":"1997","unstructured":"Romero-Morales, D., Carrizosa, E., Conde, E.: Semi-obnoxious location models: a global optimization approach. Eur. J. Oper. Res. 102(2), 295\u2013301 (1997)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"42_CR6","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1002\/1520-6750(200102)48:1<18::AID-NAV2>3.0.CO;2-7","volume":"48","author":"GJ Beaujon","year":"2001","unstructured":"Beaujon, G.J., Marin, S.P., Mcdonald, G.C.: Balancing and optimizing a portfolio of R&D projects. Naval Res. Logistics (NRL) 48(1), 18\u201340 (2001)","journal-title":"Naval Res. Logistics (NRL)"},{"issue":"9","key":"42_CR7","doi-asserted-by":"publisher","first-page":"2508","DOI":"10.1016\/j.cor.2005.07.007","volume":"33","author":"H Arntzen","year":"2006","unstructured":"Arntzen, H., Hvattum, L.M., LKketangen, A.: Adaptive memory search for multidemand multidimensional knapsack problems. Comput. Oper. Res. 33(9), 2508\u20132525 (2006)","journal-title":"Comput. Oper. Res."},{"key":"42_CR8","doi-asserted-by":"publisher","first-page":"1977","DOI":"10.1016\/j.cor.2010.01.013","volume":"37","author":"F Gort\u00e1zar","year":"2010","unstructured":"Gort\u00e1zar, F., Duarte, A., Laguna, M., Mart\u00ed, R.: Black box scatter search for general classes of binary optimization problems. Comput. Oper. Res. 37, 1977\u20131986 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"42_CR9","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10732-008-9100-4","volume":"16","author":"LM Hvattum","year":"2010","unstructured":"Hvattum, L.M., Arntzen, H., L\u00f8kketangen, A., Glover, F.: Alternating control tree search for knapsack\/covering problems. J. Heuristics 16(3), 239\u2013258 (2010)","journal-title":"J. Heuristics"},{"issue":"1","key":"42_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ejor.2018.10.001","volume":"274","author":"XJ Lai","year":"2018","unstructured":"Lai, X.J., Hao, J.K., Yue, D.: Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem. Eur. J. Oper. Res. 274(1), 35\u201348 (2018)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Communications in Computer and Information Science","Artificial Intelligence Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-5577-0_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T13:08:58Z","timestamp":1590412138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-5577-0_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811555763","9789811555770"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-5577-0_42","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"26 May 2020","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":"Guangzhou","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 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isica2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/gdstinfo.cn\/isica2019\/","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":"112","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":"45","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":"20","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":"40% - 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","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":"4","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}