{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T13:42:16Z","timestamp":1762609336374,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031344992"},{"type":"electronic","value":"9783031345005"}],"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-34500-5_10","type":"book-chapter","created":{"date-parts":[[2023,5,28]],"date-time":"2023-05-28T06:01:58Z","timestamp":1685253718000},"page":"125-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A VNS Based Heuristic for\u00a0a\u00a02D Open Dimension Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5296-2779","authenticated-orcid":false,"given":"Layane Rodrigues de Souza","family":"Queiroz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2674-3366","authenticated-orcid":false,"given":"Thiago Alves","family":"de Queiroz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,29]]},"reference":[{"issue":"5","key":"10_CR1","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1109\/TSMC.1980.4308483","volume":"10","author":"A Albano","year":"1980","unstructured":"Albano, A., Sapuppo, G.: Optimal allocation of two-dimensional irregular shapes using heuristic search methods. IEEE Trans. Syst. Man Cybern. 10(5), 242\u2013248 (1980)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10288-019-00419-9","volume":"18","author":"JG de Almeida Cunha","year":"2019","unstructured":"de Almeida Cunha, J.G., de\u00a0Lima, V.L., de Queiroz, T.A.: Grids for cutting and packing problems: a study in the 2D knapsack problem. 4OR 18(3), 293\u2013339 (2019). https:\/\/doi.org\/10.1007\/s10288-019-00419-9","journal-title":"4OR"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1057\/jors.2008.169","volume":"60","author":"JA Bennell","year":"2009","unstructured":"Bennell, J.A., Oliveira, J.F.: A tutorial in irregular shape packing problems. J. Oper. Res. Soc. 60, 93\u2013105 (2009)","journal-title":"J. Oper. Res. Soc."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1111\/1475-3995.00434","volume":"10","author":"MA Carravilla","year":"2003","unstructured":"Carravilla, M.A., Ribeiro, C., Oliveira, J.F., Gomes, A.M.: Solving nesting problems with non-convex polygons by constraint logic programming. Int. Trans. Oper. Res. 10, 651\u2013663 (2003)","journal-title":"Int. Trans. Oper. Res."},{"issue":"3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1016\/j.ejor.2016.03.009","volume":"253","author":"LH Cherri","year":"2016","unstructured":"Cherri, L.H., Mundim, L.R., Andretta, M., Toledo, F.M., Oliveira, J.F., Carravilla, M.A.: Robust mixed-integer linear programming models for the irregular strip packing problem. Eur. J. Oper. Res. 253(3), 570\u2013583 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10732-020-09442-0","volume":"26","author":"A Duarte","year":"2020","unstructured":"Duarte, A., Pardo, E.G.: Special issue on recent innovations in variable neighborhood search. J. Heuristics 26, 335\u2013338 (2020)","journal-title":"J. Heuristics"},{"issue":"3","key":"10_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."},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10732-008-9088-9","volume":"15","author":"M Fischetti","year":"2009","unstructured":"Fischetti, M., Luzzi, I.: Mixed-integer programming models for nesting problems. J. Heuristics 15, 201\u2013226 (2009)","journal-title":"J. Heuristics"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Fujita, K., Akagi, S., Hirokawa, N.: Hybrid approach for optimal nesting using a genetic algorithm and a local minimization algorithm. In: Proceedings of the 19th Annual ASME Design Automation Conference, pp. 477\u2013484. Albuquerque, New Mexico, USA (1993)","DOI":"10.1115\/DETC1993-0337"},{"issue":"2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/S0377-2217(02)00130-3","volume":"141","author":"AM Gomes","year":"2002","unstructured":"Gomes, A.M., Oliveira, J.F.: A 2-exchange heuristic for nesting problems. Eur. J. Oper. Res. 141(2), 359\u2013370 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10_CR11","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1016\/j.ejor.2004.09.008","volume":"171","author":"AM Gomes","year":"2006","unstructured":"Gomes, A.M., Oliveira, J.F.: Solving irregular strip packing problems by hybridising simulated annealing and linear programming. Eur. J. Oper. Res. 171(3), 811\u2013829 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., P\u00e9rez, J.M.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1), 367\u2013407 (2010)","journal-title":"Ann. Oper. Res."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5, 423\u2013454 (2017)","journal-title":"EURO J. Comput. Optim."},{"key":"10_CR14","unstructured":"Hopper, E.: Mathematical models and heuristic methods for nesting problems. School of Engineering, University of Wales, Cardiff, Doutorado (2000)"},{"issue":"1","key":"10_CR15","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0377-2217(94)00166-9","volume":"88","author":"S Jakobs","year":"1996","unstructured":"Jakobs, S.: On genetic algorithms for the packing of polygons. Eur. J. Oper. Res. 88(1), 165\u2013181 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10_CR16","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1080\/00207543.2015.1041571","volume":"54","author":"AAS Le\u00e3o","year":"2016","unstructured":"Le\u00e3o, A.A.S., Toledo, F.M.B., Oliveira, J.F., Carravilla, M.A.: A semi-continuous mip model for the irregular strip packing problem. Int. J. Prod. Res. 54(3), 712\u2013721 (2016)","journal-title":"Int. J. Prod. Res."},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.eswa.2017.03.059","volume":"81","author":"LR Mundim","year":"2017","unstructured":"Mundim, L.R., Andretta, M., Queiroz, T.A.: A biased random key genetic algorithm for open dimension nesting problems using no-fit raster. Expert Syst. Appl. 81, 358\u2013371 (2017). https:\/\/doi.org\/10.1016\/j.eswa.2017.03.059","journal-title":"Expert Syst. Appl."},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Oliveira, J.F.C., Ferreira, J.A.S.: Algorithms for nesting problems. In: Vidal, R.V.V. (eds.) Applied Simulated Annealing. Lecture Notes in Economics and Mathematical Systems, vol. 396, pp. 255\u2013273. Springer, Berlin, Heidelberg (1993). https:\/\/doi.org\/10.1007\/978-3-642-46787-5_13","DOI":"10.1007\/978-3-642-46787-5_13"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.cor.2016.11.006","volume":"87","author":"MO Rodrigues","year":"2017","unstructured":"Rodrigues, M.O., Toledo, F.M.: A clique covering mip model for the irregular strip packing problem. Comput. Oper. Res. 87, 221\u2013234 (2017)","journal-title":"Comput. Oper. Res."},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Scheithauer, G.: Introduction to Cutting and Packing Optimization: Problems, Modeling Approaches, Solution Methods, vol. 263. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-64403-5_1"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Souza, Queiroz, L.R., Andretta, M.: Two effective methods for the irregular knapsack problem. Appl. Soft Comput. 95, 106485 (2020)","DOI":"10.1016\/j.asoc.2020.106485"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Souza, Queiroz, L.R., Andretta, M.: A branch-and-cut algorithm for the irregular strip packing problem with uncertain demands. Int. Trans. Oper. Res. 29(6), 3486\u20133513 (2022)","DOI":"10.1111\/itor.13122"},{"issue":"2","key":"10_CR23","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.ijpe.2013.04.009","volume":"145","author":"FMB Toledo","year":"2013","unstructured":"Toledo, F.M.B., Carravilla, M.A., Ribeiro, C., Oliveira, J.F., Gomes, A.M.: The dotted-board model: a new mip model for nesting irregular shapes. Int. J. Prod. Econ. 145(2), 478\u2013487 (2013)","journal-title":"Int. J. Prod. Econ."}],"container-title":["Lecture Notes in Computer Science","Variable Neighborhood Search"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34500-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,28]],"date-time":"2023-05-28T06:02:41Z","timestamp":1685253761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34500-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031344992","9783031345005"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34500-5_10","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":"29 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICVNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Variable Neighborhood Search","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Abu Dhabi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icvns2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icvns2022.info\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","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":"11","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":"38% - 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)"}}]}}