Heuristics for the container loading problem

European Journal of Operational Research

Volumn 141, Issue 2, 2002, Pages 382-392

  Pisinger, David ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Container loading; Cutting packing; Heuristics; Knapsack packing

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; OPTIMIZATION; PROBLEM SOLVING;

BRANCH AND BOUND APPROACH; CONTAINER LOADING PROBLEM;

HEURISTIC METHODS;

EID: 0036722393     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00132-7     Document Type: Article

References (21)

1. Loading pallets with non-identical items
2. A comparative evaluation of heuristics for container loading
3. Loading multiple pallets
4. Applying tabu search to container loading problems
5. An analytical model for the container loading problem
6. Weight distribution considerations in container loading
7. A typology of cutting and packing problems
8. Cutting and packing
9. Guided local search for the three-dimensional bin packing problem
10. A genetic algorithm for solving the container loading problem
11. A computer-based heuristic for packing pooled shipment containers
12. A heuristic for packing boxes into a container
13. Multistage cutting stock problems of two and more dimensions
14. Enumerative approaches to combinatorial optimization - Part 2
15. The three-dimensional bin packing problem
16. An AND/OR graph approach to the container loading problem
17. A minimal algorithm for the 0-1 Knapsack problem
18. A tree-search heuristic for the container loading problem
19. A three-dimensional bin packing algorithm
20. Algorithms for the container loading problem