A beam search implementation for the irregular shape packing problem
type: Item
instance of: scholarly article
title: A beam search implementation for the irregular shape packing problem
zbMATH Open document ID: 1190.90154
author: Julia A. Bennell
author: X. Song
published in: Journal of Heuristics
publication date: 2010-04-21T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5696501
zbMATH Keywords: cutting and packing
zbMATH Keywords: nesting problems
zbMATH Keywords: irregular shape
zbMATH Keywords: beam search
describes a project that uses: TOPOS
MaRDI profile type: Publication
full work available at URL: s10732-008-9095-x
OpenAlex ID: W2029050146
cites work: A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
cites work: A tabu thresholding implementation for the irregular stock cutting problem
cites work: A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
cites work: Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
cites work: A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
cites work: Complete and robust no-fit polygon generation for the irregular stock cutting problem
cites work: Jostling for position: local improvement for irregular cutting patterns
cites work: An algorithm for polygon placement using a bottom-left strategy
cites work: Fast neighborhood search for two- and three-dimensional nesting problems
cites work: Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
cites work: A 2-exchange heuristic for nesting problems
cites work: Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
cites work: A simulated annealing approach to the nesting problem in the textile manufacturing industry
cites work: Computing closely matching upper and lower bounds on textile nesting problems
cites work: On genetic algorithms for the packing of polygons
cites work: TOPOS -- A new constructive algorithm for nesting problems
cites work: Job shop scheduling with beam search
cites work: An improved typology of cutting and packing problems
DOI: 10.1007/S10732-008-9095-X
description: scientific article; zbMATH DE number 5696501