Journal of information and communication convergence engineering

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

A Distributed Stock Cutting using Mean Field Annealing and Genetic Algorithm

  • Hong, Chul-Eui (Department of Computer Science, Sangmyung University)
  • Received : 2009.12.28
  • Accepted : 2010.01.16
  • Published : 2010.02.28
Download PDF
⟨ Previous Next ⟩

Abstract

The composite stock cutting problem is defined as allocating rectangular and irregular patterns onto a large composite stock sheet of finite dimensions in such a way that the resulting scrap will be minimized. In this paper, we introduce a novel approach to hybrid optimization algorithm called MGA in MPI (Message Passing Interface) environments. The proposed MGA combines the benefit of rapid convergence property of Mean Field Annealing and the effective genetic operations. This paper also proposes the efficient data structures for pattern related information.

Keywords

References

  1. G.F. Cintra, F.K. Miyazawa, Y. Wakabayashi, E.C. Xavier, "A note on the approximability of cutting stock problems," European Journal of Operational Research, Volume 183, Issue 3, pp. 1328-133216 December 2007. https://doi.org/10.1016/j.ejor.2005.09.053
  2. Wonil Kim, Chul-Eui Hong, Yeong-Joon Kim, "Distributed Simulated Annealing for Composite Stock Cutting Problem," pp. 238-242, PDCAT 2004.
  3. Fowler, R.J., Paterson, M.S., and Tanimoto, S.L., "Optimal packing and covering in the plane are NP-complete," Information Processing Letters, Vol.12, No.3, pp. 133-137, 1981. https://doi.org/10.1016/0020-0190(81)90111-3
  4. Vassilios S. Vassiliadis, "Two-dimensional stock cutting and rectangle packing: binary tree model representation for local search optimization methods," Journal of Food Engineering, Volume 70, Issue 3, pp. 257-268, October 2005. https://doi.org/10.1016/j.jfoodeng.2003.12.008
  5. Claudio Alves, J.M. Valerio de Carvalho, "A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem," Computers & Operations Research, Volume 35, Issue 4, pp. 1315-1328, April 2008. https://doi.org/10.1016/j.cor.2006.08.014
  6. Baker, B.S., Coffman, E.G., and Rivest, R.L., "Orthogonal packings in two dimensions," SIAM Journal on Computing, Vo1.9, No.4, pp. 846-855, 1980. https://doi.org/10.1137/0209064
  7. Y. Khalifa, O. Salem, A. Shahin, "Cutting stock waste reduction using genetic algorithms," GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computation, July 2006
  8. T. W. Leung, C. H. Yung, Marvin D. Troutt, "Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem," Computers & Industrial Engineering, Volume 40, Issue 3, pp. 201-214, July 2001. https://doi.org/10.1016/S0360-8352(01)00021-3
  9. Yonghuai Lin, "A mean field annealing approach to accurate free form shape matching," Pattern Recognition, Volume 40, Issue 9, pp. 2418-2436, September 2007. https://doi.org/10.1016/j.patcog.2006.11.025
  10. Kyeongmo Park, Sungcheol Kim, Chuleui Hong, "A Distributed Hybrid Algorithm for Optimized Resource Allocation Problem," pp. 1118-1127, lCONIP 2006.
  11. Pau Bofill, Roger Guimera, Carme Torras, "Comparison of simulated annealing and mean field annealing as applied to the generation of block designs," Neural Networks, Volume 16, Issue 10, pp. 1421-1428, December 2003. https://doi.org/10.1016/j.neunet.2003.07.003