A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
From MaRDI portal
Publication:2901082
DOI10.1287/ijoc.1080.0306zbMath1243.90254OpenAlexW2136533266WikidataQ59569452 ScholiaQ59569452MaRDI QIDQ2901082
Graham Kendall, G. Whitwell, Edmund Kieran Burke
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1080.0306
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (25)
A block-based layer building approach for the 2D guillotine strip packing problem ⋮ A hybrid algorithm based on variable neighbourhood for the strip packing problem ⋮ An effective shaking procedure for 2D and 3D strip packing problems ⋮ An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation ⋮ A simple randomized algorithm for two-dimensional strip packing ⋮ An exact strip packing algorithm based on canonical forms ⋮ A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ A reference length approach for the 3D strip packing problem ⋮ A hybrid placement strategy for the three-dimensional strip packing problem ⋮ A squeaky wheel optimisation methodology for two-dimensional strip packing ⋮ CBAC4C: conflict‐based VM isolation control for cloud computing ⋮ A skyline heuristic for the 2D rectangular packing and strip packing problems ⋮ Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand ⋮ The three-dimensional knapsack problem with balancing constraints ⋮ Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning ⋮ A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint ⋮ A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem ⋮ An efficient deterministic heuristic for two-dimensional rectangular packing ⋮ Bidirectional best-fit heuristic for orthogonal rectangular strip packing ⋮ Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows ⋮ The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio ⋮ An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem ⋮ Data Structures for Higher-Dimensional Rectilinear Packing ⋮ An improved best-fit heuristic for the orthogonal strip packing problem
This page was built for publication: A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
