A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems

DOI10.1057/PALGRAVE.JORS.2601829MaRDI QIDQ4679787zbMATH OpenOpenAlexFDO

Authors Ramón Alvarez-Valdes, José Manuel Tamarit, Francisco Parreño

Publication date 21 June 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2601829

zbMATH Keywords

heuristicsGRASPnon-guillotine cutting

Mathematics Subject Classification ID

Search theory (90B40) Combinatorial optimization (90C27)

Recommendations

• GRASP and path relinking for the two-dimensional two-stage cutting-stock problem
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• A recursive algorithm for constrained two-dimensional cutting problems
• A population heuristic for constrained two-dimensional non-guillotine cutting
• An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
• Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
• A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
• Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
• Algorithms for the constrained two-staged two-dimensional cutting problem
• An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems

Cited in

(26)

• A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
• TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
• An introduction to the two‐dimensional rectangular cutting and packing problem
• GRASP and path relinking for the two-dimensional two-stage cutting-stock problem
• Revenue maximization for multiple advertisements placement on a web banner using a pixel-price model
• A Hybrid Optimization Framework for Cutting and Packing Problems
• Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
• Queue-constrained packing: a vehicle ferry case study
• A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects
• Heuristic approaches for the two- and three-dimensional knapsack packing problem
• The stochastic trim-loss problem
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
• A hybrid algorithm for the non-Guillotine cutting problem
• Reactive GRASP for the strip-packing problem
• A least wasted first heuristic algorithm for the rectangular packing problem
• The maximum diversity assortment selection problem
• Heuristics for container loading of furniture
• A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
• Maximizing revenue with allocation of multiple advertisements on a Web banner
• An EDA for the 2D knapsack problem with guillotine constraint
• A population heuristic for constrained two-dimensional non-guillotine cutting
• A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
• An efficient deterministic heuristic for two-dimensional rectangular packing
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM
• A tabu search algorithm for a two-dimensional non-guillotine cutting problem

This page was built for publication: A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems

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