Cutting path optimization using tabu search

Reginald Dewil*, Pieter Vansteenwegen, Dirk Cattrysse

*Corresponding author for this work

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

This paper deals with generating paths for cutting irregular parts nested on a metal sheet. The objective is to minimize the total non-cutting time for the cutter head starting at a known location, cutting all the required elements and returning to the known location. In contrast to most literature on this topic, a part does not have to be cut at once. If this reduces the total non-cutting time, it is possible to cut a number of elements on a given part, then cut other parts and then return later to finish cutting the given part. The problem is modeled as a generalized traveling salesperson problem with special precedence constraints. An initial feasible solution is generated and improved by local moves embedded in a tabu search framework. The proposed algorithm shows promising results in comparison with a commercial software package on a limited set of test cases.

Original languageEnglish
Title of host publicationSheet Metal 2011, SheMet 2011
Pages739-748
Number of pages10
DOIs
Publication statusPublished - 26 Apr 2011
Externally publishedYes
Event14th International Conference on Sheet Metal, SheMet 2011 - Leuven, Belgium
Duration: 18 Apr 201120 Apr 2011

Publication series

NameKey Engineering Materials
Volume473
ISSN (Print)1013-9826

Conference

Conference14th International Conference on Sheet Metal, SheMet 2011
CountryBelgium
CityLeuven
Period18/04/1120/04/11

Keywords

  • Cutting path
  • Tabu search

Fingerprint

Dive into the research topics of 'Cutting path optimization using tabu search'. Together they form a unique fingerprint.

Cite this