Solution for the constrained guillotine cutting problem by simulated annealing

Computers and Operations Research

Volumn 25, Issue 1, 1998, Pages 37-47

  Parada, Victor ^a,c   Sepúlveda, Mauricio ^a,c   Solar, Mauricio ^a,c   Gómes, Arlindo ^b,d  

^a UNIVERSIDAD DE SANTIAGO DE CHILE   (Chile)

^b Univ Federal de Espírito   (Brazil)

^c University of Santiago de Compostcla   (Spain)

^d FEDERAL UNIVERSITY OF ESPÍRITO SANTO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CONSTRAINT THEORY; NUMERICAL ANALYSIS; PROBLEM SOLVING; RANDOM NUMBER GENERATION; SIMULATED ANNEALING; TREES (MATHEMATICS);

CONSTRAINED GUILLOTINE CUTTING;

CUTTING;

EID: 0031619229     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(98)80006-3     Document Type: Article

References (15)

1. Hinxman, A. I., The trim loss and assortment problems: a survey. EJOR, 1980, 5, 8-18.
2. Dyckhoff, H., A typology of cutting and packing problems. EJOR, 1990, 44, 145-159.
3. Christofides, N. and Whitlock, C., An algorithm for two-dimensional cutting problems. Operations Research, 1977, 25, 30-44.
4. Gilmore, P. C. and Gomory, R. E., The theory and computation of knapsack functions. Operations Research, 1966, 1045-1074.
5. Wang, P., Two algorithms for constrained two-dimensional cutting stock problems. Operations Research, 1983, 31, 573-586.
6. Vasko, F. J., A computational improvement to Wang's two-dimensional cutting stock algorithm. Computers and Industrial Engineering, 1989, 16, 109-115.
7. Oliveira, J. F. and Ferreira, J. S., An improved version of Wang's algorithm for two-dimensional cutting problems. EJOR, 1990, 44, 256-266.
8. Hinxman, A. I., Problem reduction and the two-dimensional trim-loss Problem. Artificial Intelligence and Simulation. Summer Conference, University of Edinburgh, 1976, pp. 158-165.
9. Morabito, R. N., Arenales, M. N. and Arcaro, V. F., An And-Or-Graph approach for two dimensional cutting problems. EJOR, 1992, 58, 263-271.
10. Pearl, J., Heuristics: intelligent search strategies for computer problem solving. Addison-Wesley, Reading M. A., 1984.
11. Parada, V., Gómes, A. and De Diego, J., Exact solutions for constrained two-dimensional cutting stock problems. EJOR, 1995, 84, 633-644.
12. Viswanathan, K. V. and Bagchi, A., Best-first search methods for constrained two-dimensional cutting stock problems. Operations Research, 1993, 41, 768-776.
13. Kirkpatrick, S., Gelatt, C. D.Jr. and Vecchi, M. P., Optimization by simulated annealing. Science, 1983, 220, 671-680.
14. Eglese, R. W., Simulated annealing: a tool for operational research. EJOR, 1990, 46, 271-281.
15. Koulamas, C., Antony, S. and Jaen, J., A survey of simulated annealing: applications to operations research problems. Omega, 1994, 22, 1 45-56.