A global search framework for practical three-dimensional packing with variable carton orientations
type: Item
instance of: scholarly article
title: A global search framework for practical three-dimensional packing with variable carton orientations
zbMATH Open document ID: 1251.90018
author: Yaohua He
author: Yong Wu
author: Robert De Souza
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
full work available at URL: http://hdl.handle.net/10072/44199
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 6106599
zbMATH Keywords: packing
zbMATH Keywords: loading
zbMATH Keywords: three-dimensional
zbMATH Keywords: genetic algorithm
zbMATH Keywords: global search
zbMATH Keywords: evolutionary gradient
describes a project that uses: Ts2pack
describes a project that uses: Algorithm 864
MaRDI profile type: Publication
OpenAlex ID: W2014060518
cites work: An improved typology of cutting and packing problems
cites work: An analytical model for the container loading problem
cites work: 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: An Exact Algorithm for Higher-Dimensional Orthogonal Packing
cites work: An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
cites work: The Ordered Open-End Bin-Packing Problem
cites work: 3-D container packing heuristics
cites work: A comparative evaluation of heuristics for container loading
cites work: Loading plates with non-identical items
cites work: Heuristics for the container loading problem
cites work: The distributor's three-dimensional pallet-packing problem: a human intelligence-based heuristic approach
cites work: Guided local search for the three-dimensional bin-packing problem
cites work: A new heuristic algorithm for cuboids packing with no orientation constraints
cites work: Loading Multiple Pallets
cites work: A hybrid genetic algorithm for the container loading problem
cites work: Q3611009
cites work: A Genetic Algorithm for Solving the Container Loading Problem
cites work: A Parallel Genetic Algorithm for Solving the Container Loading Problem
cites work: Heuristic algorithms for the three-dimensional bin packing problem
cites work: TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
cites work: Heuristic approaches for the two- and three-dimensional knapsack packing problem
cites work: A parallel multi-population biased random-key genetic algorithm for a container loading problem
cites work: A tree search algorithm for solving the container loading problem
cites work: A heuristic for the three-dimensional strip packing problem
cites work: A hybrid placement strategy for the three-dimensional strip packing problem
cites work: Three-dimensional bin packing problem with variable bin height
cites work: Extreme point-based heuristics for three-dimensional bin packing
cites work: Genetic Algorithms and Random Keys for Sequencing and Optimization
cites work: Q4692508
cites work: Genetic algorithm crossover operators for ordering applications
cites work: A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
cites work: Measuring instance difficulty for combinatorial optimization problems
DOI: 10.1016/J.COR.2011.12.007
description: scientific article; zbMATH DE number 6106599