Using a tabu search approach for solving the two-dimensional irregular cutting problem
From MaRDI portal
Publication:2367010
DOI10.1007/BF02022998zbMath0771.90082OpenAlexW1979571206MaRDI QIDQ2367010
R. Walkowiak, P. Hawryluk, Jacek Błażewicz
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
Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (17)
A hybrid approach for packing irregular patterns using evolutionary strategies and neural network ⋮ Fast neighborhood search for two- and three-dimensional nesting problems ⋮ A clique covering MIP model for the irregular strip packing problem ⋮ Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes ⋮ A local search approach for two-dimensional irregular cutting ⋮ Metaheuristics: A bibliography ⋮ Solution approaches to irregular nesting problems ⋮ Algorithms for nesting with defects ⋮ An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects ⋮ [NO TITLE AVAILABLE] ⋮ An object-based evolutionary algorithm for solving nesting problems ⋮ Containment of a single polygon using mathematical programming ⋮ MIP-based heuristic for non-standard 3D-packing problems ⋮ Solving the irregular strip packing problem via guided local search for overlap minimization ⋮ Exact approaches for the cutting path determination problem ⋮ A 2-exchange heuristic for nesting problems ⋮ A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
Cites Work
This page was built for publication: Using a tabu search approach for solving the two-dimensional irregular cutting problem
