On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints
From MaRDI portal
Publication:367235
DOI10.1007/s10852-012-9179-3zbMath1311.90123MaRDI QIDQ367235
Publication date: 26 September 2013
Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-012-9179-3
68T05: Learning and adaptive systems in artificial intelligence
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
90B80: Discrete location and assignment
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
A hybrid chaos firefly algorithm for three-dimensional irregular packing problem, A comparative review of 3D container loading algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- A new heuristic algorithm for cuboids packing with no orientation constraints
- Weight distribution considerations in container loading
- Loading plates with non-identical items
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
- An efficient approach for the multi-pallet loading problem
- Heuristics for the container loading problem
- Solving container loading problems by block arrangement
- Three-dimensional packing of items with limited load bearing strength
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- 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
- Approximate algorithms for the container loading problem
- The Three-Dimensional Bin Packing Problem
- An AND/OR-graph approach to the container loading problem
- A hybrid genetic algorithm for the container loading problem
