A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
type: Item
instance of: scholarly article
title: A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
zbMATH Open document ID: 1394.90500
author: Túlio A. M. Toffolo
author: Eline Esprit
author: T. Wauters
author: Greet Vanden Berghe
published in: European Journal of Operational Research
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B90
zbMATH DE Number: 6872947
zbMATH Keywords: three dimensional multiple container loading problem
zbMATH Keywords: decomposition strategies
zbMATH Keywords: bin packing
zbMATH Keywords: ruin-and-recreate heuristic
zbMATH Keywords: ESICUP challenge
describes a project that uses: SCIP
describes a project that uses: Ts2pack
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.07.033
OpenAlex ID: W2481042922
cites work: SCIP: solving constraint integer programs
cites work: A beam search approach to the container loading problem
cites work: Loading plates with non-identical items
cites work: A tabu search algorithm for weakly heterogeneous container loading problems
cites work: A hybrid genetic algorithm for the container loading problem
cites work: Constraints in container loading -- a state-of-the-art review
cites work: A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
cites work: The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
cites work: The multiple container loading cost minimization problem
cites work: Extreme point-based heuristics for three-dimensional bin packing
cites work: TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
cites work: Solving container loading problems by block arrangement
cites work: Guided local search for the three-dimensional bin-packing problem
cites work: A Genetic Algorithm for Solving the Container Loading Problem
cites work: The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
cites work: Two-dimensional packing problems: a survey
cites work: Heuristic algorithms for the three-dimensional bin packing problem
cites work: The Three-Dimensional Bin Packing Problem
cites work: Applying spatial representation techniques to the container packing problem
cites work: A maximal-space algorithm for the container loading problem
cites work: A tree search method for the container loading problem with shipment priority
cites work: An improved typology of cutting and packing problems
cites work: A comparative review of 3D container loading algorithms
DOI: 10.1016/J.EJOR.2016.07.033
description: scientific article; zbMATH DE number 6872947