A MIP-based slicing heuristic for three-dimensional bin packing
type: Item
instance of: scholarly article
title: A MIP-based slicing heuristic for three-dimensional bin packing
zbMATH Open document ID: 1386.90124
author: Samir Elhedhli
author: Fatma Gzara
author: Yi Feng Yan
published in: Optimization Letters
publication date: 2017-12-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6819052
zbMATH Keywords: mixed-case palletization
zbMATH Keywords: three-dimensional bin packing
zbMATH Keywords: layered slicing approach
zbMATH Keywords: heuristic
describes a project that uses: Ts2pack
describes a project that uses: Algorithm 864
MaRDI profile type: Publication
full work available at URL: s11590-017-1154-5
OpenAlex ID: W2621226977
cites work: A space-indexed formulation of packing boxes into a larger box
cites work: Multi-dimensional bin packing problems with guillotine constraints
cites work: Three-dimensional packing of items with limited load bearing strength
cites work: Constraints in container loading -- a state-of-the-art review
cites work: An analytical model for the container loading 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: Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
cites work: A global optimization algorithm for the three-dimensional packing problem
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: Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem
cites work: MIP-based approaches for the container loading problem with multi-drop constraints
cites work: Heuristic algorithms for the three-dimensional bin packing problem
cites work: The Three-Dimensional Bin Packing Problem
cites work: Optimal facility layout design
cites work: Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
cites work: A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
cites work: A maximal-space algorithm for the container loading problem
cites work: Neighborhood structures for the container loading problem: a VNS implementation
cites work: An effective tabu search approach with improved loading algorithms for the 3L-CVRP
cites work: An improved typology of cutting and packing problems
cites work: Three-dimensional bin packing problem with variable bin height
cites work: A comparative review of 3D container loading algorithms
cites work: A prototype column generation strategy for the multiple container loading problem
DOI: 10.1007/S11590-017-1154-5
description: scientific article; zbMATH DE number 6819052