Solving container loading problems by block arrangement
From MaRDI portal
Publication:1847191
DOI10.1016/S0377-2217(02)00133-9zbMATH Open1081.90610OpenAlexW2075957730MaRDI QIDQ1847191FDOQ1847191
Authors: M. Eley 
Publication date: 17 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00133-9
Recommendations
- Heuristics with a new block strategy for the single and multiple containers loading problems
- Solving the single-container loading problem by a fast heuristic method
- A maximal-space algorithm for the container loading problem
- A tree search method for the container loading problem with shipment priority
- An Efficient Algorithm for Solving the Container Loading Problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- Weight distribution considerations in container loading
- An efficient approach for the multi-pallet loading problem
- A heuristic for multiple container loading problems
- Loading plates with non-identical items
- A tabu search algorithm for weakly heterogeneous container loading problems
- A Genetic Algorithm for Solving the Container Loading Problem
- An AND/OR-graph approach to the container loading problem
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs
- Loading Multiple Pallets
- A computer-based heuristic for packing pooled shipment containers
- Applying spatial representation techniques to the container packing problem
- Title not available (Why is that?)
Cited In (59)
- A two-phase constructive algorithm for the single container mix-loading problem
- A matheuristic framework for the three-dimensional single large object placement problem with practical constraints
- The static stability of support factor‐based rectangular packings: an assessment by regression analysis
- A beam search algorithm for the biobjective container loading problem
- The exact solutions of several types of container loading problems
- A fast heuristic for a three-dimensional non-convex domain loading problem
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
- A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
- Container loading with multi-drop constraints
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- Solving a large multicontainer loading problem in the car manufacturing industry
- A large neighbourhood search algorithm for solving container loading problems
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
- A new load balance methodology for container loading problem in road transportation
- Heuristics with a new block strategy for the single and multiple containers loading problems
- A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
- Analysing trade-offs in container loading: combining load plan construction heuristics with agent-based simulation
- Weight distribution in container loading: a case study
- Optimization models for the three-dimensional container loading problem with practical constraints
- A global optimization approach for solving three-dimensional open dimension rectangular packing problems
- The multiple container loading cost minimization problem
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
- AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
- A two-phase approach for single container loading with weakly heterogeneous boxes
- Three-stage heuristic algorithm for three-dimensional irregular packing 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
- The pallet loading problem: three-dimensional bin packing with practical constraints
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
- An efficient placement heuristic for three-dimensional rectangular packing
- A tree search method for the container loading problem with shipment priority
- A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach
- Translational packing of arbitrary polytopes
- Heuristics for container loading of furniture
- Container packing problem with balance constraints
- A novel hybrid tabu search approach to container loading
- Placement of two- and three-dimensional irregular shapes for inertia moment and balance
- Global optimization for the three-dimensional open-dimension rectangular packing problem
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- A prototype column generation strategy for the multiple container loading problem
- A new quasi-human algorithm for solving the packing problem of unit equilateral triangles
- A nonlinear optimization model for the balanced vehicle routing problem with loading constraints
- A comparative review of 3D container loading algorithms
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- Neighborhood structures for the container loading problem: a VNS implementation
- Constraints in container loading -- a state-of-the-art review
- Layer-layout-based heuristics for loading homogeneous items into a single container
- Three-dimensional container loading models with cargo stability and load bearing constraints
- On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints
- A decomposition heuristics for the container ship stowage problem
- A caving degree approach for the single container loading problem
- A maximal-space algorithm for the container loading problem
- MIP-based approaches for the container loading problem with multi-drop constraints
- A parallel hybrid local search algorithm for the container loading problem
- A new heuristic algorithm for cuboids packing with no orientation constraints
- Three-dimensional packing of items with limited load bearing strength
This page was built for publication: Solving container loading problems by block arrangement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1847191)
