{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:16:43Z","timestamp":1743157003403,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030588168"},{"type":"electronic","value":"9783030588175"}],"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-3-030-58817-5_38","type":"book-chapter","created":{"date-parts":[[2020,9,29]],"date-time":"2020-09-29T16:46:50Z","timestamp":1601398010000},"page":"511-526","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Solving the 0\/1 Knapsack Problem Using a Galactic Swarm Optimization with Data-Driven Binarization Approaches"],"prefix":"10.1007","author":[{"given":"Camilo","family":"V\u00e1squez","sequence":"first","affiliation":[]},{"given":"Jos\u00e9","family":"Lemus-Romani","sequence":"additional","affiliation":[]},{"given":"Broderick","family":"Crawford","sequence":"additional","affiliation":[]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[]},{"given":"Gino","family":"Astorga","sequence":"additional","affiliation":[]},{"given":"Wenceslao","family":"Palma","sequence":"additional","affiliation":[]},{"given":"Sanjay","family":"Misra","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Paredes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,30]]},"reference":[{"issue":"2","key":"38_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2017\/8404231","volume":"2017","author":"B Crawford","year":"2017","unstructured":"Crawford, B., Soto, R., Astorga, G., Garc\u00eda, J., Castro, C., Paredes, F.: Putting continuous metaheuristics to work in binary search spaces. Complexity 2017(2), 1\u201319 (2017)","journal-title":"Complexity"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Astorga, G., Lemus-Romani, J., Misra, S., Rubio, J.-M.: An adaptive intelligent water drops algorithm for set covering problem. In: 2019 19th International Conference on Computational Science and Its Applications (ICCSA), pp. 39\u201345. IEEE (2019)","DOI":"10.1109\/ICCSA.2019.000-6"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1016\/j.swevo.2018.08.006","volume":"44","author":"J Garc\u00eda","year":"2019","unstructured":"Garc\u00eda, J., Crawford, B., Soto, R., Astorga, G.: A clustering algorithm applied to the binarization of swarm intelligence continuous metaheuristics. Swarm Evol. Comput. 44, 646\u2013664 (2019)","journal-title":"Swarm Evol. Comput."},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"3238516","DOI":"10.1155\/2019\/3238574","volume":"2019","author":"J Garc\u00eda","year":"2019","unstructured":"Garc\u00eda, J., et al.: A Db-scan binarization algorithm applied to matrix covering problems. Comput. Intell. Neurosci. 2019, 3238516\u20133238572 (2019)","journal-title":"Comput. Intell. Neurosci."},{"issue":"1","key":"38_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ejor.2007.03.010","volume":"187","author":"G Mavrotas","year":"2008","unstructured":"Mavrotas, G., Diakoulaki, D., Kourentzis, A.: Selection among ranked projects under segmentation, policy and logical constraints. Eur. J. Oper. Res. 187(1), 177\u2013192 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"100671","DOI":"10.1016\/j.swevo.2020.100671","volume":"54","author":"B Morales-Casta\u00f1eda","year":"2020","unstructured":"Morales-Casta\u00f1eda, B., Zald\u00edvar, D., Cuevas, E., Fausto, F., Rodr\u00edguez, A.: A better balance in metaheuristic algorithms: does it exist? Swarm Evol. Comput. 54, 100671 (2020)","journal-title":"Swarm Evol. Comput."},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1016\/j.asoc.2015.10.034","volume":"38","author":"V Muthiah-Nakarajan","year":"2016","unstructured":"Muthiah-Nakarajan, V., Noel, M.M.: Galactic swarm optimization: a new global optimization metaheuristic inspired by galactic motion. Appl. Soft Comput. 38, 771\u2013787 (2016)","journal-title":"Appl. Soft Comput."},{"issue":"10","key":"38_CR8","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1016\/j.cor.2009.12.006","volume":"37","author":"S Peeta","year":"2010","unstructured":"Peeta, S., Salman, F.S., Gunnec, D., Viswanath, K.: Pre-disaster investment decisions for strengthening a highway network. Comput. Oper. Res. 37(10), 1708\u20131719 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"38_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s13748-019-00185-z","volume":"8","author":"H Song","year":"2019","unstructured":"Song, H., Triguero, I., \u00d6zcan, E.: A review on the self and dual interactions between machine learning and optimisation. Prog. Artif. Intell. 8(2), 143\u2013165 (2019). https:\/\/doi.org\/10.1007\/s13748-019-00185-z","journal-title":"Prog. Artif. Intell."},{"key":"38_CR10","unstructured":"Talbi, E.-G.: Machine learning into metaheuristics: a survey and taxonomy of data-driven metaheuristics, Working paper or preprint, June 2020"},{"key":"38_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-030-24308-1_42","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2019","author":"S Valdivia","year":"2019","unstructured":"Valdivia, S., et al.: Bridges reinforcement through conversion of tied-arch using crow search algorithm. In: Misra, S., et al. (eds.) ICCSA 2019. LNCS, vol. 11623, pp. 525\u2013535. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24308-1_42"},{"issue":"1","key":"38_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.future.2008.07.006","volume":"25","author":"DC Vanderster","year":"2009","unstructured":"Vanderster, D.C., Dimopoulos, N.J., Parra-Hernandez, R., Sobie, R.J.: Resource allocation on computational grids using a utility model and the knapsack problem. Future Gener. Comput. Syst. 25(1), 35\u201350 (2009)","journal-title":"Future Gener. Comput. Syst."},{"issue":"4","key":"38_CR13","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1016\/j.cie.2011.06.011","volume":"61","author":"J Yates","year":"2011","unstructured":"Yates, J., Lakshmanan, K.: A constrained binary knapsack approximation for shortest path network interdiction. Comput. Indu. Eng. 61(4), 981\u2013992 (2011)","journal-title":"Comput. Indu. Eng."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58817-5_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T14:38:01Z","timestamp":1619188681000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58817-5_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030588168","9783030588175"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58817-5_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"30 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cagliari","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Cyber chair 4","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1450","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":"466","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":"32","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":"32% - 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":"6","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)"}},{"value":"Conference was held virtually due to COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}