A Tree Search Algorithm for Solving the Container Loading Problem

From MaRDI portal
Publication:2899056

DOI10.1287/ijoc.1090.0338zbMath1243.90090OpenAlexW2135855087MaRDI QIDQ2899056

Tobias Fanslau, Andreas Bortfeldt

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/325c55a47bf8543edb78fa93ddd1208cd5825911




Related Items (38)

Logistic constraints in container loading problems: the impact of complete shipment conditionsA block-based layer building approach for the 2D guillotine strip packing problemA goal-driven prototype column generation strategy for the multiple container loading cost minimization problemDynamic reduction heuristics for the rectangle packing area minimization problemA cost-efficient method to optimize package size in emerging marketsThe multiple container loading problem with preferenceA heuristic algorithm for container loading of pallets with infill boxesA beam search approach to the container loading problemVCS: A new heuristic function for selecting boxes in the single container loading problemSolving a large multicontainer loading problem in the car manufacturing industryA matheuristic framework for the three-dimensional single large object placement problem with practical constraintsA reference length approach for the 3D strip packing problemA new iterative-doubling greedy-lookahead algorithm for the single container loading problemSpace defragmentation for packing problemsA prototype column generation strategy for the multiple container loading problemA beam search algorithm for the biobjective container loading problemA cutting plane method and a parallel algorithm for packing rectangles in a circular containerAn MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cutsThe static stability of support factor‐based rectangular packings: an assessment by regression analysisThe container loading problem with cargo stability: a study on support factors, mechanical equilibrium and gridsThe multiple container loading problem with loading docksModeling soft unloading constraints in the multi-drop container loading problemA tree search method for the container loading problem with shipment priorityA two-stage packing problem procedureA hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problemConsideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature reviewA two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRPA hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraintsA global search framework for practical three-dimensional packing with variable carton orientationsA tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraintA parallel multi-population biased random-key genetic algorithm for a container loading problemPractical constraints in the container loading problem: comprehensive formulations and exact algorithmA bidirectional building approach for the 2D constrained guillotine knapsack packing problemThree-stage heuristic algorithm for three-dimensional irregular packing problemA comparative review of 3D container loading algorithmsA two-phase approach for single container loading with weakly heterogeneous boxesA tree search heuristic for the resource constrained project scheduling problem with transfer timesConstraints in container loading -- a state-of-the-art review







This page was built for publication: A Tree Search Algorithm for Solving the Container Loading Problem