A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
From MaRDI portal
Publication:5959380
DOI10.1016/S0305-0548(00)00095-2zbMath0995.90075OpenAlexW2152346031MaRDI QIDQ5959380
Ramón Alvarez-Valdés, José Manuel Tamarit, Antonio Parajón
Publication date: 24 October 2002
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00095-2
Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (36)
Fair and square: cake-cutting in two dimensions ⋮ Exact algorithm for generating two-segment cutting patterns of punched strips ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem ⋮ Heuristic for constrained T-shape cutting patterns of rectangular pieces ⋮ Simplest optimal cutting patterns for equal rectangles ⋮ Two-stage general block patterns for the two-dimensional cutting problem ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem ⋮ An EDA for the 2D knapsack problem with guillotine constraint ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming ⋮ An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems ⋮ Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem ⋮ Trim loss optimization by an improved differential evolution ⋮ Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study ⋮ T-shape homogeneous block patterns for the two-dimensional cutting problem ⋮ Improved state space relaxation for constrained two-dimensional guillotine cutting problems ⋮ Simple block patterns for the two-dimensional cutting problem ⋮ Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem ⋮ Exact algorithms for the two-dimensional guillotine knapsack ⋮ Strip generation algorithms for constrained two-dimensional two-staged cutting problems ⋮ Dynamic programming algorithms for the optimal cutting of equal rectangles ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ A bidirectional building approach for the 2D constrained guillotine knapsack packing problem ⋮ A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem ⋮ Optimization of the distribution of small scale linear Fresnel reflectors on roofs of urban buildings ⋮ The stochastic trim-loss problem ⋮ A recursive algorithm for constrained two-dimensional cutting problems ⋮ A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces ⋮ A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems ⋮ Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors ⋮ 2DPackLib: a two-dimensional cutting and packing library
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A probabilistic heuristic for a computationally difficult set covering problem
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- An and-or-graph approach for two-dimensional cutting problems
- A recursive exact algorithm for weighted two-dimensional cutting
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- Greedy randomized adaptive search procedures
- An improved version of Wang's algorithm for two-dimensional cutting problems
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- Une amélioration de l'algorithme récursif de Herz pour le problème de découpe à deux dimensions
This page was built for publication: A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
