{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:56:53Z","timestamp":1763643413397,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2022,2,28]],"date-time":"2022-02-28T00:00:00Z","timestamp":1646006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,28]],"date-time":"2022-02-28T00:00:00Z","timestamp":1646006400000},"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":["J Supercomput"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s11227-022-04350-5","type":"journal-article","created":{"date-parts":[[2022,2,28]],"date-time":"2022-02-28T13:02:41Z","timestamp":1646053361000},"page":"12242-12277","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["TSMSA: a 2DSPP algorithm with multi-strategy rectangle selection"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5239-8896","authenticated-orcid":false,"given":"Ping","family":"Guo","sequence":"first","affiliation":[]},{"given":"Minliang","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,28]]},"reference":[{"issue":"2","key":"4350_CR1","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A Lodi","year":"2002","unstructured":"Lodi A, Martello S, Monaci M (2002) Two-dimensional packing problems: a survey. Eur J Oper Res 141(2):241\u2013252","journal-title":"Eur J Oper Res"},{"issue":"1","key":"4350_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/0377-2217(92)90288-K","volume":"56","author":"KA Dowsland","year":"1992","unstructured":"Dowsland KA, Dowsland WB (1992) Packing problems\u2014ScienceDirect. Eur J Oper Res 56(1):2\u201314","journal-title":"Eur J Oper Res"},{"issue":"2","key":"4350_CR3","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/S0377-2217(02)00132-7","volume":"141","author":"D Pisinger","year":"2002","unstructured":"Pisinger D (2002) Heuristics for the container loading problem. Eur J Oper Res 141(2):382\u2013392","journal-title":"Eur J Oper Res"},{"issue":"1","key":"4350_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1287\/opre.33.1.49","volume":"33","author":"JE Beasley","year":"1985","unstructured":"Beasley JE (1985) An exact two-dimensional non-guillotine cutting tree search procedure. Oper Res 33(1):49\u201364","journal-title":"Oper Res"},{"issue":"3","key":"4350_CR5","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1287\/ijoc.15.3.310.16082","volume":"15","author":"S Martello","year":"2003","unstructured":"Martello S, Monaci M et al (2003) An exact approach to the strip-packing problem. Inf J Comput 15(3):310\u2013319","journal-title":"Inf J Comput"},{"issue":"1","key":"4350_CR6","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1287\/opre.1040.0154","volume":"53","author":"M Hifi","year":"2005","unstructured":"Hifi M, M\u2019Hallah R (2005) An exact algorithm for constrained two-dimensional two-staged cutting problems. Oper Res 53(1):140\u2013150","journal-title":"Oper Res"},{"issue":"4","key":"4350_CR7","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1016\/j.cor.2006.08.011","volume":"35","author":"Y Cui","year":"2008","unstructured":"Cui Y, Yang Y, Xian C et al (2008) A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem. Comput Oper Res 35(4):1281\u20131291","journal-title":"Comput Oper Res"},{"issue":"1","key":"4350_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.ejor.2008.08.020","volume":"198","author":"M Kenmochi","year":"2009","unstructured":"Kenmochi M, Imamichi T, Nonobe K et al (2009) Exact algorithms for the two-dimensional strip packing problem with and without rotations. Eur J Oper Res 198(1):73\u201383","journal-title":"Eur J Oper Res"},{"issue":"4","key":"4350_CR9","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"BS Baker","year":"1980","unstructured":"Baker BS, Coffman EG, Rivest RL (1980) Orthogonal packings in two dimensions. SIAM J Comput 9(4):846\u2013855","journal-title":"SIAM J Comput"},{"issue":"8","key":"4350_CR10","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1109\/TC.1983.1676307","volume":"100","author":"B Chazelle","year":"1983","unstructured":"Chazelle B (1983) The bottomn-left bin-packing heuristic: an efficient implementation. IEEE Trans Comput 100(8):697\u2013707","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"4350_CR11","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/S0377-2217(99)00357-4","volume":"128","author":"E Hopper","year":"2001","unstructured":"Hopper E, Turton B (2001) An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. Eur J Oper Res 128(1):34\u201357","journal-title":"Eur J Oper Res"},{"issue":"4","key":"4350_CR12","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.1040.0109","volume":"52","author":"EK Burke","year":"2004","unstructured":"Burke EK, Kendall G, Whitwell G (2004) A new placement heuristic for the orthogonal stock-cutting problem. Oper Res 52(4):655\u2013671","journal-title":"Oper Res"},{"issue":"1","key":"4350_CR13","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10479-009-0642-0","volume":"172","author":"\u00d6B A\u015f\u0131k","year":"2009","unstructured":"A\u015f\u0131k \u00d6B, \u00d6zcan E (2009) Bidirectional best-fit heuristic for orthogonal rectangular strip packing. Ann Oper Res 172(1):405\u2013427","journal-title":"Ann Oper Res"},{"issue":"4","key":"4350_CR14","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1016\/j.cor.2006.07.004","volume":"35","author":"R Alvarez-Valdes","year":"2008","unstructured":"Alvarez-Valdes R, Parre\u00f1o F, Tamarit JM (2008) Reactive GRASP for the strip-packing problem. Comput Oper Res 35(4):1065\u20131083","journal-title":"Comput Oper Res"},{"issue":"6","key":"4350_CR15","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1057\/palgrave.jors.2602393","volume":"59","author":"G Belov","year":"2008","unstructured":"Belov G, Scheithauer G, Mukhacheva EA (2008) One-dimensional heuristics adapted for two-dimensional rectangular strip packing. J Oper Res Soc 59(6):823\u2013832","journal-title":"J Oper Res Soc"},{"issue":"10","key":"4350_CR16","doi-asserted-by":"publisher","first-page":"13032","DOI":"10.1016\/j.eswa.2011.04.105","volume":"38","author":"S Leung","year":"2011","unstructured":"Leung S, Zhang D (2011) A fast layer-based heuristic for non-guillotine strip packing. Expert Syst Appl 38(10):13032\u201313042","journal-title":"Expert Syst Appl"},{"issue":"5","key":"4350_CR17","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1111\/itor.12030","volume":"20","author":"J Verstichel","year":"2013","unstructured":"Verstichel J, Causmaecker PD, Berghe GV (2013) An improved best-fit heuristic for the orthogonal strip packing problem. Int Trans Oper Res 20(5):711\u2013730","journal-title":"Int Trans Oper Res"},{"issue":"3","key":"4350_CR18","first-page":"814","volume":"172","author":"A Bortfeldt","year":"2006","unstructured":"Bortfeldt A, Winter T (2006) A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. Int Trans Oper Res 172(3):814\u2013837","journal-title":"Int Trans Oper Res"},{"issue":"3","key":"4350_CR19","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1016\/0377-2217(95)00029-P","volume":"84","author":"K Berthold","year":"1995","unstructured":"Berthold K (1995) Guillotineable bin packing: a genetic approach. Eur J Oper Res 84(3):645\u2013661","journal-title":"Eur J Oper Res"},{"issue":"9","key":"4350_CR20","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1360\/aas-007-0911","volume":"33","author":"D Zhang","year":"2007","unstructured":"Zhang D, ShengDa C, YanJuan L (2007) An improved heuristic recursive strategy based on genetic algorithm for the strip rectangular packing problem. Acta Automat Sinica 33(9):911\u2013916","journal-title":"Acta Automat Sinica"},{"issue":"2","key":"4350_CR21","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.ijpe.2013.04.040","volume":"145","author":"JA Bennell","year":"2013","unstructured":"Bennell JA, Lai SL, Potts CN (2013) A genetic algorithm for two-dimensional bin packing with due dates. Int J Prod Econ 145(2):547\u2013560","journal-title":"Int J Prod Econ"},{"issue":"3","key":"4350_CR22","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/0377-2217(93)90195-S","volume":"68","author":"KA Dowsland","year":"1993","unstructured":"Dowsland KA (1993) Some experiments with simulated annealing techniques for packing problems. Eur J Oper Res 68(3):389\u2013399","journal-title":"Eur J Oper Res"},{"issue":"3","key":"4350_CR23","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1287\/ijoc.1080.0306","volume":"21","author":"EK Burke","year":"2009","unstructured":"Burke EK, Kendall G, Whitwell G (2009) A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem. Inf J Comput 21(3):505\u2013516","journal-title":"Inf J Comput"},{"issue":"1","key":"4350_CR24","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.ejor.2014.03.049","volume":"238","author":"S Hong","year":"2014","unstructured":"Hong S, Zhang D, Lau HC et al (2014) A hybrid heuristic algorithm for the 2D variable-sized bin packing problem. Eur J Oper Res 238(1):95\u2013103","journal-title":"Eur J Oper Res"},{"issue":"1","key":"4350_CR25","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ejor.2011.06.002","volume":"215","author":"S Leung","year":"2011","unstructured":"Leung S, Zhang D, Sim KM (2011) A two-stage intelligent search algorithm for the two-dimensional strip packing problem. Eur J Oper Res 215(1):57\u201369","journal-title":"Eur J Oper Res"},{"issue":"1","key":"4350_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2012.05.001","volume":"40","author":"S Yang","year":"2013","unstructured":"Yang S, Han S, Ye W (2013) A simple randomized algorithm for two-dimensional strip packing. Comput Oper Res 40(1):1\u20138","journal-title":"Comput Oper Res"},{"issue":"2","key":"4350_CR27","first-page":"1","volume":"2015","author":"B Chen","year":"2015","unstructured":"Chen B, Wang Y, Yang S (2015) A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem. Math Probl Eng 2015(2):1\u201314","journal-title":"Math Probl Eng"},{"issue":"1\u20132","key":"4350_CR28","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1111\/itor.12138","volume":"23","author":"L Wei","year":"2016","unstructured":"Wei L, Qin H, Cheang B et al (2016) An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem. Int Trans Oper Res 23(1\u20132):65\u201392","journal-title":"Int Trans Oper Res"},{"key":"4350_CR29","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.cor.2016.11.024","volume":"80","author":"L Wei","year":"2016","unstructured":"Wei L, Hu Q, Leung S et al (2016) An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation. Comput Oper Res 80:113\u2013127","journal-title":"Comput Oper Res"},{"key":"4350_CR30","doi-asserted-by":"publisher","first-page":"72906","DOI":"10.1109\/ACCESS.2018.2882823","volume":"6","author":"Z Chen","year":"2018","unstructured":"Chen Z, Chen J (2018) An effective corner increment-based algorithm for the two-dimensional strip packing problem. IEEE Access 6:72906\u201372924","journal-title":"IEEE Access"},{"key":"4350_CR31","doi-asserted-by":"publisher","first-page":"179086","DOI":"10.1109\/ACCESS.2019.2953531","volume":"7","author":"M Chen","year":"2019","unstructured":"Chen M, Li K, Zhang D et al (2019) Hierarchical search-embedded hybrid heuristic algorithm for two-dimensional strip packing problem. IEEE Access 7:179086\u2013179103","journal-title":"IEEE Access"},{"key":"4350_CR32","doi-asserted-by":"publisher","first-page":"115559","DOI":"10.1109\/ACCESS.2020.3004380","volume":"8","author":"P Wang","year":"2020","unstructured":"Wang P, Rao Y, Luo Q (2020) An effective discrete Grey Wolf optimization algorithm for solving the packing problem. IEEE Access 8:115559\u2013115571","journal-title":"IEEE Access"},{"key":"4350_CR33","doi-asserted-by":"publisher","first-page":"106268","DOI":"10.1016\/j.asoc.2020.106268","volume":"92","author":"RG Rakotonirainy","year":"2020","unstructured":"Rakotonirainy RG, Van Vuuren JH (2020) Improved metaheuristics for the two-dimensional strip packing problem. Appl Soft Comput 92:106268","journal-title":"Appl Soft Comput"},{"issue":"2","key":"4350_CR34","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1590\/0101-7438.2016.036.02.0197","volume":"36","author":"JF Oliveira","year":"2016","unstructured":"Oliveira JF, Neuenfeldt J\u00fanior A, Silva E, Carravilla MA et al (2016) A survey on heuristics for the two-dimensional rectangular strip packing problem. Pesquisa Operacional 36(2):197\u2013226","journal-title":"Pesquisa Operacional"},{"issue":"2","key":"4350_CR35","first-page":"337","volume":"215","author":"L Wei","year":"2011","unstructured":"Wei L, Oon WC, Zhu W et al (2011) A skyline heuristic for the 2D rectangular packing and strip packing problems. Eur J Oper Res 215(2):337\u2013346","journal-title":"Eur J Oper Res"},{"key":"4350_CR36","doi-asserted-by":"publisher","first-page":"106097","DOI":"10.1016\/j.cie.2019.106097","volume":"137","author":"M Chen","year":"2019","unstructured":"Chen M, Wu C, Tang X et al (2019) An efficient deterministic heuristic algorithm for the rectangular packing problem. Comput Ind Eng 137:106097","journal-title":"Comput Ind Eng"},{"key":"4350_CR37","unstructured":"Pinto E, Oliveira JF (2005) Algorithm based on graphs for the non-guillotinable two-dimensional packing problem[M]. In Proceedings 2nd ESICUP Meeting, Southampton, U.K"},{"key":"4350_CR38","volume-title":"Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods[D]","author":"E Hopper","year":"2000","unstructured":"Hopper E (2000) Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods[D]. University of Wales, Cardiff, UK"},{"issue":"1","key":"4350_CR39","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1287\/opre.25.1.30","volume":"25","author":"N Christofides","year":"1977","unstructured":"Christofides N, Whitlock C (1977) An algorithm for two-dimensional cutting problems. Oper Res 25(1):30\u201344","journal-title":"Oper Res"},{"issue":"4","key":"4350_CR40","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1057\/jors.1985.51","volume":"36","author":"JE Beasley","year":"1985","unstructured":"Beasley JE (1985) Algorithms for unconstrained two-dimensional guillotine cutting. J Oper Res Soc 36(4):297\u2013306","journal-title":"J Oper Res Soc"},{"issue":"3","key":"4350_CR41","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1093\/comjnl\/25.3.353","volume":"25","author":"BE Bengtsson","year":"1982","unstructured":"Bengtsson BE (1982) Packing rectangular pieces\u2014a heuristic approach. Comput J 25(3):353\u2013357","journal-title":"Comput J"},{"issue":"5","key":"4350_CR42","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1057\/jors.1987.70","volume":"38","author":"JO Berkey","year":"1987","unstructured":"Berkey JO, Wang PY (1987) Two-dimensional finite Bin-Packing algorithms. J Oper Res Soc 38(5):423\u2013429","journal-title":"J Oper Res Soc"},{"issue":"3","key":"4350_CR43","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","volume":"44","author":"S Martello","year":"1998","unstructured":"Martello S, Vigo D (1998) Exact solution of the two-dimensional finite Bin packing problem. Manag Sci 44(3):388\u2013399","journal-title":"Manag Sci"},{"key":"4350_CR44","series-title":"Applied Optimization","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-1-4757-4137-7_24","volume-title":"Metaheuristics: computer decision-making","author":"CL Mumford-Valenzuela","year":"2003","unstructured":"Mumford-Valenzuela CL, Vick J, Wang PY (2003) Heuristics for large strip packing problems with guillotine patterns: an empirical study. In: Du DZ, Pardalos PM (eds) Metaheuristics: computer decision-making. Applied Optimization, vol 86, Springer, Boston, pp 501\u2013522. https:\/\/doi.org\/10.1007\/978-1-4757-4137-7_24."}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04350-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04350-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04350-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T00:08:20Z","timestamp":1654819700000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04350-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,28]]},"references-count":44,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["4350"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04350-5","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2022,2,28]]},"assertion":[{"value":"30 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}