Heuristics for container loading of furniture
From MaRDI portal
Publication:1044119
DOI10.1016/j.ejor.2009.01.048zbMath1177.90339OpenAlexW1963885200WikidataQ58826392 ScholiaQ58826392MaRDI QIDQ1044119
Stefano Lisi, Claudio Garavelli, David Pisinger, Jens Egeblad
Publication date: 10 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.01.048
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (13)
Logistic constraints in container loading problems: the impact of complete shipment conditions ⋮ Modeling close packing of 3D objects ⋮ A heuristic algorithm for container loading of pallets with infill boxes ⋮ A matheuristic framework for the three-dimensional single large object placement problem with practical constraints ⋮ Extracting maximal objects from three-dimensional solid materials ⋮ A beam search algorithm for the biobjective container loading problem ⋮ Minimizing late deliveries in a truck loading problem ⋮ A large neighbourhood search algorithm for solving container loading problems ⋮ The multiple container loading problem with loading docks ⋮ Оптимизация загрузки упорядоченной совокупности летательных аппаратов ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ A new load balance methodology for container loading problem in road transportation ⋮ Constraints in container loading -- a state-of-the-art review
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- Translational packing of arbitrary polytopes
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- Allowing for weight considerations in container loading
- On the two-dimensional knapsack problem
- Guided local search and its application to the traveling salesman problem
- A comparative evaluation of heuristics for container loading
- Heuristics for the container loading problem
- Solving container loading problems by block arrangement
- A new constraint programming approach for the orthogonal packing problem
- Three-dimensional packing of items with limited load bearing strength
- An improved typology of cutting and packing problems
- Fast neighborhood search for two- and three-dimensional nesting problems
- A Parallel Genetic Algorithm for Solving the Container Loading Problem
- A parallel hybrid local search algorithm for the container loading problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- A Genetic Algorithm for Solving the Container Loading Problem
- Tabu Search—Part I
- Tabu Search—Part II
- Packing of convex polytopes into a parallelepiped
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
This page was built for publication: Heuristics for container loading of furniture
