A simulated annealing heuristic for the one-dimensional cutting stock problem

European Journal of Operational Research

Volumn 93, Issue 3, 1996, Pages 522-535

  Chen, Chuen Lung S ^a   Hart, Stephen M ^a   Tham, Wai Mui ^a  

^a MISSISSIPPI STATE UNIVERSITY   (United States)

Author keywords

Cutting stock problem; Integer linear programming; Optimization; Simulated annealing

Indexed keywords

ALGORITHMS; INTEGER PROGRAMMING; INVENTORY CONTROL; LINEAR PROGRAMMING; OPTIMIZATION; PERFORMANCE; STATISTICAL METHODS;

CUTTING STOCK PROBLEM; INTEGER LINEAR PROGRAMMING;

SIMULATED ANNEALING;

EID: 0030247586     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(95)00102-6     Document Type: Article

References (18)

1. Daniels, J.J., and Ghandforoush, P., "An improved algorithm for the non-guillotine-constrained cutting-stock problem", Journal of the Operational Research Society (UK) 41/2 (1990) 141-149.
2. Dyckhoff, H., "A new linear programming approach to the cutting stock problem", Operations Research 9 (1961) 849-859.
3. Eglese, R.W., "Simulated annealing: A tool for operational research", European Journal of Operational Research 46 (1990) 271-281.
4. Gemmill, D.D., and Sanders, J.L., "Approximate solutions for the cutting stock 'portfolio' problem", European Journal of Operational Research 44/2 (1990) 167-174.
5. Gilmore, P.C., and Gomory, R.E., "A linear programming approach to the cutting stock problem", Operations Research 9 (1961) 849-859.
6. Gilmore, P.C., and Gomory, R.E., "A linear programming approach to the cutting stock problem", Operations Research 11 (1963) 863-888.
7. Goulimis, C., "Optimal solutions for the cutting stock problem", European Journal of Operations Research 44 (1990) 197-208.
8. Haessler, R.W., and Sweeney, P.E., "Cutting stock problems and solution procedures", European Journal of Operational Research 54/2 (1991) 141-150.
9. Hajeck, B., "Cooling schedules for optimal annealing", Mathematics of Operations Research 13 (1988) 311-329.
10. Hart, S.M., and Chen, C., "Simulated annealing and the mapping problem: A computational study", Computers and Operations Research 21 4 (1994) 445-461.
11. Isken, M.W., and Hancock, W.M., "A heuristic approach to nurse scheduling in hospital units with non-stationary, urgent demand, and a fixed staff size", Journal of the Society for Health Systems 2/2 (1990) 24-41.
12. Johnson, D.S., Aragon, C.R., McGeogh, L.A., and Schevon, C., "Optimization by simulated annealing: An experimental evaluation; Part I graph partitioning", Operations Research 37/6 (1989) 865-892.
13. Kirkpatrick, S., Gelatt, Jr., C.D., and Vecchi, M.P., "Optimization by simulated annealing", Science 220 (1983) 671-680.
14. Lundy, M., and Mees, A., "Convergence of an annealing algorithm", Mathematical Programming 34 (1986) 111-124.
15. Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., and Teller, E., "Equations of state calculations by fast computing machines", Journal of Chemical Physics 21 (1953) 1087-1092.
16. Stadtler, H., "A one-dimensional cutting stock problem in the aluminum industry and its solution", European Journal of Operational Research 44/2 (1990) 209-223.
17. Van Laarhoven, P.J.M., and Aarts, E.H.L, Simulated Annealing: Theory and Applications, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1987.
18. Wascher, G., "An LP-based approach to cutting stock problem with multiple objectives", European Journal of Operational Research 44 (1990) 175-184.