Using a tabu search approach for solving the two-dimensional irregular cutting problem

DOI10.1007/BF02022998zbMATH Open0771.90082OpenAlexW1979571206MaRDI QIDQ2367010FDOQ2367010

Authors: P. Hawryluk, Rafał Walkowiak, Jacek Blazewicz 

Publication date: 16 August 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02022998

Recommendations

• Tabu search for two-dimensional irregular cutting,
• A local search approach for two-dimensional irregular cutting
• A tabu thresholding implementation for the irregular stock cutting problem
• A tabu search algorithm for a two-dimensional non-guillotine cutting problem
• A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem

zbMATH Keywords

tabu searchtwo-dimensional cuttingrectangular sheet of material

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• `` Strong NP-Completeness Results
• The tabu search metaheuristic: How we used it
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (20)

• Containment of a single polygon using mathematical programming
• An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects
• Solving the irregular strip packing problem via guided local search for overlap minimization
• A local search approach for two-dimensional irregular cutting
• Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
• Solution approaches to irregular nesting problems
• The sequential value correction method for the two-dimensional irregular cutting stock problem
• A 2-exchange heuristic for nesting problems
• Jostling for position: local improvement for irregular cutting patterns
• A clique covering MIP model for the irregular strip packing problem
• Algorithms for nesting with defects
• Tabu search for two-dimensional irregular cutting,
• Fast neighborhood search for two- and three-dimensional nesting problems
• MIP-based heuristic for non-standard 3D-packing problems
• Exact approaches for the cutting path determination problem
• A hybrid approach for packing irregular patterns using evolutionary strategies and neural network
• Metaheuristics: A bibliography
• An object-based evolutionary algorithm for solving nesting problems
• A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
• Optimization of a line-cutting procedure for ship hull construction by an effective tabu search

This page was built for publication: Using a tabu search approach for solving the two-dimensional irregular cutting problem

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