Developing a simulated annealing algorithm for the cutting stock problem
- 31 January 1997
- journal article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 32 (1), 115-127
- https://doi.org/10.1016/s0360-8352(96)00205-7
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problemAnnals of Operations Research, 1993
- Airline seat inventory control: an application of the simulated annealing methodTransportation Planning and Technology, 1993
- Two-dimensional Cutting Stock with Multiple Stock SizesJournal of the Operational Research Society, 1991
- The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problemComputers & Operations Research, 1990
- Approximate solutions for the cutting stock ‘portfolio’ problemEuropean Journal of Operational Research, 1990
- A two-phase roll cutting problemEuropean Journal of Operational Research, 1990
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problemAnnals of Operations Research, 1989
- Simulated annealing for permutation flow-shop schedulingOmega, 1989
- Application of Heuristic Techniques to the Cutting-Stock Problem for WorktopsJournal of the Operational Research Society, 1984
- Optimization by Simulated AnnealingScience, 1983