Hybridising Tabu Search with Optimisation Techniques for Irregular Stock Cutting

Authors:
Julia A. Bennell;Kathryn A. Dowsland
Affiliations:
-;-
Venue:
Management Science
Year:
2001

Citing 0
Cited 10

Heuristics for a dynamic rural postman problem

Computers and Operations Research
Solving the two-dimensional irregular objects allocation problems by using a two-stage packing approach

Expert Systems with Applications: An International Journal
Simulated annealing applied to the irregular rotational placement of shapes over containers with fixed dimensions

Expert Systems with Applications: An International Journal
A global constraint for nesting problems

Artificial Intelligence Review
Mathematical model and efficient algorithms for object packing problem

Computational Geometry: Theory and Applications
A beam search implementation for the irregular shape packing problem

Journal of Heuristics
Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem

Computers and Operations Research
An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem

Discrete Optimization
Sequential quadratic programming method with a global search strategy on the cutting-stock problem with rotatable polygons

Journal of Intelligent Manufacturing
Algorithms for nesting with defects

Discrete Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

Sequential meta-heuristic implementations for the irregular stock-cutting problem have highlighted a number of common problems. The literature suggests a consensus that it is more efficient to allow configurations with overlapping pieces in the solution space and to penalise these in the evaluation function. However, depending on the severity of the penalty this relaxation results in a tendency to converge toward infeasible solutions or to seek out feasible solutions at the expense of overall quality. A further problem is encountered in defining a neighbourhood search strategy that can deal with the infinite solution space inherent in the irregular stock-cutting problem. The implementation in this paper adopts a hybrid tabu search approach that incorporates two very different optimisation routines that utilise alternative neighbourhoods to address the described problems.