A tabu thresholding implementation for the irregular stock cutting problem

DOI10.1080/002075499189763MaRDI QIDQ4501391zbMATH OpenOpenAlexFDO

Authors Julia A. Bennell, K. Dowsland

Publication date 4 September 2000

Published in International Journal of Production Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/002075499189763

Mathematics Subject Classification ID

Production models (90B30)

Recommendations

• A local search approach for two-dimensional irregular cutting
• Tabu search for two-dimensional irregular cutting,
• Using a tabu search approach for solving the two-dimensional irregular 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

Cited in

(17)

• The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
• A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
• A local search approach for two-dimensional irregular cutting
• Raster penetration map applied to the irregular packing problem
• A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
• Using a tabu search approach for solving the two-dimensional irregular cutting problem
• Irregular packing: MILP model based on a polygonal enclosure
• Fast neighborhood search for two- and three-dimensional nesting problems
• Tabu search for two-dimensional irregular cutting,
• 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
• Two-dimensional profile-packing approach for multi-torch flame cutting
• Optimization of a line-cutting procedure for ship hull construction by an effective tabu search
• The minimum spanning tree problem with conflict constraints and its variations
• A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery
• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
• A beam search implementation for the irregular shape packing problem

This page was built for publication: A tabu thresholding implementation for the irregular stock cutting problem

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