Heuristics for container loading of furniture
type: Item
instance of: scholarly article
title: Heuristics for container loading of furniture
zbMATH Open document ID: 1177.90339
author: Jens Egeblad
author: Claudio Garavelli
author: Stefano Lisi
author: David Pisinger
published in: European Journal of Operational Research
publication date: 2009-12-10T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5645164
zbMATH Keywords: packing
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: logistics
zbMATH Keywords: transportation
zbMATH Keywords: heuristics
Wikidata QID: Q58826392
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.01.048
OpenAlex ID: W1963885200
cites work: A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
cites work: A comparative evaluation of heuristics for container loading
cites work: Three-dimensional packing of items with limited load bearing strength
cites work: On the two-dimensional knapsack problem
cites work: A new constraint programming approach for the orthogonal packing problem
cites work: Q4947407
cites work: Translational packing of arbitrary polytopes
cites work: Fast neighborhood search for two- and three-dimensional nesting problems
cites work: Heuristic approaches for the two- and three-dimensional knapsack packing problem
cites work: Solving container loading problems by block arrangement
cites work: An Exact Algorithm for Higher-Dimensional Orthogonal Packing
cites work: A Parallel Genetic Algorithm for Solving the Container Loading Problem
cites work: A Genetic Algorithm for Solving the Container Loading Problem
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
cites work: An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
cites work: Q4821303
cites work: Optimization by Simulated Annealing
cites work: A parallel hybrid local search algorithm for the container loading problem
cites work: Heuristics for the container loading problem
cites work: Allowing for weight considerations in container loading
cites work: Q4355891
cites work: Packing of convex polytopes into a parallelepiped
cites work: Guided local search and its application to the traveling salesman problem
cites work: An improved typology of cutting and packing problems
DBLP publication ID: journals/eor/EgebladGLP10
DOI: 10.1016/J.EJOR.2009.01.048
Recommended article: Heuristics for the container loading problem
Recommended article: A comparative evaluation of heuristics for container loading
Recommended article: A heuristic for multiple container loading problems
Recommended article: Layer-layout-based heuristics for loading homogeneous items into a single container
Recommended article: A heuristic algorithm for container loading of pallets with infill boxes
Recommended article: Q3494397
Recommended article: Solving the single-container loading problem by a fast heuristic method
Recommended article: A heuristic approach to the three-dimensional cargo-loading problem
Recommended article: A computer-based heuristic for packing pooled shipment containers
description: scientific article; zbMATH DE number 5645164