<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462024000301275</article-id>
<article-id pub-id-type="doi">10.13053/cys-28-3-5184</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Deep Study on the Application of Machine Learning in Bin Packing Problems]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[González-San-Martín]]></surname>
<given-names><![CDATA[Jessica]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Cruz-Reyes]]></surname>
<given-names><![CDATA[Laura]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Dorronsoro]]></surname>
<given-names><![CDATA[Bernabé]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Fraire-Huacuja]]></surname>
<given-names><![CDATA[Héctor]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Balderas-Jaramillo]]></surname>
<given-names><![CDATA[Fausto]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Quiroz-Castellanos]]></surname>
<given-names><![CDATA[Marcela]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rangel-Valdez]]></surname>
<given-names><![CDATA[Nelson]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Instituto Tecnológico de Ciudad Madero  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,University of Cadiz  ]]></institution>
<addr-line><![CDATA[Cadiz ]]></addr-line>
<country>Spain</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad Veracruzana Artificial Intelligence Research Center ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af4">
<institution><![CDATA[,Instituto Tecnológico de Ciudad Madero  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>09</month>
<year>2024</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>09</month>
<year>2024</year>
</pub-date>
<volume>28</volume>
<numero>3</numero>
<fpage>1275</fpage>
<lpage>1290</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462024000301275&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462024000301275&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462024000301275&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: This paper conducts a comprehensive review of literature focusing on strategies applied in the realm of Machine Learning (ML) in a period from ten years ago to the present to address the Bin Packing Problem (BPP) and its various variants. The Bin Packing Problem, a renowned optimization challenge, involves efficiently allocating items of varying sizes into containers of fixed capacity to minimize the number of containers used. Despite the extensive body of research and the existence of heuristic algorithms, unresolved challenges persist in BPP's solution. This deep study systematically explores the landscape of ML applications, delving into innovative approaches and methodologies proposed for tackling BPP and its diverse extensions, including 2D-BPP, 3D-BPP, Multi-objective BPP, and dynamic variants. The review critically examines the performance and contributions of ML-based strategies, shedding light on their efficacy in optimizing the packing process. Key findings highlight the promising directions taken by ML in solving complex optimization problems, emphasizing its potential to enhance BPP solution methodologies. The synthesis of diverse ML strategies and their integration with traditional heuristics forms a central theme, showcasing the evolving landscape of research in this domain. Additionally, this review identifies gaps and future research directions, emphasizing the relevance and effectiveness of ML as a valuable tool for improving performance in resolving BPP and its related challenges. The insights derived from this study aim to guide researchers, practitioners, and decision-makers in understanding the current state of ML applications in the context of Bin Packing Problems and inspire further advancements in this field.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Bin packing problem]]></kwd>
<kwd lng="en"><![CDATA[machine learning]]></kwd>
<kwd lng="en"><![CDATA[metaheuristics]]></kwd>
<kwd lng="en"><![CDATA[techniques and strategies]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Falkenauer]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid grouping genetic algorithm for bin packing]]></article-title>
<source><![CDATA[Journal of Heuristics]]></source>
<year>1996</year>
<volume>2</volume>
<page-range>5-30</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Martello]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Toth]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Lower bounds and reduction procedures for the bin packing problem]]></article-title>
<source><![CDATA[Discrete applied mathematics]]></source>
<year>1990</year>
<volume>28</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>59-70</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rivera]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Cisneros]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Sánchez-Solís]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Rangel-Valdez]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Rodas-Osollo]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Genetic algorithm for scheduling optimization considering heterogeneous containers: A real-world case study]]></article-title>
<source><![CDATA[Axioms]]></source>
<year>2020</year>
<volume>9</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>27</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gilmore]]></surname>
<given-names><![CDATA[P. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Gomory]]></surname>
<given-names><![CDATA[R. E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Multistage cutting stock problems of two and more dimensions]]></article-title>
<source><![CDATA[Operations research]]></source>
<year>1965</year>
<volume>13</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>94-120</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lodi]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Martello]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Monaci]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Two-dimensional packing problems: A survey]]></article-title>
<source><![CDATA[European journal of operational research]]></source>
<year>2002</year>
<volume>14</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>241-52</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lodi]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Martello]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Monaci]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Vigo]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Two-dimensional bin packing problems]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Paschos]]></surname>
<given-names><![CDATA[V. T.]]></given-names>
</name>
</person-group>
<source><![CDATA[Paradigms of combinatorial optimization: Problems and new approaches]]></source>
<year>2014</year>
<page-range>107-29</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Martello]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Pisinger]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Vigo]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The three-dimensional bin packing problem]]></article-title>
<source><![CDATA[Operations research]]></source>
<year>2000</year>
<volume>48</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>256-67</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Geiger]]></surname>
<given-names><![CDATA[M. J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Bin packing under multiple objectives heuristic approximation approach]]></source>
<year>2008</year>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Coffman-Jr]]></surname>
<given-names><![CDATA[E. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Garey]]></surname>
<given-names><![CDATA[M. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Johnson]]></surname>
<given-names><![CDATA[D. S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Dynamic bin packing]]></article-title>
<source><![CDATA[SIAM Journal on Computing]]></source>
<year>1983</year>
<volume>12</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>227-58</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Talbi]]></surname>
<given-names><![CDATA[E. G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Machine learning into metaheuristics: A survey and taxonomy]]></article-title>
<source><![CDATA[ACM Computing Surveys (CSUR)]]></source>
<year>2021</year>
<volume>54</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>1-32</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[De-Almeida]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Steiner]]></surname>
<given-names><![CDATA[M. T. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Resolution of 1-D bin packing problem using augmented neural networks and minimum bin slack]]></source>
<year>2015</year>
<conf-name><![CDATA[ Latin America Congress on Computational Intelligence]]></conf-name>
<conf-date>2015</conf-date>
<conf-loc> </conf-loc>
<page-range>1-6</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sim]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Hart]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Paechter]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A lifelong learning hyper-heuristic method for bin packing]]></article-title>
<source><![CDATA[Evolutionary computation]]></source>
<year>2015</year>
<volume>23</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>37-67</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Laterre]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Fu]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Jabri]]></surname>
<given-names><![CDATA[M. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Cohen]]></surname>
<given-names><![CDATA[A. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Kas]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Hajjar]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Beguir]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Ranked reward: enabling self-play reinforcement learning for bin packing]]></source>
<year>2019</year>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kroes]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Petrica]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Cotofana]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Blott]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Evolutionary bin packing for memory-efficient dataflow inference acceleration on FPGA]]></source>
<year>2020</year>
<conf-name><![CDATA[ Genetic and Evolutionary Computation Conference]]></conf-name>
<conf-date>2020</conf-date>
<conf-loc> </conf-loc>
<page-range>1125-33</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hu]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Yan]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Xu]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<source><![CDATA[Solving a new 3d bin packing problem with deep reinforcement learning method]]></source>
<year>2017</year>
</nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mao]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Blanco]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Fu]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Jain]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Gupta]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Mancel]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Tian]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<source><![CDATA[Small boxes big data: A deep learning approach to optimize variable sized bin packing]]></source>
<year>2017</year>
<conf-name><![CDATA[ IEEE Third International Conference on Big Data Computing Service and Applications]]></conf-name>
<conf-date>2017</conf-date>
<conf-loc> </conf-loc>
<page-range>80-9</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nanda]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Hacker]]></surname>
<given-names><![CDATA[T. J.]]></given-names>
</name>
</person-group>
<source><![CDATA[RACC: Resource-aware container consolidation using a deep learning approach]]></source>
<year>2018</year>
<conf-name><![CDATA[ First Workshop on Machine Learning for Computing Systems]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1-5</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Hu]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[DeepJS: Job scheduling based on deep reinforcement learning in cloud data center]]></source>
<year>2019</year>
<conf-name><![CDATA[ 4th International Conference on Big Data and Computing]]></conf-name>
<conf-loc> </conf-loc>
<page-range>48-53</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Verma]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Singhal]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Khadilkar]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Basumatary]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Nayak]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Singh]]></surname>
<given-names><![CDATA[H. V.]]></given-names>
</name>
<name>
<surname><![CDATA[Sinha]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[A generalized reinforcement learning algorithm for online 3d bin-packing]]></source>
<year>2020</year>
</nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Goyal]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Deng]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Packit: A virtual environment for geometric planning]]></source>
<year>2020</year>
<volume>119</volume>
<conf-name><![CDATA[ International Conference on Machine Learning]]></conf-name>
<conf-loc> </conf-loc>
<page-range>3700-10</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Silva-Gálvez]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Orozco-Sanchez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Lara-Cárdenas]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Ortiz-Bayliss]]></surname>
<given-names><![CDATA[J. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Amaya]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Cruz-Duarte]]></surname>
<given-names><![CDATA[J. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Terashima-Marín]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Discovering action regions for solving the bin packing problem through hyper-heuristics]]></source>
<year>2020</year>
<conf-name><![CDATA[ Symposium Series on Computational Intelligence]]></conf-name>
<conf-date>2020</conf-date>
<conf-loc> </conf-loc>
<page-range>822-8</page-range></nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhao]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[She]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhu]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Xu]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Online 3D bin packing with constrained deep reinforcement learning]]></source>
<year>2021</year>
<volume>35</volume>
<numero>1</numero>
<conf-name><![CDATA[ AAAI Conference on Artificial Intelligence]]></conf-name>
<conf-loc> </conf-loc>
<issue>1</issue>
<page-range>741-9</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Luo]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Fuentes]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Ding]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Gu]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A flexible reinforced bin packing framework with automatic slack selection]]></article-title>
<source><![CDATA[Mathematical Problems in Engineering]]></source>
<year>2021</year>
<volume>2021</volume>
<page-range>1-15</page-range></nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Zi]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Ge]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
</person-group>
<source><![CDATA[Attend2pack: Bin packing through deep reinforcement learning with attention]]></source>
<year>2021</year>
</nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jiang]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Cao]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Solving 3D bin packing problem via multimodal deep reinforcement learning]]></source>
<year>2021</year>
<volume>3</volume>
<conf-name><![CDATA[ 20th International Conference on Autonomous Agents and MultiAgent Systems]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1548-50</page-range></nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Murdivien]]></surname>
<given-names><![CDATA[S. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Um]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[BoxStacker: Deep reinforcement learning for 3D bin packing problem in virtual environment of logistics systems]]></article-title>
<source><![CDATA[Sensors]]></source>
<year>2023</year>
<volume>23</volume>
<numero>15</numero>
<issue>15</issue>
<page-range>6928</page-range></nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Rao]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhao]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Du]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid reinforcement learning algorithm for 2D irregular packing problems]]></article-title>
<source><![CDATA[Mathematics]]></source>
<year>2023</year>
<volume>11</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>327</page-range></nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Guerriero]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Saccomanno]]></surname>
<given-names><![CDATA[F. P.]]></given-names>
</name>
</person-group>
<source><![CDATA[A machine learning approach for the bin packing problem]]></source>
<year>2023</year>
<volume>1</volume>
<conf-name><![CDATA[ IEEE 12th International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications]]></conf-name>
<conf-date>2023</conf-date>
<conf-loc> </conf-loc>
<page-range>436-41</page-range></nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Duan]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Hu]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Qian]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Gong]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Xu]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Wei]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[A multi-task selected learning approach for solving 3D flexible bin packing problem]]></source>
<year>2018</year>
</nlm-citation>
</ref>
<ref id="B30">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mohiuddin]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Almogren]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Al Qurishi]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Hassan]]></surname>
<given-names><![CDATA[M. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Al-Rassan]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Fortino]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Secure distributed adaptive bin packing algorithm for cloud storage]]></article-title>
<source><![CDATA[Future Generation Computer Systems]]></source>
<year>2019</year>
<volume>90</volume>
<page-range>307-16</page-range></nlm-citation>
</ref>
<ref id="B31">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sim]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Hart]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Paechter]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[Learning to solve bin packing problems with an immune inspired hyper-heuristic]]></source>
<year>2013</year>
<page-range>856-63</page-range></nlm-citation>
</ref>
<ref id="B32">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sim]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Hart]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Generating single and multiple cooperative heuristics for the one-dimensional bin packing problem using a single node genetic programming island model]]></source>
<year>2013</year>
<conf-name><![CDATA[ 15th annual conference on Genetic and evolutionary computation]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1549-56</page-range></nlm-citation>
</ref>
<ref id="B33">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Scholl]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Klein]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Jürgens]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>1997</year>
<volume>24</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>627-45</page-range></nlm-citation>
</ref>
<ref id="B34">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Falkenauer]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid grouping genetic algorithm for bin packing]]></article-title>
<source><![CDATA[Journal of Heuristics]]></source>
<year>1996</year>
<volume>2</volume>
<page-range>5-30</page-range></nlm-citation>
</ref>
<ref id="B35">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ha]]></surname>
<given-names><![CDATA[C. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Nguyen]]></surname>
<given-names><![CDATA[T. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Bui]]></surname>
<given-names><![CDATA[L. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[An online packing heuristic for the three-dimensional container loading problem in dynamic environments and the Physical Internet]]></source>
<year>2017</year>
<conf-name><![CDATA[ Applications of Evolutionary Computation: 20th European Conference, EvoApplications]]></conf-name>
<conf-date>2017</conf-date>
<conf-loc>Amsterdam </conf-loc>
<page-range>140-55</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
