A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem

DOI10.1287/IJOC.1080.0306MaRDI QIDQ2901082zbMATH OpenOpenAlexWikidataFDO

Authors Graham Kendall, Glenn Whitwell, Edmund K. 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

zbMATH Keywords

simulated annealingheuristicsstock cuttingindustries manufacturing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• A simulated annealing heuristic for the one-dimensional cutting stock problem
• An improved best-fit heuristic for the orthogonal strip packing problem
• An application of simulated annealing to the cutting stock problem
• Heuristics for the integer one-dimensional cutting stock problem: A computational study

Cited in

(29)

• Bidirectional best-fit heuristic for orthogonal rectangular strip packing
• Stochastic Algorithms: Foundations and Applications
• Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning
• A block-based layer building approach for the 2D guillotine strip packing problem
• A skyline heuristic for the 2D rectangular packing and strip packing problems
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• A hybrid algorithm based on variable neighbourhood for the strip packing problem
• A simple randomized algorithm for two-dimensional strip packing
• Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
• A hybrid placement strategy for the three-dimensional strip packing problem
• Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
• An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
• A simulated annealing heuristic for the one-dimensional cutting stock problem
• An effective shaking procedure for 2D and 3D strip packing problems
• Data structures for higher-dimensional rectilinear packing
• The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
• An exact strip packing algorithm based on canonical forms
• A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
• A squeaky wheel optimisation methodology for two-dimensional strip packing
• A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
• The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
• The three-dimensional knapsack problem with balancing constraints
• A reference length approach for the 3D strip packing problem
• A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
• CBAC4C: conflict‐based VM isolation control for cloud computing
• An efficient deterministic heuristic for two-dimensional rectangular packing
• An effective evolutionary algorithm for packing rectangles into a fixed size circular container
• An improved best-fit heuristic for the orthogonal strip packing problem
• An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem

This page was built for publication: A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901082)