A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
From MaRDI portal
Publication:5321741
DOI10.1287/opre.1040.0109zbMath1165.90690OpenAlexW2011690685MaRDI QIDQ5321741
G. Whitwell, Graham Kendall, Edmund Kieran Burke
Publication date: 14 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/b659a0412ebfa1b8bbad631cf3e10ac711edb6f3
Related Items (72)
A block-based layer building approach for the 2D guillotine strip packing problem ⋮ A hybrid evolutionary algorithm for the two-dimensional packing problem ⋮ A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang ⋮ A hybrid algorithm based on variable neighbourhood for the strip packing problem ⋮ A guided tabu search for the vehicle routing problem with two-dimensional loading constraints ⋮ An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem ⋮ An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry ⋮ Scheduling unrelated additive manufacturing machines with practical constraints ⋮ A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls ⋮ An effective shaking procedure for 2D and 3D strip packing problems ⋮ Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory ⋮ A hybrid genetic algorithm for the two-dimensional single large object placement problem ⋮ Efficient implementations of construction heuristics for the rectilinear block packing problem ⋮ A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem ⋮ Logic based Benders' decomposition for orthogonal stock cutting problems ⋮ An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation ⋮ VCS: A new heuristic function for selecting boxes in the single container loading problem ⋮ A simple randomized algorithm for two-dimensional strip packing ⋮ An exact strip packing algorithm based on canonical forms ⋮ A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation ⋮ Corner occupying theorem for the two-dimensional integral rectangle packing problem ⋮ A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem ⋮ Combinatorial Benders' Cuts for the Strip Packing Problem ⋮ Single workgroup scheduling problem with variable processing personnel ⋮ Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing ⋮ 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 heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Rectangle packing with a recursive pilot method ⋮ A hybrid placement strategy for the three-dimensional strip packing problem ⋮ A squeaky wheel optimisation methodology for two-dimensional strip packing ⋮ Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints ⋮ An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem ⋮ A skyline heuristic for the 2D rectangular packing and strip packing problems ⋮ The three-dimensional knapsack problem with balancing constraints ⋮ An iterated local search algorithm for a place scheduling problem ⋮ Asymptotically optimal scheduling of random malleable demands in smart grid ⋮ Exact and heuristic methods for optimizing lock-quay system in inland waterway ⋮ Reactive GRASP for the strip-packing problem ⋮ Ant colony optimization for the two-dimensional loading vehicle routing problem ⋮ Numerical optimization method for packing regular convex polygons ⋮ A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem ⋮ A least wasted first heuristic algorithm for the rectangular packing problem ⋮ New resolution algorithm and pretreatments for the two-dimensional bin-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 ⋮ Bidirectional best-fit heuristic for orthogonal rectangular strip packing ⋮ An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows ⋮ Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet ⋮ 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 ⋮ Upper bounds for heuristic approaches to the strip packing problem ⋮ The maximum diversity assortment selection problem ⋮ Data Structures for Higher-Dimensional Rectilinear Packing ⋮ A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem ⋮ New Lower Bound and Exact Method for the Continuous Berth Allocation Problem ⋮ An open space based heuristic for the 2D strip packing problem with unloading constraints ⋮ Deterministic model for customized pilot manufacture production with various backplane sizes ⋮ A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations ⋮ Exact algorithms for the two-dimensional strip packing problem with and without rotations ⋮ Mathematical justification of a heuristic for statistical correlation of real-life time series ⋮ A hybrid metaheuristic for the two-dimensional strip packing problem ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems ⋮ Mathematical modeling and optimal blank generation in glass manufacturing ⋮ An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle ⋮ An improved best-fit heuristic for the orthogonal strip packing problem ⋮ 2DPackLib: a two-dimensional cutting and packing library ⋮ A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties
This page was built for publication: A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
