A hybrid simulated-annealing algorithm for two-dimensional strip packing problem

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

Volumn 4431 LNCS, Issue PART 1, 2007, Pages 508-516

  Dereli, Türkay ^a   Daş, Gülesin Sena ^a  

^a GAZIANTEP UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; PROBLEM SOLVING; SIMULATED ANNEALING;

BENCHMARK PROBLEMS; SIMULATED-ANNEALING (SA) ALGORITHM;

ALGORITHMS;

EID: 38049053466     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71618-1_56     Document Type: Conference Paper

References (14)

1. Dyckhoff, H, Finke, U: Cutting and packing in production and distribution. PhysicaVerlag, (1992).
2. Hopper, E, Turton, B,C,H: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research, 128, 34-57, (2001).
3. Lodi, A, Martello, S, Monaci, M: Two-dimensional packing problems: a survey. European Journal of Operational Research, 141, 241-252, (2002).
4. Dyckhoff, H: A typology of cutting and packing problems. European Journal of Operational Research, 44, 145-159, (1990).
5. Downsland, K,A, Downsland, W,B: Packing Problems. European Journal of Operational Research, 56, 2-14, (1992).
6. Lodi, A, Martello, S, Vigo, D: Recent advances on two-dimensional bin packing problems. Discrete Applied Mathematics, 123, 379-396, (2002).
7. Zhang, D, Kang, Y, Deng, A: A new heuristic recursive algorithm for the strip rectangular packing problem. Computers & Operations Research, 33, 2209-2217, (2006).
8. Smith, D: Bin-packing with adaptive search. In: Grefensstette J. (ed.), Proceedings of an International Conference on Genetic Algorithms and the Applications. Lawrence Erlbaum: London; 1985, 202-206.
9. Downsland, K,A: Some experiments with simulated annealing techniques for packing problems. European Journal of Operational Research, 68, 389-399, (1993).
10. Jakobs, S: On genetic algorithms for the packing of polygons. European Journal of Operational Research, 88, 165-181, (1996).
11. Lai, K,K, Chan, J,W,M: Developing a simulated annealing algorithm for the cutting stock problem. Computers & Industrial Engineering, 32, 115-127, 1997.
12. Leung, T,W, Yung, C,H, Troutt, M,D: Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem. Computers & Industrial Engineering, 40, 201-214, (2001).
13. Rosen, K,H: Discrete mathematics and its applications. 5th ed.. McGraw Hill, (2003).
14. Kirkpatrick, S, Gelatt, C,D, Vecchi, M,P: Optimization by simulated annealing. Science, 220, 671-680, (1983).