Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2016, Article ID 8703782, 12 pages
http://dx.doi.org/10.1155/2016/8703782
Research Article

An Efficient Heuristic Approach for Irregular Cutting Stock Problem in Ship Building Industry

Department of Automation, Shanghai JiaoTong University and Key Laboratory of System Control and Information Processing, Ministry of Education of China, Shanghai 200240, China

Received 20 June 2016; Revised 25 August 2016; Accepted 29 August 2016

Academic Editor: Mohammed Nouari

Copyright © 2016 Yan-xin Xu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. A. Bennell and J. F. Oliveira, “A tutorial in irregular shape packing problems,” Journal of the Operational Research Society, vol. 60, no. 1, pp. S93–S105, 2009. View at Publisher · View at Google Scholar · View at Scopus
  2. A. M. Gomes and J. F. Oliveira, “A 2-exchange heuristic for nesting problems,” European Journal of Operational Research, vol. 141, no. 2, pp. 359–370, 2002. View at Publisher · View at Google Scholar · View at Scopus
  3. G. Wäscher, H. Haußner, and H. Schumann, “An improved typology of cutting and packing problems,” European Journal of Operational Research, vol. 183, no. 3, pp. 1109–1130, 2007. View at Publisher · View at Google Scholar · View at Scopus
  4. H. Dyckhoff, “A typology of cutting and packing problems,” European Journal of Operational Research, vol. 44, no. 2, pp. 145–159, 1990. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, New York, NY, USA, 1979.
  6. E. Hopper and B. C. H. Turton, “A review of the application of meta-heuristic algorithms to 2D strip packing problems,” Artificial Intelligence Review, vol. 16, no. 4, pp. 257–300, 2001. View at Publisher · View at Google Scholar · View at Scopus
  7. E. K. Burke, R. S. R. Hellier, G. Kendall, and G. Whitwell, “A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem,” Operations Research, vol. 54, no. 3, pp. 587–601, 2006. View at Publisher · View at Google Scholar · View at Scopus
  8. B. A. Júnior, P. R. Pinheiro, R. D. Saraiva, and P. G. C. D. Pinheiro, “Dealing with nonregular shapes packing,” Mathematical Problems in Engineering, vol. 2014, Article ID 548957, 10 pages, 2014. View at Publisher · View at Google Scholar · View at Scopus
  9. W. Han, J. A. Bennell, X. Zhao, and X. Song, “Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints,” European Journal of Operational Research, vol. 230, no. 3, pp. 495–504, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. E. López-Camacho, G. Ochoa, H. Terashima-Marín, and E. K. Burke, “An effective heuristic for the two-dimensional irregular bin packing problem,” Annals of Operations Research, vol. 206, pp. 241–264, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. E. Abdelhafiez, “Efficient items-ordering rules in cutting stock problem,” in Proceedings of the 9th International Conference on Mechanical Design and Production Engineering MDP9, Cairo, Egypt, January 2008.
  12. J. A. Bennell and J. F. Oliveira, “A tutorial in irregular shape packing problems,” Journal of the Operational Research Society, vol. 60, no. 1, pp. S93–S105, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  13. J. A. Bennell and X. Song, “A beam search implementation for the irregular shape packing problem,” Journal of Heuristics, vol. 16, no. 2, pp. 167–188, 2010. View at Publisher · View at Google Scholar · View at Scopus
  14. R. Alvarez-Valdes, F. Parreño, and J. M. Tamarit, “A tabu search algorithm for a two-dimensional non-guillotine cutting problem,” European Journal of Operational Research, vol. 183, no. 3, pp. 1167–1182, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  15. D. S. Liu, K. C. Tan, S. Y. Huang, C. K. Goh, and W. K. Ho, “On solving multiobjective bin packing problems using evolutionary particle swarm optimization,” European Journal of Operational Research, vol. 190, no. 2, pp. 357–382, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. E. K. Burke, G. Kendall, and G. Whitwell, “A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem,” INFORMS Journal on Computing, vol. 21, no. 3, pp. 505–516, 2009. View at Publisher · View at Google Scholar · View at Scopus
  17. P. R. Pinheiro, B. Amaro Júnior, and R. D. Saraiva, “A random-key genetic algorithm for solving the nesting problem,” International Journal of Computer Integrated Manufacturing, vol. 29, no. 11, pp. 1159–1165, 2016. View at Publisher · View at Google Scholar · View at Scopus
  18. A. K. Sato, T. D. C. Martins, and M. D. S. G. Tsuzuki, “A pairwise exact placement algorithm for the irregular nesting problem,” International Journal of Computer Integrated Manufacturing, vol. 29, no. 11, pp. 1177–1189, 2016. View at Publisher · View at Google Scholar · View at Scopus
  19. P. Poshyanonda, A. Bahrami, and C. Dagli, “Two dimensional nesting problem: artificial neural network and optimization approach,” in Proceedings of the International Joint Conference of Neural Networks, pp. IV-572–IV-577, Baltimore, Md, USA, June 1992.
  20. J. A. Bennell and J. F. Oliveira, “The geometry of nesting problems: a tutorial,” European Journal of Operational Research, vol. 184, no. 2, pp. 397–415, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. J. Bennell, G. Scheithauer, Y. Stoyan, and T. Romanova, “Tools of mathematical modeling of arbitrary object packing problems,” Annals of Operations Research, vol. 179, no. 1, pp. 343–368, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  22. N. Chernov, Y. Stoyan, and T. Romanova, “Mathematical model and efficient algorithms for object packing problem,” Computational Geometry, vol. 43, no. 5, pp. 535–553, 2010. View at Publisher · View at Google Scholar
  23. S. Jakobs, “On genetic algorithms for the packing of polygons,” European Journal of Operational Research, vol. 88, no. 1, pp. 165–181, 1996. View at Publisher · View at Google Scholar · View at Scopus
  24. P. Poshyanonda and C. H. Dagli, “Genetic neuro-nester,” Journal of Intelligent Manufacturing, vol. 15, no. 2, pp. 201–218, 2004. View at Publisher · View at Google Scholar · View at Scopus
  25. W. K. Wong, X. X. Wang, P. Y. Mok, S. Y. S. Leung, and C. K. Kwong, “Solving the two-dimensional irregular objects allocation problems by using a two-stage packing approach,” Expert Systems with Applications, vol. 36, no. 2, pp. 3489–3496, 2009. View at Publisher · View at Google Scholar · View at Scopus
  26. E. K. Burke, R. S. R. Hellier, G. Kendall, and G. Whitwell, “Complete and robust no-fit polygon generation for the irregular stock cutting problem,” European Journal of Operational Research, vol. 179, no. 1, pp. 27–49, 2007. View at Publisher · View at Google Scholar · View at Scopus
  27. E. K. Burke, R. S. R. Hellier, G. Kendall, and G. Whitwell, “Irregular packing using the line and arc no-fit polygon,” Operations Research, vol. 58, no. 4, pp. 948–970, 2010. View at Publisher · View at Google Scholar · View at Scopus
  28. J. A. Bennell and X. Song, “A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums,” Computers & Operations Research, vol. 35, no. 1, pp. 267–281, 2008. View at Publisher · View at Google Scholar · View at Scopus
  29. L. Kos and J. Duhovnik, “Rod cutting optimization with store utilization,” in Proceedings of the International Design Conference, pp. 313–318, Dubrovnik, Croatia, 2000.
  30. C. H. Dagli and A. Hajakbari, “Simulated annealing approach for solving stock cutting problem,” in Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, pp. 221–223, Los Angeles, Calif, USA, November 1990. View at Scopus
  31. D. Liu and H. Teng, “An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles,” European Journal of Operational Research, vol. 112, no. 2, pp. 413–420, 1999. View at Publisher · View at Google Scholar · View at Scopus
  32. B. Chazelle, “Bottom-left bin-packing heuristic: an efficient implementation,” IEEE Transactions on Computers, vol. C32, no. 8, pp. 697–707, 1983. View at Publisher · View at Google Scholar · View at Scopus