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

A Hybrid Demon Algorithm for the Two-Dimensional Orthogonal Strip Packing Problem

1Software School, Xiamen University, Xiamen 361005, China
2School of Economics and Business Administration, Chongqing Key Laboratory of Logistics, Chongqing University, Chongqing 400044, China

Received 3 September 2014; Accepted 23 December 2014

Academic Editor: Anders Eriksson

Copyright © 2015 Bili Chen et al. 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. A. Lodi, S. Martello, and M. Monaci, “Two-dimensional packing problems: a survey,” European Journal of Operational Research, vol. 141, no. 2, pp. 241–252, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. 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
  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. S. Martello, M. Monaci, and D. Vigo, “An exact approach to the strip-packing problem,” INFORMS Journal on Computing, vol. 15, no. 3, pp. 310–319, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. M. Kenmochi, T. Imamichi, K. Nonobe, M. Yagiura, and H. Nagamochi, “Exact algorithms for the two-dimensional strip packing problem with and without rotations,” European Journal of Operational Research, vol. 198, no. 1, pp. 73–83, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. B. S. Baker, J. G. Coffman Jr., and R. L. Rivest, “Orthogonal packings in two dimensions,” SIAM Journal on Computing, vol. 9, no. 4, pp. 846–855, 1980. View at Publisher · View at Google Scholar · View at MathSciNet
  7. 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
  8. E. K. Burke, G. Kendall, and G. Whitwell, “A new placement heuristic for the orthogonal stock-cutting problem,” Operations Research, vol. 52, no. 4, pp. 655–672, 2004. View at Publisher · View at Google Scholar · View at Scopus
  9. D. Zhang, Y. Kang, and A. Deng, “A new heuristic recursive algorithm for the strip rectangular packing problem,” Computers and Operations Research, vol. 33, no. 8, pp. 2209–2217, 2006. View at Publisher · View at Google Scholar · View at Scopus
  10. D. Zhang, S. Han, and W. Ye, “A bricklaying heuristic algorithm for the orthogonal rectangular packing problem,” Chinese Journal of Computers, vol. 23, no. 3, pp. 509–515, 2008. View at Google Scholar
  11. L. Wei, D. Zhang, and Q. Chen, “A least wasted first heuristic algorithm for the rectangular packing problem,” Computers and Operations Research, vol. 36, no. 5, pp. 1608–1614, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. S. C. H. Leung and D. Zhang, “A fast layer-based heuristic for non-guillotine strip packing,” Expert Systems with Applications, vol. 38, no. 10, pp. 13032–13042, 2011. View at Publisher · View at Google Scholar · View at Scopus
  13. A. Bortfeldt, “A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces,” European Journal of Operational Research, vol. 172, no. 3, pp. 814–837, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. E. Hopper and B. C. H. Turton, “An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem,” European Journal of Operational Research, vol. 128, no. 1, pp. 34–57, 2001. View at Publisher · View at Google Scholar · View at Scopus
  15. N. Lesh, J. Marks, A. McMahon, and M. Mitzenmacher, “New heuristic and interactive approaches to 2D rectangular strip packing,” Journal of Experimental Algorithmics, vol. 10, article 1.2, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  16. R. Alvarez-Valdes, F. Parreño, and J. M. Tamarit, “Reactive GRASP for the strip-packing problem,” Computers and Operations Research, vol. 35, no. 4, pp. 1065–1083, 2008. View at Publisher · View at Google Scholar · View at Scopus
  17. 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
  18. S. C. H. Leung, D. Zhang, and K. M. Sim, “A two-stage intelligent search algorithm for the two-dimensional strip packing problem,” European Journal of Operational Research, vol. 215, no. 1, pp. 57–69, 2011. View at Publisher · View at Google Scholar · View at Scopus
  19. G. Belov, G. Scheithauer, and E. A. Mukhacheva, “One-dimensional heuristics adapted for two-dimensional rectangular strip packing,” Journal of the Operational Research Society, vol. 59, no. 6, pp. 823–832, 2008. View at Publisher · View at Google Scholar · View at Scopus
  20. E. K. Burke, M. R. Hyde, and G. Kendall, “A squeaky wheel optimisation methodology for two-dimensional strip packing,” Computers & Operations Research, vol. 38, no. 7, pp. 1035–1044, 2011. View at Publisher · View at Google Scholar · View at Scopus
  21. D. Zhang, L. Wei, S. C. H. Leung, and Q. Chen, “A binary search heuristic algorithm based on randomized local search for the rectangular strip-packing problem,” INFORMS Journal on Computing, vol. 25, no. 2, pp. 332–345, 2013. View at Publisher · View at Google Scholar · View at Scopus
  22. F. G. Ortmann and J. H. van Vuuren, “Modified strip packing heuristics for the rectangular variable-sized bin packing problem,” ORiON, vol. 26, no. 1, pp. 21–44, 2010. View at Google Scholar
  23. S. Hong, D. Zhang, H. C. Lau, X. Zeng, and Y.-W. Si, “A hybrid heuristic algorithm for the 2D variable-sized bin packing problem,” European Journal of Operational Research, vol. 238, no. 1, pp. 95–103, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. E. Pinto and J. F. Oliveira, “Algorithm based on graphs for the non-guillotinable two-dimensional packing problem,” in Proceedings of the 2nd ESICUP Meeting, Southampton, UK, April 2005.
  25. J. E. Beasley, “An exact two-dimensional nonguillotine cutting tree search procedure,” Operations Research, vol. 33, no. 1, pp. 49–64, 1985. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. J. E. Beasley, “Algorithms for unconstrained two-dimensional guillotine cutting,” Journal of the Operational Research Society, vol. 36, no. 4, pp. 297–306, 1985. View at Publisher · View at Google Scholar · View at Scopus
  27. N. Christofides and C. Whitlock, “An algorithm for two-dimensional cutting problems,” Operations Research, vol. 25, pp. 30–44, 1977. View at Publisher · View at Google Scholar
  28. B. E. Bengtsson, “Packing rectangular pieces—a heuristic approach,” The Computer Journal, vol. 25, no. 3, pp. 353–357, 1982. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  29. J. O. Berkey and P. Y. Wang, “Two-dimensional finite bin packing algorithms,” Journal of the Operational Research Society, vol. 38, no. 5, pp. 423–429, 1987. View at Publisher · View at Google Scholar · View at Scopus
  30. S. Martello and D. Vigo, “Exact solution of the two-dimensional finite bin packing problem,” Management Science, vol. 44, no. 3, pp. 388–399, 1998. View at Publisher · View at Google Scholar · View at Scopus
  31. C. L. Valenzuela and P. Y. Wang, “Heuristics for large strip packing problems with guillotine patterns: an empirical study,” in Proceedings of the 4th Metaheuristics International Conference, pp. 417–421, University of Porto, Porto, Portugal, 2001.