A local search approach for two-dimensional irregular cutting

DOI10.1007/BF01719251zbMATH Open0843.90095OpenAlexW1973273776MaRDI QIDQ1908994FDOQ1908994

Jacek Blazewicz, Rafał Walkowiak

Publication date: 19 August 1996

Published in: OR Spektrum (Search for Journal in Brave)

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

Recommendations

• Tabu search for two-dimensional irregular cutting,
• Using a tabu search approach for solving the two-dimensional irregular cutting problem
• A tabu thresholding implementation for the irregular stock cutting problem
• A tabu search algorithm for a two-dimensional non-guillotine cutting problem
• A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems

zbMATH Keywords

simulated annealingtabu searchtwo-dimensional irregular cutting problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Future paths for integer programming and links to artificial intelligence
• Tabu Search—Part I
• `` Strong NP-Completeness Results
• Tabu Search—Part II
• Using a tabu search approach for solving the two-dimensional irregular cutting problem
• Title not available (Why is that?)

Cited In (7)

• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
• Complete and robust no-fit polygon generation for the irregular stock cutting problem
• Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
• Tabu search for two-dimensional irregular cutting,
• Fast neighborhood search for two- and three-dimensional nesting problems
• Metaheuristics: A bibliography
• A tabu search algorithm for a two-dimensional non-guillotine cutting problem

This page was built for publication: A local search approach for two-dimensional irregular cutting

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