A tree search method for the container loading problem with shipment priority
type: Item
instance of: scholarly article
title: A tree search method for the container loading problem with shipment priority
zbMATH Open document ID: 1219.90024
author: Jidong Ren
author: Yajie Tian
author: Tetsuo Sawaragi
published in: European Journal of Operational Research
publication date: 2011-08-19T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5940377
zbMATH Keywords: packing
zbMATH Keywords: container loading problem
zbMATH Keywords: heuristic
zbMATH Keywords: tree search
zbMATH Keywords: shipment priority
MaRDI profile type: Publication
full work available at URL: j.ejor.2011.04.025
OpenAlex ID: W2023995268
cites work: Three-dimensional packing of items with limited load bearing strength
cites work: Loading Multiple Pallets
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: Container loading with multi-drop constraints
cites work: Weight distribution considerations in container loading
cites work: Solving container loading problems by block arrangement
cites work: A tree search algorithm for solving the container loading problem
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: AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
cites work: A parallel hybrid local search algorithm for the container loading problem
cites work: A maximal-space algorithm for the container loading problem
cites work: Heuristics for the container loading problem
cites work: A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach
DOI: 10.1016/J.EJOR.2011.04.025
description: scientific article; zbMATH DE number 5940377