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.90254WikidataQ59569452 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
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
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, A simple randomized algorithm for two-dimensional strip packing, An exact strip packing algorithm based on canonical forms, 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, A hybrid placement strategy for the three-dimensional strip packing problem, A squeaky wheel optimisation methodology for two-dimensional strip packing, The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio, An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation, A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem, 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, Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows, A reference length approach for the 3D strip packing problem, Bidirectional best-fit heuristic for orthogonal rectangular strip packing, 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
