A New PSO-based Algorithm for Two-Dimensional Non-Guillotine Non-Oriented Cutting Stock Problem

References

• Alvarez-Valdes, R., F. Parreño, and J. M. Tamarit. 2007. A tabu search algorithm for a two-dimensional non-guillotine cutting problem. European Journal of Operational Research 183 (3):1167–82. doi:10.1016/j.ejor.2005.11.068.
   Web of Science ®Google Scholar
• Ayadi, O., and M. Barkallah. 2016. An adapted particle swarm optimization approach for a 2D guillotine cutting stock problem. Mechanics and Industry (Mechanics and Industry) 17 (5):508. doi:10.1051/meca/2015096.
   Web of Science ®Google Scholar
• Ayadi, O., N. Cheikhrouhou, and F. Masmoudi. 2012. A new formulation of the two-dimensional cutting-stock problem with consideration of demand planning. International Journal Advanced Operations Management 4 (1–2):27–61. doi:10.1504/IJAOM.2012.045890.
   Google Scholar
• Ayadi, O., N. Cheikhrouhou, A. Mellouli, and F. Masmoudi. 2009. A hybrid heuristic to solve the two dimensional cutting stock problem with consideration of forecasts. IEEE International Conference on Computers & Industrial Engineering (CIE), 6–9 July, Troyes France, 221–26.
   Google Scholar
• Barkallah, M., O. Ayadi, and E. F. Masmoudi. 2014. Partical swarm optimization for the 2D guillotine cutting problem. 1st International Conference on Multiphysics modeling and simulation for Systems Design, Sousse, Tunisia, December 17–19.
   Google Scholar
• Beasley, J. E. 1985. An exact Two-Dimensional Non-Guillotine cutting tree search procedure. Operations Research 33 (1):49–64. doi:10.1287/opre.33.1.49.
   Web of Science ®Google Scholar
• Beasley, J. E. 2004. A population heuristic for constrained two-dimensional non guillotine cutting. European Journal of Operational Research 156 (3):601–27. doi:10.1016/S0377-2217(03)00139-5.
   Web of Science ®Google Scholar
• Belov, G. 2003.Problems, models and algorithms in one-and two-dimensional cutting. PhD thesis, Fakultät Mathematik und Naturwissenschaften, Technischen Universität Dresden, St. Petersburg, Russland.
   Google Scholar
• Ben Lagha, G., N. Dahmani, and S. Krichen. 2014. Particle swarm optimization approach for resolving the cutting stock problem. IEEE International Conference on Advanced Logistics and Transport, Hammamet, Tunisia, Mai 1–3, 259–63.
   Google Scholar
• Bengtsson, B. E. 1982. Packing rectangular Pieces—A heuristic approach. The Computer Journal 25 (3):353–57. doi:10.1093/comjnl/25.3.353.
   Web of Science ®Google Scholar
• Boschetti, M. A., E. Hadjinconstantinou, and E. A. Mingozzi. 2002. New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem. IMA Journal of Management Mathematics 13 (2):95–119. doi:10.1093/imaman/13.2.95.
   Google Scholar
• Chu, C., and E. J. Antonio. 1999. Approximate algorithms to solve real-life multicriteria cutting stock problems. Operations Research 47 (4):495–508. doi:10.1287/opre.47.4.495.
   Web of Science ®Google Scholar
• Dyckhoff, H. 1990. A typology of cutting and packing problems. European Journal of Operational Research 44 (2):145–59. doi:10.1016/0377-2217(90)90350-K.
   Web of Science ®Google Scholar
• Dyckhoff, H., G. Scheithauer, and J. Terno. 1997. Cutting and Packing (C&P). In Annotated bibliographies in combinatorial optimization, ed. M. Dell’Amico, F. Maffioli, and S. Martello. Chichester, UK: John Wiley & Sons.
   Google Scholar
• El-Bouri, A., N. Popplewell, S. Balakrishnan, and A. Alfa. 1994. A search based heuristic for the two-dimensional bin-packing problem. Information Systems and Operational Research 32 (4):265–74. doi:10.1080/03155986.1994.11732256.
   Web of Science ®Google Scholar
• El Hayek, J., A. Moukrim, and S. Nègre. 2008. New resolution algorithm and pretreatments for the two-dimensional bin-packing problem. Computers and OR 35 (10):3184–201. doi:10.1016/j.cor.2007.02.013.
   Web of Science ®Google Scholar
• Gilmore, P. C., and R. E. Gomory. 1965. Multistage cutting stock problems of two and more dimensions. Operations Research 13 (1):94–120. doi:10.1287/opre.13.1.94.
   Web of Science ®Google Scholar
• Hassler, R. W., and P. E. Sweeney. 1991. Cutting stock problems and solution procedures. European Journal of Operational Research 54 (2):141–50. doi:10.1016/0377-2217(91)90293-5.
   Web of Science ®Google Scholar
• Kennedy, J., and R. Eberhart. 1995.Particle swarm optimization. IEEE International Conference on Neural Networks, Perth, WA, November/December, 1942–48.
   Google Scholar
• Lai, K. K., and J. W. M. Chan. 1997. Developing a simulated annealing algorithm for the cutting stock problem. Computers and Industrial Engineering 32 (1):115–27. doi:10.1016/S0360-8352(96)00205-7.
   Web of Science ®Google Scholar
• Lodi, A., S. Martello, M. Monaci, and D. Vigo. 2010. Two-dimensional bin packing problems. In Paradigms of combinatorial optimization: Problems and new approaches, ed. V. Th. Paschos, vol. 2, chapter 5, Hoboken, NJ, USA:John Wiley & Sons. doi: 10.1002/9781118600207.ch5.
   Google Scholar
• Morabito, R., and M. N. Arenales. 1996. Staged and constrained two-dimensional guillotine cutting problems: An AND/OR-graph approach. European Journal of Operational Research 94 (3):548–60. doi:10.1016/0377-2217(95)00128-X.
   Web of Science ®Google Scholar
• Valério de Carvalho, J. M. 2002. LP models for bin packing and cutting stock problems. European Journal of Operational Research 141 (2):253–73. doi:10.1016/S0377-2217(02)00124-8.
   Web of Science ®Google Scholar
• Young-Gun, G., and M. K. Kang. 2002. A new upper bound for unconstrained two-dimensional cutting and packing. Journal of the Operational Research Society 53 (5):587–91. doi:10.1057/palgrave.jors.2601326.
   Web of Science ®Google Scholar