{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T15:17:00Z","timestamp":1770909420757,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T00:00:00Z","timestamp":1732665600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T00:00:00Z","timestamp":1732665600000},"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":["J Heuristics"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10732-024-09537-y","type":"journal-article","created":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T06:54:35Z","timestamp":1732690475000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An adaptative multi-objective scatter search for solving the dynamic bin packing problem"],"prefix":"10.1007","volume":"31","author":[{"given":"M\u00e9ziane","family":"A\u00efder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabrin","family":"Boulebene","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mhand","family":"Hifi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,27]]},"reference":[{"key":"9537_CR1","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10732-023-09511-0","volume":"29","author":"F Baatout","year":"2023","unstructured":"Baatout, F., Hifi, M.: A two-phase hybrid evolutionary algorithm for solving the bi-objective scheduling multiprocessor tasks on two dedicated processors. J. Heuristics 29, 229\u2013267 (2023)","journal-title":"J. Heuristics"},{"issue":"4","key":"9537_CR2","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"JE Baker","year":"1983","unstructured":"Baker, J.E., Rivest, R.: Orthogonal packings in two dimensions. SIAM J. Comput. 9(4), 846\u2013855 (1983)","journal-title":"SIAM J. Comput."},{"key":"9537_CR3","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jspi.2014.12.004","volume":"160","author":"Y Cao","year":"2015","unstructured":"Cao, Y., Smucker, B., Robinson, T.: On using the hypervolume indicator to compare pareto fronts: applications to multi-criteria optimal experimental design. J. Stat. Plan. Inference 160, 60\u201374 (2015)","journal-title":"J. Stat. Plan. Inference"},{"key":"9537_CR4","unstructured":"Cengel, Y.A.: Heat transfer: A practical approach. McGraw-Hill series in mechanical engineering (2003)"},{"issue":"2","key":"9537_CR5","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/0212014","volume":"12","author":"JEG Coffman","year":"1983","unstructured":"Coffman, J.E.G., Garey, M., Johnson, D.: Dynamic bin packing. SIAM J. Comput. 12(2), 227\u2013258 (1983)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9537_CR6","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.: Bin packing and cutting stock problems: mathematical models and exact algorithms. Eur. J. Oper. Res. 255(1), 1\u201320 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"9537_CR7","doi-asserted-by":"publisher","first-page":"13057","DOI":"10.1016\/j.eswa.2011.04.110","volume":"38","author":"E Duman","year":"2011","unstructured":"Duman, E., Ozcelik, M.H.: Detecting credit card fraud by genetic algorithm and scatter search. Expert Syst. Appl. 38(10), 13057\u201313063 (2011)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"9537_CR8","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.: A typology of cutting and packing problems. Eur. J. Oper. Res. 44(2), 145\u2013159 (1990)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9537_CR9","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1016\/j.ejor.2009.01.048","volume":"200","author":"J Egeblad","year":"2010","unstructured":"Egeblad, J., Garavelli, C., Lisi, S., Pisinger, D.: Heuristics for container loading of furniture. Eur. J. Oper. Res. 200(3), 881\u2013892 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9537_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1080\/03052150512331303436","volume":"37","author":"R Farmani","year":"2002","unstructured":"Farmani, R., Savic, D., Walters, G.: Evolutionary multi-objective optimization in water distribution network design. Eng. Optim. 37(2), 167\u2013183 (2002)","journal-title":"Eng. Optim."},{"key":"9537_CR11","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s10732-020-09444-y","volume":"26","author":"Y Fu","year":"2020","unstructured":"Fu, Y., Banerjee, A.: Heuristic\/meta-heuristic methods for restricted bin packing problem. J. Heuristics 26, 637\u2013662 (2020)","journal-title":"J. Heuristics"},{"key":"9537_CR12","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.cor.2019.04.012","volume":"108","author":"A Garcia-Le\u00f3n","year":"2019","unstructured":"Garcia-Le\u00f3n, A., Dauz\u00e8re-P\u00e9r\u00e8s, S., Marti, Y.: An efficient pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria. Comput. Oper. Res. 108, 187\u2013200 (2019)","journal-title":"Comput. Oper. Res."},{"key":"9537_CR13","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1009678411503","volume":"3","author":"I Gent","year":"1998","unstructured":"Gent, I.: Heuristic solution of open bin packing problems. J. Heuristics 3, 299\u2013304 (1998)","journal-title":"J. Heuristics"},{"key":"9537_CR14","doi-asserted-by":"crossref","unstructured":"Glover, F.: A template for scatter search and path relinking. In: European Conference on Artificial Evolution, pp. 1\u201351, Springer (1997)","DOI":"10.1007\/BFb0026589"},{"key":"9537_CR15","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10710-017-9301-4","volume":"19","author":"J Gomez","year":"2018","unstructured":"Gomez, J., Terashima-Marin, H.: Evolutionary hyper-heuristics for tackling bi-objective 2d bin packing problems. Genet. Program Evolvable Mach. 19, 151\u2013181 (2018)","journal-title":"Genet. Program Evolvable Mach."},{"issue":"5","key":"9537_CR16","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1287\/opre.2019.1914","volume":"68","author":"V Gupta","year":"2020","unstructured":"Gupta, V., Radovanovi\u0107, A.: Interior-point-based online stochastic bin packing. Oper. Res. 68(5), 1474\u20131492 (2020)","journal-title":"Oper. Res."},{"issue":"11","key":"9537_CR17","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1016\/S0305-0548(98)00008-2","volume":"25","author":"M Hifi","year":"1998","unstructured":"Hifi, M.: Exact algorithms for the guillotine strip cutting\/packing problem. Comput. Oper. Res. 25(11), 925\u2013940 (1998)","journal-title":"Comput. Oper. Res."},{"key":"9537_CR18","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1023\/B:JOCO.0000021938.49750.91","volume":"8","author":"M Hifi","year":"2004","unstructured":"Hifi, M.: Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems. J. Comb. Optim. 8, 65\u201384 (2004)","journal-title":"J. Comb. Optim."},{"issue":"5","key":"9537_CR19","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/S0305-0548(03)00019-4","volume":"31","author":"M Hifi","year":"2004","unstructured":"Hifi, M.: Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study. Comput. Oper. Res. 31(5), 657\u2013674 (2004)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9537_CR20","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."},{"key":"9537_CR21","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10732-013-9234-x","volume":"20","author":"R Kothari","year":"2014","unstructured":"Kothari, R., Ghosh, D.: A scatter search algorithm for the single row facility layout problem. J. Heuristics 20, 125\u2013142 (2014)","journal-title":"J. Heuristics"},{"key":"9537_CR22","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-1-4614-6940-7_5","volume-title":"Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques","author":"M Laguna","year":"2014","unstructured":"Laguna, M.: Scatter search. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, pp. 119\u2013141. Springer, Boston (2014)"},{"issue":"1","key":"9537_CR23","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/TPDS.2015.2393868","volume":"27","author":"Y Li","year":"2016","unstructured":"Li, Y., Tang, X.: Dynamic bin packing for on-demand cloud resource allocation. IEEE Trans. Parallel Distrib. Syst. 27(1), 157\u2013170 (2016)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"9537_CR24","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/TPDS.2015.2393868","volume":"27","author":"Y Li","year":"2016","unstructured":"Li, Y., Tang, X., Cai, W.: Dynamic bin packing for on-demand cloud resource allocation. IEEE Trans. Parallel Distrib. Syst. 27(1), 157\u2013170 (2016)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"9537_CR25","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.ejor.2007.06.032","volume":"190","author":"D Liu","year":"2008","unstructured":"Liu, D., Tan, K., Huang, S., Goh, C., Ho, W.: On solving multiobjective bin packing problems using evolutionary particle swarm optimization. Eur. J. Oper. Res. 190(2), 357\u2013382 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9537_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.108060","volume":"114","author":"Q Luo","year":"2022","unstructured":"Luo, Q., Rao, Y., Peng, D.: Ga and gwo algorithm for the special bin packing problem encountered in field of aircraft arrangement. Appl. Soft Comput. 114, 108060 (2022)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"9537_CR27","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.ejor.2010.01.040","volume":"206","author":"B Maenhout","year":"2010","unstructured":"Maenhout, B., Vanhoucke, M.: A hybrid scatter search heuristic for personalized crew rostering in the airline industry. Eur. J. Oper. Res. 206(1), 155\u2013167 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"9537_CR28","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.: The three-dimensional bin packing problem. Oper. Res. 48, 256\u2013267 (2000)","journal-title":"Oper. Res."},{"issue":"3","key":"9537_CR29","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.: Exact solution of the two-dimensional finite bin packing problem. Manage. Sci. 44(3), 388\u2013399 (1998)","journal-title":"Manage. Sci."},{"issue":"2","key":"9537_CR30","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.ejor.2004.08.004","volume":"169","author":"R Marti","year":"2006","unstructured":"Marti, R., Laguna, M., Glover, F.: Principles of scatter search. Eur. J. Oper. Res. 169(2), 359\u2013372 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9537_CR31","doi-asserted-by":"crossref","unstructured":"Nitin, N., Karwe, M.: Heat transfer coefficient for model cookies in a turbulent multiple jet impingement system. In: Transport Phenomena in Food Processing, pp. 379\u2013398. CRC Press (2016)","DOI":"10.1201\/9781420006261-28"},{"key":"9537_CR32","doi-asserted-by":"crossref","unstructured":"Paquete, L., Chiarandini, M., Stutzle, T.: Pareto local optimum sets in the biobjective traveling salesman problem: An experimental study. In: Metaheuristics for Multiobjective Optimisation, pp. 177\u2013199 (2004)","DOI":"10.1007\/978-3-642-17144-4_7"},{"issue":"3","key":"9537_CR33","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1016\/j.ejor.2014.02.059","volume":"237","author":"E Silva","year":"2014","unstructured":"Silva, E., Oliveira, J., Wascher, G.: 2dcpackgen: a problem generator for two-dimensional rectangular cutting and packing problems. Eur. J. Oper. Res. 237(3), 846\u2013856 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9537_CR34","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/333623.333627","volume":"30","author":"S Skiena","year":"1999","unstructured":"Skiena, S.: Who is interested in algorithms and why?: Lessons from the stony brook algorithms repository. ACM SIGACT News 30(3), 65\u201374 (1999)","journal-title":"ACM SIGACT News"},{"key":"9537_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-018-9382-0","volume":"25","author":"K Spencer","year":"2019","unstructured":"Spencer, K., Tsvetkov, P., Jarrell, J.: A greedy memetic algorithm for a multiobjective dynamic bin packing problem for storing cooling objects. J. Heuristics 25, 1\u201345 (2019)","journal-title":"J. Heuristics"},{"key":"9537_CR36","doi-asserted-by":"crossref","unstructured":"Tang, S., Huang, Q., Li, X., Wu, D.: Smoothing the energy consumption: Peak demand reduction in smart grid. In: IEEE INFOCOM, pp. 1133\u20131141 (2013)","DOI":"10.1109\/INFCOM.2013.6566904"},{"issue":"3","key":"9537_CR37","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G Wascher","year":"2007","unstructured":"Wascher, G., HauBner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183(3), 1109\u20131130 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9537_CR38","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.ejor.2004.08.019","volume":"169","author":"DS Yamashita","year":"2006","unstructured":"Yamashita, D.S., Armentano, V.A., Laguna, M.: Scatter search for project scheduling with resource availability cost. Eur. J. Oper. Res. 169, 623\u2013637 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9537_CR39","volume-title":"Homogeneous Charge Compression Ignition (HCCI) Engines: Key Research and Development Issues","author":"F Zhao","year":"2003","unstructured":"Zhao, F., Asmus, T., Assanis, D., Dec, J., Eng, J., Najt, P.: Homogeneous Charge Compression Ignition (HCCI) Engines: Key Research and Development Issues. Society of Automotive Engineers, Warrendale, PA (2003)"},{"key":"9537_CR40","doi-asserted-by":"crossref","unstructured":"Zhu, Z., Sui, J., Yang, L.: Bin-packing algorithms for periodic task scheduling. In: IEEE WASE International Conference on Information Engineering, pp. 207\u2013210 (2010)","DOI":"10.1109\/ICIE.2010.145"},{"issue":"4","key":"9537_CR41","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans. Evol. Comput. 3(4), 257\u2013271 (1999)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-024-09537-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-024-09537-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-024-09537-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T13:17:31Z","timestamp":1741439851000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-024-09537-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,27]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["9537"],"URL":"https:\/\/doi.org\/10.1007\/s10732-024-09537-y","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,27]]},"assertion":[{"value":"9 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"5"}}