{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T14:36:29Z","timestamp":1762353389082,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"23","license":[{"start":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T00:00:00Z","timestamp":1691020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T00:00:00Z","timestamp":1691020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72101049","72232001","7197109","71821001"],"award-info":[{"award-number":["72101049","72232001","7197109","71821001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005047","name":"Natural Science Foundation of Liaoning Province","doi-asserted-by":"publisher","award":["2023-BS-091"],"award-info":[{"award-number":["2023-BS-091"]}],"id":[{"id":"10.13039\/501100005047","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s00500-023-09033-8","type":"journal-article","created":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T08:02:29Z","timestamp":1691049749000},"page":"17639-17656","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A tailored adaptive large neighborhood search algorithm for the air cargo partitioning problem with a piecewise linear cost function"],"prefix":"10.1007","volume":"27","author":[{"given":"Xin","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hu","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9995-4055","authenticated-orcid":false,"given":"Chun","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,3]]},"reference":[{"issue":"1","key":"9033_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00291-013-0347-2","volume":"37","author":"R Alvarez-Vald\u00e9s","year":"2015","unstructured":"Alvarez-Vald\u00e9s R, Parre\u00f1o F, Tamarit JM (2015) Lower bounds for three-dimensional multiple-bin-size bin packing problems. OR Spectrum 37(1):49\u201374","journal-title":"OR Spectrum"},{"key":"9033_CR2","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2016.06.009","volume":"76","author":"M Buljuba\u0161i\u0107","year":"2016","unstructured":"Buljuba\u0161i\u0107 M, Vasquez M (2016) Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing. Comput Oper Res 76:12\u201321","journal-title":"Comput Oper Res"},{"issue":"3","key":"9033_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0166-218X(00)00267-5","volume":"111","author":"A Caprara","year":"2001","unstructured":"Caprara A, Toth P (2001) Lower bounds and algorithms for the 2-dimensional vector packing problem. Discret Appl Math 111(3):231\u2013262","journal-title":"Discret Appl Math"},{"key":"9033_CR4","unstructured":"C\u00f4t\u00e9 JF, Haouari M, Iori M (2019) A primal decomposition algorithm for the two-dimensional bin packing problem. arXiv preprint arXiv:1909.06835"},{"issue":"3","key":"9033_CR5","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1016\/j.ejor.2007.06.063","volume":"195","author":"TG Crainic","year":"2009","unstructured":"Crainic TG, Perboli G, Tadei R (2009) Ts2pack: a two-level tabu search for the three-dimensional bin packing problem. Eur J Oper Res 195(3):744\u2013760","journal-title":"Eur J Oper Res"},{"issue":"1","key":"9033_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.ejor.2014.06.032","volume":"240","author":"YP Cui","year":"2015","unstructured":"Cui YP, Cui Y, Tang T (2015) Sequential heuristic for the two-dimensional bin-packing problem. Eur J Oper Res 240(1):43\u201353","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9033_CR7","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1057\/s41274-016-0148-5","volume":"69","author":"YP Cui","year":"2018","unstructured":"Cui YP, Yao Y, Zhang D (2018) Applying triple-block patterns in solving the two-dimensional bin packing problem. J Oper Res Soc 69(3):402\u2013415","journal-title":"J Oper Res Soc"},{"issue":"1","key":"9033_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.04.030","volume":"255","author":"M Delorme","year":"2016","unstructured":"Delorme M, Iori M, Martello S (2016) Bin packing and cutting stock problems: mathematical models and exact algorithms. Eur J Oper Res 255(1):1\u201320","journal-title":"Eur J Oper Res"},{"issue":"2","key":"9033_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","volume":"44","author":"H Dyckhoff","year":"1990","unstructured":"Dyckhoff H (1990) A typology of cutting and packing problems. Eur J Oper Res 44(2):145\u2013159","journal-title":"Eur J Oper Res"},{"key":"9033_CR10","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.ins.2020.08.040","volume":"547","author":"G D\u2019Angelo","year":"2021","unstructured":"D\u2019Angelo G, Palmieri F (2021) Gga: a modified genetic algorithm with gradient-based local search for solving constrained optimization problems. Inf Sci 547:136\u2013162","journal-title":"Inf Sci"},{"issue":"4","key":"9033_CR11","doi-asserted-by":"publisher","first-page":"1779","DOI":"10.1007\/s00500-022-06757-x","volume":"26","author":"G D\u2019Angelo","year":"2022","unstructured":"D\u2019Angelo G, Palmieri F, Robustelli A (2022) Artificial neural networks for resources optimization in energetic environment. Soft Comput 26(4):1779\u20131792","journal-title":"Soft Comput"},{"issue":"1\u20132","key":"9033_CR12","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10107-010-0403-5","volume":"132","author":"L Epstein","year":"2012","unstructured":"Epstein L, Levin A (2012) Bin packing with general cost structures. Math Program 132(1\u20132):355\u2013391","journal-title":"Math Program"},{"key":"9033_CR13","doi-asserted-by":"crossref","unstructured":"Epstein L, Levin A, Van\u00a0Stee R (2007) Multi-dimensional packing with conflicts. In: International symposium on fundamentals of computation theory, Springer, pp 288\u2013299","DOI":"10.1007\/978-3-540-74240-1_25"},{"issue":"3","key":"9033_CR14","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1287\/ijoc.15.3.267.16080","volume":"15","author":"O Faroe","year":"2003","unstructured":"Faroe O, Pisinger D, Zachariasen M (2003) Guided local search for the three-dimensional bin-packing problem. INFORMS J Comput 15(3):267\u2013283","journal-title":"INFORMS J Comput"},{"issue":"2","key":"9033_CR15","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.ejor.2010.11.004","volume":"210","author":"K Fleszar","year":"2011","unstructured":"Fleszar K, Charalambous C (2011) Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem. Eur J Oper Res 210(2):176\u2013184","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9033_CR16","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0305-0548(02)00195-8","volume":"31","author":"M Gendreau","year":"2004","unstructured":"Gendreau M, Laporte G, Semet F (2004) Heuristics and lower bounds for the bin packing problem with conflicts. Comput Oper Res 31(3):347\u2013358","journal-title":"Comput Oper Res"},{"key":"9033_CR17","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.omega.2014.07.004","volume":"50","author":"Q Hu","year":"2015","unstructured":"Hu Q, Lim A, Zhu W (2015) The two-dimensional vector packing problem with piecewise linear cost function. Omega 50:43\u201353","journal-title":"Omega"},{"key":"9033_CR18","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.omega.2017.01.006","volume":"74","author":"Q Hu","year":"2018","unstructured":"Hu Q, Wei L, Lim A (2018) The two-dimensional vector packing problem with general costs. Omega 74:59\u201369","journal-title":"Omega"},{"issue":"21","key":"9033_CR19","doi-asserted-by":"publisher","first-page":"6288","DOI":"10.1080\/00207543.2017.1341065","volume":"55","author":"R Kramer","year":"2017","unstructured":"Kramer R, Dell\u2019Amico M, Iori M (2017) A batching-move iterated local search algorithm for the bin packing problem with generalized precedence constraints. Int J Prod Res 55(21):6288\u20136304","journal-title":"Int J Prod Res"},{"key":"9033_CR20","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.cie.2018.08.021","volume":"125","author":"T Kucukyilmaz","year":"2018","unstructured":"Kucukyilmaz T, Kiziloz HE (2018) Cooperative parallel grouping genetic algorithm for the one-dimensional bin packing problem. Comput Indus Eng 125:157\u2013170","journal-title":"Comput Indus Eng"},{"issue":"2","key":"9033_CR21","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.ejor.2007.08.031","volume":"191","author":"JYT Leung","year":"2008","unstructured":"Leung JYT, Li CL (2008) An asymptotic approximation scheme for the concave cost bin packing problem. Eur J Oper Res 191(2):582\u2013586","journal-title":"Eur J Oper Res"},{"issue":"4","key":"9033_CR22","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1002\/nav.20142","volume":"53","author":"CL Li","year":"2006","unstructured":"Li CL, Chen ZL (2006) Bin-packing problem with concave costs of bin utilization. Naval Res Log (NRL) 53(4):298\u2013308","journal-title":"Naval Res Log (NRL)"},{"issue":"1","key":"9033_CR23","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.trc.2011.08.001","volume":"21","author":"Z Li","year":"2012","unstructured":"Li Z, Bookbinder JH, Elhedhli S (2012) Optimal shipment decisions for an airfreight forwarder: formulation and solution methods. Transp Res C Emerg Technol 21(1):17\u201330","journal-title":"Transp Res C Emerg Technol"},{"issue":"1\u20134","key":"9033_CR24","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1023\/B:ANOR.0000039519.03572.08","volume":"131","author":"A Lodi","year":"2004","unstructured":"Lodi A, Martello S, Vigo D (2004) Tspack: a unified tabu search code for multi-dimensional bin packing problems. Ann Oper Res 131(1\u20134):203\u2013213","journal-title":"Ann Oper Res"},{"key":"9033_CR25","first-page":"43","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez M, Dubois-Lacoste J, C\u00e1ceres LP, Birattari M, St\u00fctzle T (2016) The Irace package: iterated racing for automatic algorithm configuration. Oper Res Perspect 3:43\u201358","journal-title":"Oper Res Perspect"},{"issue":"2","key":"9033_CR26","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1287\/opre.48.2.256.12386","volume":"48","author":"S Martello","year":"2000","unstructured":"Martello S, Pisinger D, Vigo D (2000) The three-dimensional bin packing problem. Oper Res 48(2):256\u2013267","journal-title":"Oper Res"},{"issue":"13","key":"9033_CR27","doi-asserted-by":"publisher","first-page":"5266","DOI":"10.1016\/j.eswa.2013.03.037","volume":"40","author":"R Masson","year":"2013","unstructured":"Masson R, Vidal T, Michallet J, Penna PHV, Petrucci V, Subramanian A, Dubedout H (2013) An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems. Expert Syst Appl 40(13):5266\u20135275","journal-title":"Expert Syst Appl"},{"issue":"3","key":"9033_CR28","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1287\/ijoc.1090.0355","volume":"22","author":"AEF Muritiba","year":"2010","unstructured":"Muritiba AEF, Iori M, Malaguti E, Toth P (2010) Algorithms for the bin packing problem with conflicts. INFORMS J Comput 22(3):401\u2013415","journal-title":"INFORMS J Comput"},{"issue":"1\u20132","key":"9033_CR29","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1111\/itor.12111","volume":"23","author":"C Paquay","year":"2016","unstructured":"Paquay C, Schyns M, Limbourg S (2016) A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application. Int Trans Oper Res 23(1\u20132):187\u2013213","journal-title":"Int Trans Oper Res"},{"issue":"1","key":"9033_CR30","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/ijoc.1060.0181","volume":"19","author":"D Pisinger","year":"2007","unstructured":"Pisinger D, Sigurd M (2007) Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem. INFORMS J Comput 19(1):36\u201351","journal-title":"INFORMS J Comput"},{"issue":"3","key":"9033_CR31","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/j.ejor.2017.10.046","volume":"266","author":"S Polyakovskiy","year":"2018","unstructured":"Polyakovskiy S, M\u2019Hallah R (2018) A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates. Eur J Oper Res 266(3):819\u2013839","journal-title":"Eur J Oper Res"},{"key":"9033_CR32","doi-asserted-by":"crossref","unstructured":"Quiroz-Castellanos M, Cruz-Reyes L, Torres-Jimenez J, G\u00f3mez C, Huacuja HJF, Alvim AC (2015) A grouping genetic algorithm with controlled gene transmission for the bin packing problem. Comput Oper Res 55:52\u201364","DOI":"10.1016\/j.cor.2014.10.010"},{"issue":"4","key":"9033_CR33","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40(4):455\u2013472","journal-title":"Transp Sci"},{"issue":"2","key":"9033_CR34","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1051\/ro\/2017019","volume":"52","author":"M Serairi","year":"2018","unstructured":"Serairi M, Haouari M (2018) A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem. RAIRO-Oper Res 52(2):391\u2013414","journal-title":"RAIRO-Oper Res"},{"issue":"1","key":"9033_CR35","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0305-0548(94)90059-0","volume":"21","author":"FC Spieksma","year":"1994","unstructured":"Spieksma FC (1994) A branch-and-bound algorithm for the two-dimensional vector packing problem. Comput Oper Res 21(1):19\u201325","journal-title":"Comput Oper Res"},{"issue":"1","key":"9033_CR36","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.ejor.2019.08.024","volume":"281","author":"L Wei","year":"2020","unstructured":"Wei L, Lai M, Lim A, Hu Q (2020) A branch-and-price algorithm for the two-dimensional vector packing problem. Eur J Oper Res 281(1):25\u201335","journal-title":"Eur J Oper Res"},{"issue":"2","key":"9033_CR37","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1287\/ijoc.2018.0867","volume":"32","author":"L Wei","year":"2020","unstructured":"Wei L, Luo Z, Baldacci R, Lim A (2020) A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems. INFORMS J Comput 32(2):428\u2013443","journal-title":"INFORMS J Comput"},{"key":"9033_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106790","volume":"97","author":"CX Wu","year":"2020","unstructured":"Wu CX, Liao MH, Karatas M, Chen SY, Zheng YJ (2020) Real-time neural network scheduling of emergency medical mask production during covid-19. Appl Soft Comput 97:106790","journal-title":"Appl Soft Comput"},{"issue":"2","key":"9033_CR39","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.ejor.2009.05.040","volume":"202","author":"Y Wu","year":"2010","unstructured":"Wu Y, Li W, Goh M, de Souza R (2010) Three-dimensional bin packing problem with variable bin height. Eur J Oper Res 202(2):347\u2013355","journal-title":"Eur J Oper Res"},{"key":"9033_CR40","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.endm.2018.03.023","volume":"66","author":"A Zudio","year":"2018","unstructured":"Zudio A, da Silva Costa DH, Masquio BP, Coelho IM, Pinto PED (2018) BRKGA\/VND hybrid algorithm for the classic three-dimensional bin packing problem. Electronic Notes Discrete Math 66:175\u2013182","journal-title":"Electronic Notes Discrete Math"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-09033-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-023-09033-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-09033-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,13]],"date-time":"2023-10-13T17:07:22Z","timestamp":1697216842000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-023-09033-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,3]]},"references-count":40,"journal-issue":{"issue":"23","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["9033"],"URL":"https:\/\/doi.org\/10.1007\/s00500-023-09033-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2023,8,3]]},"assertion":[{"value":"17 July 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors report there are no competing interests to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}