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

DOI10.1007/BF02022998MaRDI QIDQ2367010zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

rectangular sheet of materialtabu searchtwo-dimensional cutting

Mathematics Subject Classification ID

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

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

Cites work

• `` Strong NP-Completeness Results
• scientific article; zbMATH DE number 4207427 (Why is no real title available?)
• scientific article; zbMATH DE number 4168061 (Why is no real title available?)
• The tabu search metaheuristic: How we used it

Cited in

(21)

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

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)