A Tree Search Algorithm for Solving the Container Loading Problem
From MaRDI portal
Publication:2899056
DOI10.1287/ijoc.1090.0338zbMath1243.90090MaRDI 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
05C90: Applications of graph theory
90B40: Search theory
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
90B80: Discrete location and assignment
Related Items
The static stability of support factor‐based rectangular packings: an assessment by regression analysis, The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids, The multiple container loading problem with loading docks, Modeling soft unloading constraints in the multi-drop container loading problem, A block-based layer building approach for the 2D guillotine strip packing problem, A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem, The multiple container loading problem with preference, A heuristic algorithm for container loading of pallets with infill boxes, A beam search approach to the container loading problem, A tree search method for the container loading problem with shipment priority, A bidirectional building approach for the 2D constrained guillotine knapsack packing problem, Logistic constraints in container loading problems: the impact of complete shipment conditions, VCS: A new heuristic function for selecting boxes in the single container loading problem, Solving a large multicontainer loading problem in the car manufacturing industry, Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review, A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP, A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints, A global search framework for practical three-dimensional packing with variable carton orientations, A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint, A parallel multi-population biased random-key genetic algorithm for a container loading problem, A reference length approach for the 3D strip packing problem, A new iterative-doubling greedy-lookahead algorithm for the single container loading problem, Space defragmentation for packing problems, A prototype column generation strategy for the multiple container loading problem, Practical constraints in the container loading problem: comprehensive formulations and exact algorithm, A tree search heuristic for the resource constrained project scheduling problem with transfer times, A beam search algorithm for the biobjective container loading problem, Three-stage heuristic algorithm for three-dimensional irregular packing problem, A two-phase approach for single container loading with weakly heterogeneous boxes, Constraints in container loading -- a state-of-the-art review, A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem, Dynamic reduction heuristics for the rectangle packing area minimization problem, A cost-efficient method to optimize package size in emerging markets, A matheuristic framework for the three-dimensional single large object placement problem with practical constraints, A cutting plane method and a parallel algorithm for packing rectangles in a circular container, An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts, A comparative review of 3D container loading algorithms, A two-stage packing problem procedure
