An analytical model for the container loading problem
From MaRDI portal
Publication:1129950
DOI10.1016/0377-2217(94)00002-TzbMath0927.90087OpenAlexW1991903096MaRDI QIDQ1129950
Publication date: 16 August 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)00002-t
container loadingcartons of non-uniform sizethree-dimensional palletizationzero-one mixed integer programming
Related Items
Solving the 3-D yard allocation problem for break bulk cargo via variable neighborhood search branching, A global optimization approach for solving three-dimensional open dimension rectangular packing problems, Global optimization for the three-dimensional open-dimension rectangular packing problem, An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry, An improved typology of cutting and packing problems, A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems, A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem, A 3D-BPP approach for optimising stowage plans and terminal productivity, Models and algorithms for packing rectangles into the smallest square, Exact and approximate methods for parallel multiple-area spatial scheduling with release times, A data-driven approach for mixed-case palletization with support, A matheuristic framework for the three-dimensional single large object placement problem with practical constraints, An exact method for the 2D guillotine strip packing problem, A new heuristic algorithm for rectangle packing, Reinforcement learning for combinatorial optimization: a survey, A novel hybrid tabu search approach to container loading, A cutting plane method and a parallel algorithm for packing rectangles in a circular container, A MIP-based slicing heuristic for three-dimensional bin packing, Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer, Airfreight forwarder's shipment planning: shipment consolidation and containerization, A model‐based heuristic to the vehicle routing and loading problem, A large neighbourhood search algorithm for solving container loading problems, A global optimization point of view to handle non-standard object packing problems, Оптимизация загрузки упорядоченной совокупности летательных аппаратов, Modeling soft unloading constraints in the multi-drop container loading problem, An optimization model for storage yard management in transshipment hubs, A mathematical modeling approach to optimize composite parts placement in autoclave, A space-indexed formulation of packing boxes into a larger box, The three-dimensional knapsack problem with balancing constraints, A review of deterministic optimization methods in engineering and management, Solving packing problems by a distributed global optimization algorithm, A Modeling-Based Approach for Non-standard Packing Problems, Exploiting Packing Components in General-Purpose Integer Programming Solvers, A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates, A new load balance methodology for container loading problem in road transportation, A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints, Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems, A global search framework for practical three-dimensional packing with variable carton orientations, Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts, Three-dimensional container loading models with cargo stability and load bearing constraints, A fast heuristic for a three-dimensional non-convex domain loading problem, Lower bounds for three-dimensional multiple-bin-size bin packing problems, A particular approach for the three-dimensional packing problem with additional constraints, Multi-dimensional bin packing problems with guillotine constraints, A greedy search for the three-dimensional bin packing problem: the packing static stability case, The pallet loading problem: three-dimensional bin packing with practical constraints, Practical constraints in the container loading problem: comprehensive formulations and exact algorithm, Exact solution techniques for two-dimensional cutting and packing, Three-stage heuristic algorithm for three-dimensional irregular packing problem, Consecutive ones matrices for multi-dimensional orthogonal packing problems, A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application, Weight distribution in container loading: a case study, A comparative review of 3D container loading algorithms, The exact solutions of several types of container loading problems, Methodology for selecting packaging alternatives: an ``action research application in the industrial sector, Deterministic model for customized pilot manufacture production with various backplane sizes, MIP-based heuristic for non-standard 3D-packing problems, Optimal aircraft load balancing, Applying genetic algorithms and neural networks to the container loading problem, Three-dimensional bin packing problem with variable bin height, Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem, The two-dimensional bin packing problem with variable bin sizes and costs, A global optimization algorithm for the three-dimensional packing problem, Heuristics for the container loading problem, Two-dimensional packing problems: a survey, An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container, Packing Problems in Space Solved by CPLEX: An Experimental Analysis, Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints, Transshipment of containers at a container terminal: An overview, Constraints in container loading -- a state-of-the-art review
Cites Work
- Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
- An exact algorithm for the pallet loading problem
- A typology of cutting and packing problems
- Efficient automated pallet loading
- A comparative evaluation of heuristics for container loading
- A computer-based heuristic for packing pooled shipment containers
- Load planning for shipments of low density products
- The pallet packing problem for non-uniform box sizes
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- A Combined Data-Base and Algorithmic Approach to the Pallet-Loading Problem
- A heuristic approach to the three-dimensional cargo-loading problem
- Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem
- An Algorithm for Two-Dimensional Cutting Problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- The Theory and Computation of Knapsack Functions
- Recursive Computational Procedure for Two-dimensional Stock Cutting
