Abstract
A successful solution to the packing problem is a major step toward material savings on the scrap that could be avoided in the cutting process and therefore money savings. Although the problem is of great interest, no satisfactory algorithm has been found that can be applied to all the possible situations. This paper models a Hybrid Intelligent Packing System (HIPS) by integrating Artificial Neural Networks (ANNs), Artificial Intelligence (AI), and Operations Research (OR) approaches for solving the packing problem. The HIPS consists of two main modules, an intelligent generator module and a tester module. The intelligent generator module has two components: (i) a rough assignment module and (ii) a packing module. The rough assignment module utilizes the expert system and rules concerning cutting restrictions and allocation goals in order to generate many possible patterns. The packing module is an ANN that packs the generated patterns and performs post-solution adjustments. The tester module, which consists of a mathematical programming model, selects the sets of patterns that will result in a minimum amount of scrap.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C.H. Dagli, “Knowledge-based system for cutting stock problem,”European Journal of Operation Research, 44, pp. 160–166, 1990.
Martina Schollmeyer, James Lin, K. Krishnamurty, Ali Bahrami, Gary Leininger, Cihan H. Dagli, and Frank Liou, “Hybrid Expert System and Operations Research for Solving Nesting Problems,” inProceedings of the World Congress on Expert Systems, Volume 2, pp. 1223–1231, Orlando, Florida, (December 16–19, 1991).
Pipatpong Poshyanonda, Ali Bahrami, and Cihan H. Dagli, “Two Dimensional Nesting Problem: Artificial Neural Network and Optimization Approach,”Proceedings of IEEE International Joint Conference on Neural Networks (IJCNN), Volume IV, pp. 572–577, Baltimore, Maryland (June 7–11, 1992).
P. C. Gilmore and R.E. Gomony, “A Linear Programming Approach to Cutting-Stock Problem,”Operations Research, 9, pp. 849–859, 1961.
P.C. Gilmore, and R.E. Gomony, “A Linear Programming Approach to Cutting-Stock Problem,”Operations Research, 11, pp. 863–888, 1963.
P.C. Gilmore and R.E. Gomony, “Multistage cutting problems of two and more dimensions,”Operations Research, 13, pp. 94–120, 1965.
H. Dyckhoff, H.J. Kruse, D. Able, and T. Gal, “Trim loss and related problems,”Omega, 13, pp. 59–72, 1985.
J.E. Beasley, “Algorithms for Uncurtained Two-Dimensional Guillotine Cutting,”J. Opt. Res. Soc., 36, 4, pp. 297–306, 1985.
J.E. Beasley, “An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure,”Operations Research, 33, 1, pp. 49–64, 1985.
B.R. Sarker, “An Optimum Solution for One Dimensional Slitting Problems: A Dynamic Programming Approach,”J. Opt. Res. Soc., 39, 8, pp. 749–755, 1988.
N. Christofides and C. Whitlock, “An Algorithm for Two-dimensional Cutting Problems,”Operation Research, 25, pp. 30–44, 1985.
A.I. Hinxman, “The Trim-loss and Assortment problems: A Survey,”European Journal of Operation Research, 5, 8–18, 1980.
S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi, “Optimization by simulated annealing,”Science, 220(4598), 671–680, 1983.
L. David,Genetic Algorithms and Simulated Annealing, Morgan Kaufmann: Los Angeles, CA, 1987.
M.K. Fleming and G.W. Cottrel, “Categorization of Faces Using Unsupervised Feature Extraction,”Proceedings of International Joint Conference of Neural Networks, Vol. II, 1990, pp. 65–70.
G.W. Cottrell, P. Munro, and D. Zipser, “Image compression by back propagation: An example of extensional programming,” University of California, San Diego, ICS Report 8702, 1987.
L.B. Almeida, “Neural Computers,”Proceedings of NATO ARW on Neural Computers, Springer-Verlag, Dusseldorf, Heidelberg, 1987.
P. Smolensky, “On the Proper Treatment of Connectionism,”Behavioral and Brain Science, Vol. II, pp. 1–74, 1988.
C. Glover and P.F. Spelt, “Hybrid Intelligent Perceptron System: Intelligent Perceptron Through Combining Artificial Neural Networks and Expert System,” SPI, Auburn University, pp. 321–331, 1990.
P. Simpson,Artificial Neural Systems—Foundations, Paradigms, Applications and Implementations, Pergamon; New York, NY, 1990.
F.J. Pineda, “Generalization of back propagation to recurrent and higher order networks,” inNeural Information Processing Systems, edited by Dana Z. Anderson, American Institute of Physics: N.Y., N.Y, pp. 602–11, 1988.
H.P. Winston,Artificial Intelligence, Addison-Wesley: Reading, MA, 1984.
D.E. Rumelhart, G.E. Hinton, and R.J. Williams, “Learning internal representation by error propagation,” InParallel Distributed Processing, edited by D.E. Rumelhart and J.L. McClelland, Vol. I, pp. 318–362, MIT: Cambridge, MA, 1986.
T.J. Sejnowski and C.R. Rosenberg, “Parallel networks that learn to pronounce English text,”Complex Systems, 1:pp. 145–168, 1987.
D.P. Wasserman,Neural Computing, Theory and Practice, Van Nostrand Reinhold: N.Y., N.Y, 1989.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bahrami, A., Dagli, C.H. Hybrid Intelligent Packing System (HIPS) through integration of Artificial Neural Networks, Artificial Intelligence, and mathematical programming. Appl Intell 4, 321–336 (1994). https://doi.org/10.1007/BF00872472
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00872472