Heuristic algorithms for the three-dimensional bin packing problem
From MaRDI portal
Publication:1847192
DOI10.1016/S0377-2217(02)00134-0zbMath1081.90612MaRDI QIDQ1847192
Andrea Lodi, Daniele Vigo, Silvano Martello
Publication date: 17 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
Vehicle scheduling under the warehouse-on-wheels policy, A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem, A heuristic for solving large bin packing problems in two and three dimensions, TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem, The disruptive anti-covering location problem, The multiple container loading problem with preference, An improved typology of cutting and packing problems, An effective tabu search approach with improved loading algorithms for the 3L-CVRP, The load-balanced multi-dimensional bin-packing problem, Predicting packaging sizes using machine learning, A data-driven approach for mixed-case palletization with support, Packing ovals in optimized regular polygons, Reinforcement learning for combinatorial optimization: a survey, Space defragmentation for packing problems, A prototype column generation strategy for the multiple container loading problem, A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing, A MIP-based slicing heuristic for three-dimensional bin packing, Airfreight forwarder's shipment planning: shipment consolidation and containerization, A Multi-start Tabu Search Based Algorithm for Solving the Warehousing Problem with Conflict, The multiple container loading problem with loading docks, On solving multiobjective bin packing problems using evolutionary particle swarm optimization, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, The multiple container loading cost minimization problem, A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem, Efficient algorithms for orthogonal packing problems, A global search framework for practical three-dimensional packing with variable carton orientations, Recent advances on two-dimensional bin packing problems, The forgotten sons: warehousing systems for brick-and-mortar retail chains, Three-stage heuristic algorithm for three-dimensional irregular packing problem, BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem, A comparative review of 3D container loading algorithms, Translational packing of arbitrary polytopes, New lower bounds for the three-dimensional finite bin packing problem, Three-dimensional bin packing problem with variable bin height, Two-dimensional packing problems: a survey, Constraints in container loading -- a state-of-the-art review
Cites Work
