An application of simulated annealing to the cutting stock problem

European Journal of Operational Research

Volumn 114, Issue 3, 1999, Pages 542-556

  Faina, Loris ^a  

^a UNIVERSITY OF PERUGIA   (Italy)

Author keywords

Global optimization; Guillotine and non guillotine cutting; Simulated annealing

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DECISION THEORY; PROBLEM SOLVING; SIMULATED ANNEALING; THEOREM PROVING;

CUTTING STOCK PROBLEMS; GUILLOTINE/NON-GUILLOTINE CONSTRAINTS;

STRATEGIC PLANNING;

EID: 0033132557     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00207-0     Document Type: Article

References (26)

1. E.H.L. Aarts, P.J.M. Van Laarhoven, Simulated Annealing Theory and Applications, Series: Mathematics and Its Applications, Reidel, Dordrecht, 1988.
2. Aarts E.H.L., Van Laarhoven P.J.M. Statistical cooling: A general approach to combinatorial optimization problems. Philips Journal of Resourse. 40:1985;193-226.
3. E.H.L. Aarts, F.M.J. de Bont, J.H.A. Habers, P.J.M. Van Laarhoven, A parallel statistical cooling algorithm, in: Proc. STACS 86, Springer Lecture Notes in Computer Science 210, 1986, pp. 87-97.
4. Abdullah W. Seeking global minima. Journal of Computational Physics. 110:1994;320-326.
5. Beasley J.E. An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research. 33(1):1985;49-64.
6. Brooks R.L., Smith C.A.B., Stone A.H., Tutte W.T. The dissection of rectangles into squares. Duke Mathematics Journal. 7:1940;312-340.
7. Butler R.A., Slaminka E.E. An evaluation of the Sniffer global optimization algorithm using standard test funtions. Journal of Computational Physics. 99:1992;28-32.
8. Černy V. Thermodynamical approach to the travelling salesman problem: An efficient algorithm. Journal of Optimization Theory and Applications. 45:1985;41-51.
9. Coffman E.G., Lagarius J.C. Algorithms for packing squares: A probabilistic analysis. SIAM Journal of Computing. 18:1989;166-185.
10. N. Christofides, E. Hadjiconstantinou, An exact solution for two-dimensional non-guillottine cutting problems, Technical Report, Imperial College of Science, Technology and Medicine, 1991.
11. Dyckhoff H. A typology of cutting and packing problems. European Journal of Operational Research. 44(2):1990;145-159.
12. Farley A.A. Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations. European Journal of Operational Research. 44(2):1990;239-246.
13. Farley A.A. Practical adaptations of the Gilmore-Gomory approach to cutting stock problems. OR Spektrum. 10:1988;113-123.
14. W. Feller, An Introduction to Probability Theory and Its Applications, Wiley, New York, 1950.
15. Ferreira J., Oliveira J. A faster variant of the Gilmore and Gomory technique for cutting stock problems (Special Issue on Production Management - Part I). Belgium Journal of Operations Research and Computer Science. 34(1):1994;23-38.
16. M.R. Garey, D.S. Johnson, Computer and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
17. M.R. Garey, D.S. Johnson, Approximation algorithms for bin packing problems: A survey, in: D. Ausiello, M. Lucertini (Eds.), Analysis and Design of Algorithms in Combinatorial Optimization, CIRM Courses and Lectures 266, Wien, 1981, pp. 147-172.
18. Hartley R., Szu H. Fast simulated annealing. Physics Letters A. 122:1987;157-162.
19. L.V. Kantorovich, Mathematical methods of organizing and planning production (original work published in Russian, 1939), English Translation appeared in: Management Science 6 (1960) 342-366.
20. Kirkpatrick S., Gelatt C.D., Vecchi M.P. Optimization by Simulated Annealing. Science. 220:1983;671-680.
21. Lundy M., Mees A. Convergence of an annealing algorithm. Mathematical Programming. 34:1986;111-124.
22. Metropolis N., Rosenbluth A., Rosenbluth M., Teller A., Teller E. Equation of state calculations by fast computing machines. Journal of Chemical Physics. 21:1953;1087-1092.
23. R.H.J.M. Otten, L.P.P.P. van Ginneken, Floorplan design using simulated annealing, in: Proc. IEEE Int. Conference on Computer-Aided Design, Santa Clara, 1984, pp. 96-98.
24. R.H.J.M. Otten, L.P.P.P. van Ginneken, The Annealing Algorithm, Kluwer Academic Publishers, Boston, MA, 1989.
25. F. Romeo, A.L. Sangiovanni-Vincentelli, Probabilistic hill climbing algorithms. Properties and applications, in: Proc. 1985 Chapel Hill Conference on VLSI, May 1985, pp. 393-417.
26. Rossier Y., Troyon M., Liebling Th.M. Probabilistic exchange algorithms and Euclidean traveling salesman problems. OR Spektrum. 8:1986;151-164.