Heuristic approaches for the two- and three-dimensional knapsack packing problem

@article{Egeblad2009HeuristicAF,
  title={Heuristic approaches for the two- and three-dimensional knapsack packing problem},
  author={Jens Egeblad and David Pisinger},
  journal={Computers & OR},
  year={2009},
  volume={36},
  pages={1026-1049}
}
The maximum profit two- or three-dimensional knapsack packing problem packs a maximum profit subset of some given rectangles or boxes into a larger rectangle or box of fixed dimensions. Items must be orthogonally packed, but no other restriction is imposed to the problem. We present a new iterative heuristic for the two-dimensional knapsack problem based on the sequence pair representation proposed by Murata et al. [VLSI module packing based on rectangle-packing by the sequence pair. IEEE… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 58 CITATIONS

Evolving reusable 3d packing heuristics with genetic programming

VIEW 19 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Performance trade-offs in using subset-combination personification-heuristics algorithm for three-dimensional Knapsack Packing Problem

  • 2016 IEEE Information Technology, Networking, Electronic and Automation Control Conference
  • 2016
VIEW 5 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

The three-dimensional knapsack problem with balancing constraints

  • Applied Mathematics and Computation
  • 2011
VIEW 19 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Analysis of cargo stability in container transportation

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A new hybrid evolutionary algorithm for three - dimensional packing problems

  • 2010 IEEE International Conference on Systems, Man and Cybernetics
  • 2010
VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2009
2019

CITATION STATISTICS

  • 9 Highly Influenced Citations

References

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

Algorithms for two-dimensional unconstrained guillotine cutting

JE Beasley
  • Journal of the Operational Research Society
  • 1985
VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

Denser Packings Obtained in O(n log log n) Time

  • INFORMS Journal on Computing
  • 2007
VIEW 8 EXCERPTS

A population heuristic for constrained two-dimensional non-guillotine cutting

  • European Journal of Operational Research
  • 2004
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

On the two-dimensional Knapsack Problem

  • Oper. Res. Lett.
  • 2004
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL