An evolutionary algorithm for column generation in integer programming: An effective approach for 2D bin packing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3242, Issue , 2004, Pages 642-651

  Puchinger, Jakob ^a   Raidi, Günther R ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINS; EVOLUTIONARY ALGORITHMS; PROBLEM SOLVING;

BIN PACKING PROBLEM; BRANCH-AND-PRICE ALGORITHMS; COMPUTATIONAL EFFORT; COMPUTATIONAL EXPERIMENT; EFFECTIVE APPROACHES; GREEDY HEURISTICS; INTEGER LINEAR PROGRAMMING FORMULATION; REAL-WORLD PROBLEM;

INTEGER PROGRAMMING;

EID: 35048874288     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30217-9_65     Document Type: Article

References (11)

1. G. Belov and G. Scheithauer. A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. Technical Report MATH-NM-03-2003, Dresden University of Technology, Germany, 2003.
2. J.O. Berkey and P.Y. Wang. Two-dimensional finite bin packing algorithms. Journal of the Operational Research Society, 38:423-429, 1987.
3. P.C. Gilmore and R.E. Gomory. Multistage cutting-stock problems of two and more dimensions. Operations Research, 13:90-120, 1965.
4. A. Lodi, S. Martello, and D. Vigo. Models and bounds for two-dimensional level packing problems. Journal of Combinatorial Optimization, To appear.
5. A. Lodi, S. Martello, and D. Vigo. Recent advances on two-dimensional bin packing problems. Discrete Applied Mathematics, 123:373-390, 2002.
6. R. Lougee-Heimer. The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community. IBM Journal of Research and Development, 47(1):57-66, 2003.
7. S. Martello and D. Vigo. Exact solutions of the two-dimensional finite bin packing problem. Management Science, 44:388-399, 1998.
8. D. Pisinger and M. Sigurd. Using decomposition techniques and constraint programming for solving the two-dimensional bin packing problem. Technical Report 03/01, University of Copenhagen, Denmark, 2003.
9. J. Puchinger, G.R. Raidl, and G. Koller. Solving a real-world glass cutting problem. In J. Gottlieb and G. R. Raidl, editors, Evolutionary Computation in Combinatorial Optimization - EvoCOP 2004, volume 3004 of LNCS, pages 162-173. Springer, 2004.
10. F. Vanderbeck. A nested decomposition approach to a 3-stage 2-dimensional cutting stock problem. Management Science, 47(2):864-879, 1998.
11. L.A. Wolsey. Integer Programming. Wiley-Interscience, 1998.