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

A Variable Neighborhood Search Algorithm for the Leather Nesting Problem

Centro de Investigação Algoritmi da Universidade do Minho, Escola de Engenharia, Universidade do Minho, 4710-057 Braga, Portugal

Received 20 May 2011; Accepted 6 October 2011

Academic Editor: J. J. Judice

Copyright © 2012 Cláudio Alves 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. C. Alves, P. Brás, J. Valério de Carvalho, and T. Pinto, “New constructive algorithms for leather nesting in the automotive industry,” Computers and Operations Research, vol. 39, no. 7, pp. 1487–1505, 2012. View at Publisher · View at Google Scholar
  2. 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
  3. J. Heistermann and T. Lengauer, “The nesting problem in the leather manufacturing industry,” Annals of Operations Research, vol. 57, no. 1, pp. 147–173, 1995. View at Publisher · View at Google Scholar · View at Scopus
  4. A. Crispin, P. Clay, G. Taylor, T. Bayes, and D. Reedman, “Genetic algorithm coding methods for leather nesting,” Applied Intelligence, vol. 23, no. 1, pp. 9–20, 2005. View at Publisher · View at Google Scholar · View at Scopus
  5. Z. Yuping, J. Shouwei, and Z. Chunli, “A very fast simulated re-annealing algorithm for the leather nesting problem,” International Journal of Advanced Manufacturing Technology, vol. 25, no. 11-12, pp. 1113–1118, 2005. View at Publisher · View at Google Scholar · View at Scopus
  6. W. C. Lee, H. Ma, and B. W. Cheng, “A heuristic for nesting problems of irregular shapes,” Computer Aided Design, vol. 40, no. 5, pp. 625–633, 2008. View at Publisher · View at Google Scholar · View at Scopus
  7. Z. Yuping and Y. Caijun, “A generic approach for leather nesting,” in Proceedings of the 5th International Conference on Natural Computation, vol. 5, pp. 303–317, August 2009. View at Publisher · View at Google Scholar · View at Scopus
  8. N. Mladenović and P. Hansen, “Variable neighborhood search,” Computers and Operations Research, vol. 24, no. 11, pp. 1097–1100, 1997. View at Google Scholar · View at Scopus
  9. J. Beltran, J. Calderon, R. Cabrera, J. Perez, and J. Moreno-Vega, “GRASP/VNS hybrid for the strip packing problem,” in Proceedings of the 1st International Workshop on Hybrid Metaheuristics, pp. 79–90, 2004.
  10. F. Parreño, R. Alvarez-Valdes, J. F. Oliveira, and J. M. Tamarit, “Neighborhood structures for the container loading problem: a VNS implementation,” Journal of Heuristics, vol. 16, no. 1, pp. 1–22, 2010. View at Publisher · View at Google Scholar
  11. F. Alvelos, T. M. Chan, P. Vilaça, T. Gomes, E. Silva, and J. M. Valério De Carvalho, “Sequence based heuristics for two-dimensional bin packing problems,” Engineering Optimization, vol. 41, no. 8, pp. 773–791, 2009. View at Publisher · View at Google Scholar · View at Scopus
  12. E. Hopper and B. C. H. Turton, “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
  13. F. Parreño, R. Alvarez-Valdes, J. M. Tamarit, and J. F. Oliveira, “A maximal-space algorithm for the container loading problem,” INFORMS Journal on Computing, vol. 20, no. 3, pp. 413–422, 2008. View at Publisher · View at Google Scholar · View at Scopus
  14. P. K. Ghosh, “An algebra of polygons through the notion of negative shapes,” CVGIP: Image Understanding, vol. 54, no. 1, pp. 119–144, 1991. View at Google Scholar · View at Scopus
  15. J. A. Bennell, K. A. Dowsland, and W. B. Dowsland, “The irregular cutting-stock problem—a new procedure for deriving the no-fit polygon,” Computers and Operations Research, vol. 28, no. 3, pp. 271–287, 2000. View at Publisher · View at Google Scholar · View at Scopus
  16. P. Hansen, N. Mladenović, and J. Pérez, “Variable neighbourhood search: methods and applications,” Annals of Operations Research, vol. 175, no. 1, pp. 367–407, 2010. View at Publisher · View at Google Scholar · View at Scopus