An AND/OR-graph approach to the container loading problem

@inproceedings{Morabito1994AnAA,
  title={An AND/OR-graph approach to the container loading problem},
  author={Reinaldo Morabito and Marcos Arenalest},
  year={1994}
}
The container loading problem consists of packing boxes of various sizes into available containers in such a way as to optimize an objective function. In this paper we deal with the special case where there is just one available container and the objective is to maximize the total volume (or the total utility value, supposing that each box has a utility value) of the loaded boxes. We firstly present three heuristic solution methods for the unconstrained problem. Two of them solve the original… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 56 CITATIONS, ESTIMATED 90% COVERAGE

Approximate algorithms for the container loading problem

VIEW 7 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Heuristics for the container loading problem

  • European Journal of Operational Research
  • 2002
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

A caving degree approach for the single container loading problem

  • European Journal of Operational Research
  • 2009
VIEW 4 EXCERPTS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1996
2019

CITATION STATISTICS

  • 6 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

Packing problems

W. Dowsland
  • European Journal of Operational Research,
  • 1992

Staged and constrained

M. Arenales
  • 1992
VIEW 2 EXCERPTS

Staged and constrained two - dimensional guillotine cutting problems : a new approach

R. Morabito, M. Arenales
  • Notas
  • 1992
VIEW 2 EXCERPTS

A comparative evaluation of heuristic for container loading

M. Marriott
  • European Journal
  • 1990

A computer based heuristic for packing pooled shipment containers

M. Meyer
  • 1990