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

Computers and Operations Research

Volumn 36, Issue 4, 2009, Pages 1026-1049

  Egeblad, Jens ^a   Pisinger, David ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Cutting and packing; Heuristics; Sequence pair; Sequence tripple; Simulated annealing; Three dimensional knapsack problem; Two dimensional knapsack problems

Indexed keywords

ANNEALING; COMPUTER AIDED DESIGN; COMPUTER CIRCUITS; HEURISTIC METHODS; INTEGER PROGRAMMING; INTEGRATED CIRCUIT LAYOUT; INTEGRATED CIRCUITS; PACKING; THREE DIMENSIONAL; TWO DIMENSIONAL;

CUTTING AND PACKING; HEURISTICS; SEQUENCE PAIR; SEQUENCE-TRIPPLE; THREE-DIMENSIONAL KNAPSACK PROBLEM; TWO-DIMENSIONAL KNAPSACK PROBLEMS;

SIMULATED ANNEALING;

EID: 54449095900     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2007.12.004     Document Type: Article

References (36)

1. Fekete SP, Schepers J. A new exact algorithm for general orthogonal d-dimensional knapsack problems. In: Algorithms ESA '97, Springer lecture notes in computer science, vol. 1284, 1997. p. 144-56.
2. Pisinger D., and Sigurd M. The two-dimensional bin packing problem with variable bin sizes and costs. Discrete Optimization 2 (2005) 154-167
3. Pisinger D., and Sigurd M. Using decomposition techniques and constraint programming for solving the two-dimensional bin packing problem. INFORMS Journal on Computing 19 (2007) 36-51
4. Wascher G, Haussner H, Schumann H. An improved typology of cutting and packing problems. European Journal of Operational Research, 2007. Available online.
5. Beasley J.E. Algorithms for two-dimensional unconstrained guillotine cutting. Journal of the Operational Research Society 36 (1985) 297-306
6. Hadjiconstantinou E., and Christofides N. An exact algorithm for general, orthogonal, two-dimensional knapsack problems. European Journal of Operational Research 83 (1995) 39-56
7. Boschetti M.A., Hadjiconstantinou E., and Mingozzi A. New upper bounds for the two-dimensional orthogonal cutting stock problem. IMA Journal of Management Mathematics 13 (2002) 95-119
8. Fekete SP, Schepers J. On more-dimensional packing III: exact algorithms. Discrete Applied Mathematics, 1997, submitted for publication.
9. Fekete S.P., Schepers J., and van der Veen J.C. An exact algorithm for higher-dimensional orthogonal packing. Operations Research 3 55 (2007) 569-587
10. Baldacci R, Boschetti MA. A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem. European Journal of Operational Research 2006. Available online.
11. Caprara A., and Monaci M. On the 2-dimensional knapsack problem. Operations Research Letters 1 32 (2004) 5-14
12. Martello S., Monaci M., and Vigo D. An exact approach to the strip packing problem. INFORMS Journal on Computing 3 15 (2003) 310-319
13. Lai K.K., and Chan J.W.M. Developing a simulated annealing algorithm for the cutting stock problem. Computers and Industrial Engineering 32 (1997) 115-127
14. Lai K.K., and Chan J.W.M. A evolutionary algorithm for the rectangular cutting stock problem. International Journal on Industrial Engineering 4 (1997) 130-139
15. Leung T.W., Yung C.H., and Troutt M.D. Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem. Computers and Industrial Engineering 40 (2001) 201-204
16. Leung T.W., Yung C.H., and Troutt M.D. Application of mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem. European Journal of Operational Research 145 (2003) 530-542
17. Jakobs S. On genetic algorithms for the packing of polygons. European Journal of Operational Research 88 (1996) 165-181
18. Beasley J.E. A population heuristic for constrained two-dimensional non-guillotine cutting. European Journal of Operational Research 156 (2004) 601-607
19. Alvarez-Valdes R., Parreño F., and Tamarit J.M. A grasp algorithm for constrained two-dimensional non-guillotine cutting problems. Journal of Operational Research Society 56 (2005) 414-425
20. Alvarez-Valdes R, Parreño F, Tamarit JM. A tabu search algorithm for two-dimensional non-guillotine cutting problems. Technical Report TR07-2004, Universitat de Valencia; 2004.
21. Murata H., Fujiyoshi K., Nakatake S., and Kajitani Y. VLSI module packing based on rectangle-packing by the sequence pair. IEEE Transaction on Computer Aided Design of Integrated Circuits and Systems 15 (1996) 1518-1524
22. Tang X., Tian R., and Wong D.F. Fast evaluation of sequence pair in block placement by longest common subsequence computation. Proceedings of DATE 2000 (ACM) (2000), Paris, France 106-110
23. Tang X, Wong DF. Fast-sp: a fast algorithm for block packing based on sequence pair. In: Asia and South Pacific design automation conference, 2001.
24. Pisinger D. Denser packings obtained in O (n log log n) time. INFORMS Journal on Computing 19 (2007) 395-405
25. Kellerer H., Pferschy U., and Pisinger D. Knapsack problems (2004), Springer, Berlin, Germany
26. Dembo R.S., and Hammer P.L. A reduction algorithm for knapsack problems. Methods of Operations Research 36 (1980) 49-60
27. Martello S., Pisinger D., Vigo D., den Boef E., and Korst J. Algorithm 864: general and robot-packable variants of the three-dimensional bin packing problem. ACM Transactions on Mathematical Software 33 (2007) 1-7
28. Fekete S.P., and Schepers J. A general framework for bounds for higher-dimensional orthogonal packing problems. Mathematical Methods of Operations Research 60 (2004) 311-329
29. Beasley J.E. An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research 33 (1985) 49-64
30. Christofides N., and Whitlock C. An algorithm for two dimensional cutting stock problems. Operations Research 25 (1977) 30-44
31. Wang P.Y. Two algorithms for constrained two dimensional cutting stock problems. Operations Research 31 (1983) 573-586
32. Hifi M. Two-dimesional (un)constrained cutting stock problems, 〈http://www.laria.u-picardie.fr/hifi/OR-Benchmark/2Dcutting〉; 2006.
33. Pisinger D. A minimal algorithm for the 0-1 knapsack problem. Operations Research 45 (1997) 758-767
34. Moura A., and Oliveira J.F. A grasp approach to the container-loading problem. IEEE Intelligent Systems 20 4 (2005) 50-57
35. Mack D., Bortfeldt A., and Gehring H. A parallel hybrid local search algorithm for the container loading problem. International Transaction in Operations Research 11 (2004) 511-533
36. Pisinger D. Heuristics for the container loading problem. European Journal of Operations Research 3 141 (2002) 382-392