An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry
From MaRDI portal
Publication:319718
DOI10.1016/j.ejor.2015.04.044zbMath1346.90505OpenAlexW2080271987MaRDI QIDQ319718
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.04.044
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
A hybrid adaptively genetic algorithm for task scheduling problem in the phased array radar ⋮ Deterministic model for customized pilot manufacture production with various backplane sizes
Uses Software
Cites Work
- Unnamed Item
- An efficient placement heuristic for three-dimensional rectangular packing
- A new heuristic algorithm for rectangle packing
- A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach
- A least wasted first heuristic algorithm for the rectangular packing problem
- Guillotineable bin packing: A genetic approach
- An analytical model for the container loading problem
- The trim-loss and assortment problems: A survey
- On genetic algorithms for the packing of polygons
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- An efficient deterministic heuristic for two-dimensional rectangular packing
- A combined approach to the solution to the general one-dimensional cutting stock problem
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- A typology of cutting and packing problems
- A genetic algorithm solution for one-dimensional bundled stock cutting
- Heuristics for the container loading problem
- An effective quasi-human based heuristic for solving the rectangle packing problem
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
- One-dimensional cutting stock problem to minimize the number of different patterns
- A caving degree approach for the single container loading problem
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A new heuristic recursive algorithm for the strip rectangular packing problem
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- Optimal Integer Solutions to Industrial Cutting Stock Problems
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
