An algorithm for the two-dimensional assortment problem
We consider the two-dimensional assortment problem. This is the problem of choosing from a set of stock rectangles a subset which can be used for cutting into a number of smaller rectangular pieces. Constraints are imposed upon the number of such pieces which result from the cutting. A heuristic algorithm for the guillotine cutting version of the problem is developed based on a greedy procedure for generating two-dimensional cutting patterns, a linear program for choosing the cutting patterns to use and an interchange procedure to decide the best subset of stock rectangles to cut. Computational results are presented for a number of test problems which indicate that the algorithm developed produces good quality results both for assortment problems and for two-dimensional cutting problems.
- An algorithm for the 2D guillotine cutting stock problem
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An algorithm for the two-dimensional cutting-stock problem based on a pattern generation procedure
- A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A New Linear Programming Approach to the Cutting Stock Problem
- A Note on a Two-dimensional Dynamic Programming Problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- scientific article; zbMATH DE number 3495856 (Why is no real title available?)
- The Theory and Computation of Knapsack Functions
- The trim-loss and assortment problems: A survey
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- A dynamic programming based heuristic for industrial buying of cardboard
- Solution to the assortment problem via the genetic algorithm
- An approximately global optimization method for assortment problems
- A search strategy for the one-size assortment problem
- A mixed-integer programming model for a class of assortment problems
- Heuristic methods and applications: A categorized survey
- Approximation solutions for the cutting stock `portfolio' problem
- Knowledge-based systems for cutting stock problems
- Two-dimensional homing sort
- Solving packing problems by a distributed global optimization algorithm
- A note on ``Reducing the number of binary variables in cutting stock problems
- An optimization model for trim loss minimization in an automotive glass plant
- Determining the best shipper sizes for sending products to customers
- A comparison of solution methods for the assortment problem
- scientific article; zbMATH DE number 3914057 (Why is no real title available?)
- An asymptotic distribution-free selection procedure for a two-way layout problem
- The Discrete Two-Dimensional Assortment Problem
- A column generation procedure for gang-rip saw arbor design and scheduling
- scientific article; zbMATH DE number 1310285 (Why is no real title available?)
- scientific article; zbMATH DE number 2043380 (Why is no real title available?)
- scientific article; zbMATH DE number 906532 (Why is no real title available?)
- A two-objective mathematical model without cutting patterns for one-dimensional assortment problems
- A fast algorithm for assortment optimization problems
- A multi-objective programming approach to 1.5-dimensional assortment problem
This page was built for publication: An algorithm for the two-dimensional assortment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q759646)
