{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:08:35Z","timestamp":1743127715667,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030557881"},{"type":"electronic","value":"9783030557898"}],"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-55789-8_22","type":"book-chapter","created":{"date-parts":[[2020,9,3]],"date-time":"2020-09-03T23:07:57Z","timestamp":1599174477000},"page":"250-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Enhanced Whale Optimization Algorithm for the Two-Dimensional Irregular Strip Packing Problem"],"prefix":"10.1007","author":[{"given":"Qiang","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zehui","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijun","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,4]]},"reference":[{"issue":"3","key":"22_CR1","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0305-0548(00)00021-6","volume":"28","author":"JA Bennell","year":"2001","unstructured":"Bennell, J.A., Dowsland, K.A., Dowsland, W.B.: The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon. Comput. Oper. Res. 28(3), 271\u2013287 (2001)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"22_CR2","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.ejor.2006.11.038","volume":"184","author":"JA Bennell","year":"2008","unstructured":"Bennell, J.A., Oliveira, J.F.: The geometry of nesting problems: a tutorial. Eur. J. Oper. Res. 184(2), 397\u2013415 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.cor.2006.02.026","volume":"35","author":"JA Bennell","year":"2008","unstructured":"Bennell, J.A., Song, X.: A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums. Comput. Oper. Res. 35(1), 267\u2013281 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"22_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.ejor.2006.03.011","volume":"179","author":"E Burke","year":"2007","unstructured":"Burke, E., Hellier, R., Kendall, G., Whitwell, G.: Complete and robust no-fit polygon generation for the irregular stock cutting problem. Eur. J. Oper. Res. 179(1), 27\u201349 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"22_CR5","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/BF01190153","volume":"9","author":"D Dobkin","year":"1993","unstructured":"Dobkin, D., Hershberger, J., Kirkpatrick, D., Suri, S.: Computing the intersection-depth of polyhedra. Algorithmica 9(6), 518\u2013533 (1993). https:\/\/doi.org\/10.1007\/BF01190153","journal-title":"Algorithmica"},{"issue":"3","key":"22_CR6","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1016\/j.ejor.2005.11.063","volume":"183","author":"J Egeblad","year":"2007","unstructured":"Egeblad, J., Nielsen, B.K., Odgaard, A.: Fast neighborhood search for two- and three-dimensional nesting problems. Eur. J. Oper. Res. 183(3), 1249\u20131266 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"22_CR7","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/j.ejor.2013.06.020","volume":"231","author":"A Elkeran","year":"2013","unstructured":"Elkeran, A.: A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering. Eur. J. Oper. Res. 231(3), 757\u2013769 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"22_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/A:1012590107280","volume":"16","author":"E Hopper","year":"2001","unstructured":"Hopper, E., Turton, B.C.H.: A review of the application of meta-heuristic algorithms to 2D strip packing problems. Artif. Intell. Rev. 16(4), 257\u2013300 (2001). https:\/\/doi.org\/10.1023\/A:1012590107280","journal-title":"Artif. Intell. Rev."},{"issue":"4","key":"22_CR9","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.disopt.2009.04.002","volume":"6","author":"T Imamichi","year":"2009","unstructured":"Imamichi, T., Yagiura, M., Nagamochi, H.: An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem. Discrete Optim. 6(4), 345\u2013361 (2009)","journal-title":"Discrete Optim."},{"issue":"3","key":"22_CR10","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1016\/j.cor.2011.05.025","volume":"39","author":"SC Leung","year":"2012","unstructured":"Leung, S.C., Lin, Y., Zhang, D.: Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem. Comput. Oper. Res. 39(3), 678\u2013686 (2012)","journal-title":"Comput. Oper. Res."},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili, S., Lewis, A.: The whale optimization algorithm. Adv. Eng. Softw. 95, 51\u201367 (2016)","journal-title":"Adv. Eng. Softw."},{"issue":"2","key":"22_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s002910050105","volume":"22","author":"JF Oliveira","year":"2000","unstructured":"Oliveira, J.F., Gomes, A.M., Ferreira, J.S.: TOPOS \u2013 a new constructive algorithm for nesting problems. OR Spektrum 22(2), 263\u2013284 (2000). https:\/\/doi.org\/10.1007\/s002910050105","journal-title":"OR Spektrum"},{"issue":"6","key":"22_CR13","doi-asserted-by":"publisher","first-page":"210","DOI":"10.3390\/sym10060210","volume":"10","author":"W Sun","year":"2018","unstructured":"Sun, W., Wang, J., Wei, X.: An improved whale optimization algorithm based on different searching paths and perceptual disturbance. Symmetry 10(6), 210 (2018)","journal-title":"Symmetry"},{"issue":"6","key":"22_CR14","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1111\/j.1475-3995.2009.00707.x","volume":"16","author":"S Umetani","year":"2009","unstructured":"Umetani, S., Yagiura, M., Imahori, S., Imamichi, T., Nonobe, K., Ibaraki, T.: Solving the irregular strip packing problem via guided local search for overlap minimization. Int. Trans. Oper. Res. 16(6), 661\u2013683 (2009)","journal-title":"Int. Trans. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-55789-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,15]],"date-time":"2020-12-15T10:13:21Z","timestamp":1608027201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-55789-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030557881","9783030557898"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-55789-8_22","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":"4 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IEA\/AIE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kitakyushu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"22 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ieaaie2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/jsasaki3.wixsite.com\/ieaaie2020\/organizations","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":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","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":"62","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":"17","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":"52% - 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":"4,35","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)"}}]}}