An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
type: Item
instance of: scholarly article
title: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
zbMATH Open document ID: 0982.90044
DOI: 10.1016/S0377-2217(99)00357-4
author: E. Hopper
author: B. C. H. Turton
published in: European Journal of Operational Research
publication date: 2002-04-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1556522
zbMATH Keywords: cutting
zbMATH Keywords: packing
zbMATH Keywords: genetic algorithms
zbMATH Keywords: simulated annealing
zbMATH Keywords: optimization
describes a project that uses: LEDA
MaRDI profile type: Publication
cites work: Orthogonal Packings in Two Dimensions
cites work: The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
cites work: Q3347319
cites work: Some experiments with simulated annealing techniques for packing problems
cites work: A typology of cutting and packing problems
cites work: Simulated annealing: A tool for operational research
cites work: Q4289899
cites work: Q4692508
cites work: Cutting stock problems and solution procedures
cites work: A family of genetic algorithms for the pallet loading problem
cites work: The trim-loss and assortment problems: A survey
cites work: An efficient processor allocation algorithm using two-dimensional packing
cites work: On genetic algorithms for the packing of polygons
cites work: Q3035155
cites work: Guillotineable bin packing: A genetic approach
cites work: Q3835044
full work available at URL: s0377-2217(99)00357-4
OpenAlex ID: W2163144548
description: scientific article; zbMATH DE number 1556522