A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
From MaRDI portal
Publication:2253410
DOI10.1016/j.ejor.2012.08.005zbMath1292.90174OpenAlexW2036932058MaRDI QIDQ2253410
Andrew E. B. Lim, Lijun Wei, Wee-Chong Oon, Wenbin Zhu
Publication date: 27 July 2014
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.08.005
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (13)
A hybrid heuristic algorithm for the 2D variable-sized bin packing problem ⋮ A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem ⋮ Sequential heuristic for the two-dimensional bin-packing problem ⋮ A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints ⋮ Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem ⋮ Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem ⋮ Triple-solution approach for the strip packing problem with two-staged patterns ⋮ A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints ⋮ Exact approaches for the unconstrained two-dimensional cutting problem with defects ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem ⋮ An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem ⋮ A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
This page was built for publication: A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
