Abstract
This paper presents a new variant of the A* class algorithms for solving the known ‘one-dimensional cutting stock problem’ in a cardboard factory where the objective is to minimise the useless remaining of a continuous cardboard surface. The algorithm limits the number of nodes in the tree search by using a bound criterion based on the problem restrictions. The process of computing the solution is achieved at several stages, obtaining a complete non-optimal solution at each stage and improving the response as long as new stages are executed. The final stage returns the optimal solution. The proposed approach allows for a solution at anytime in the process resolution and also the refinement of the solution as more time is given to the algorithm. In this way, if a non-optimal solution is satisfactory enough for the factory, the process can be interrupted at that time. The computational performance of the algorithm indicates the effectiveness of the algorithm for solving practical one-dimensional cutting stock problems. Additionally, the experimental results show the important money savings achieved for the factory.
Preview
Unable to display preview. Download preview PDF.
References
Beasley J.E. “Algorithms for unconstrained two-dimensional guillotine cutting”. Journal of the Operational Research Society, 36, pp. 297–306 (1985).
Christofides N., Hadjiconstantinou E. “An exact algorithm for orthogonal 2-D cutting stock problems using guillotine cuts”. European Journal of Operational Research, Vol. 83, pp. 21–38 (1995).
Daniels J.J., Ghandforoush P. “An improved algorithm for the non-guillotine constrained cutting-stock problem”. Journal of the Operational Research Society, 41, pp. 141–149 (1990)
Gilmore P.C., Gomory R.E. “Multistage Cutting Stock Problem of Two and More Dimensions”. Operations Research, Vol. 3, pp. 94–120, (1965).
Hadjiconstantinou E., Christofides N. “An exact algorithm for general orthogonal, two dimensional knapsack problems”. European Journals of Operational Research, Vol. 83, pp. 39–56 (1995).
Korf R.E. “Real-Time Heuristic Search” Artificial Intelligence Vol. 42, pp. 189–211 (1990).
Ishida T. “Real-Time Search for learning autonomous agents”.Ed. Kluwer Academic Publishers. (1997).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Onaindia, E., Barber, F., Botti, V., Carrascosa, C., Hernandez, M.A., Rebollo, M. (1998). A progressive heuristic search algorithm for the cutting stock problem. In: Pasqual del Pobil, A., Mira, J., Ali, M. (eds) Tasks and Methods in Applied Artificial Intelligence. IEA/AIE 1998. Lecture Notes in Computer Science, vol 1416. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64574-8_388
Download citation
DOI: https://doi.org/10.1007/3-540-64574-8_388
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64574-0
Online ISBN: 978-3-540-69350-5
eBook Packages: Springer Book Archive