Neighborhood structures for the container loading problem: a VNS implementation

DOI10.1007/s10732-008-9081-3zbMath1184.90174OpenAlexW2028112889MaRDI QIDQ2267814

Francisco Parreño, José Fernando Oliveira, José Manuel Tamarit, Ramón Alvarez-Valdés

Publication date: 2 March 2010

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-008-9081-3

zbMATH Keywords

3D packing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (36)

Logistic constraints in container loading problems: the impact of complete shipment conditions ⋮ A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem ⋮ Portfolio decision analysis with a generalized balance approach ⋮ 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 ⋮ VCS: A new heuristic function for selecting boxes in the single container loading problem ⋮ Algorithms for the maximum \(k\)-club problem in graphs ⋮ A reference length approach for the 3D strip 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 hybrid GRASP/VND algorithm for two- and three-dimensional bin packing ⋮ A beam search algorithm for the biobjective container loading problem ⋮ An efficient method for the three-dimensional container loading problem by forming box sizes ⋮ A MIP-based slicing heuristic for three-dimensional bin packing ⋮ Multiple traveling salesperson problem with drones: general variable neighborhood search approach ⋮ The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids ⋮ A large neighbourhood search algorithm for solving container loading problems ⋮ Modeling soft unloading constraints in the multi-drop container loading problem ⋮ A two-stage packing problem procedure ⋮ A variable neighborhood search algorithm for the leather nesting problem ⋮ A new quasi-human algorithm for solving the packing problem of unit equilateral triangles ⋮ Container packing problem with balance constraints ⋮ A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints ⋮ Three-dimensional container loading models with cargo stability and load bearing constraints ⋮ A parallel multi-population biased random-key genetic algorithm for a container loading problem ⋮ A fast heuristic for a three-dimensional non-convex domain loading problem ⋮ A quasi-human algorithm for solving the three-dimensional rectangular packing problem ⋮ Variable neighbourhood search: methods and applications ⋮ An efficient placement heuristic for three-dimensional rectangular packing ⋮ Determining the best shipper sizes for sending products to customers ⋮ A comparative review of 3D container loading algorithms ⋮ A two-phase approach for single container loading with weakly heterogeneous boxes ⋮ Variable neighbourhood search: Methods and applications ⋮ Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints ⋮ Constraints in container loading -- a state-of-the-art review

Cites Work

• Unnamed Item
• Experimental investigation of heuristics for resource-constrained project scheduling: an update
• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
• Loading plates with non-identical items
• A tabu search algorithm for weakly heterogeneous container loading problems
• Variable neighborhood search
• A comparative evaluation of heuristics for container loading
• Heuristics for the container loading problem
• Solving container loading problems by block arrangement
• The parallel variable neighborhood search for the \(p\)-median problem
• Three-dimensional packing of items with limited load bearing strength
• Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
• An improved typology of cutting and packing problems
• A Maximal-Space Algorithm for the Container Loading Problem
• A Parallel Genetic Algorithm for Solving the Container Loading Problem
• A parallel hybrid local search algorithm for the container loading problem
• A Genetic Algorithm for Solving the Container Loading Problem
• A hybrid genetic algorithm for the container loading problem

This page was built for publication: Neighborhood structures for the container loading problem: a VNS implementation