Skip to main content
SpringerLink
Log in

A* Based Cutting Plan Generation for Metal Grating Production

  • Conference paper
Intelligent Information and Database Systems (ACIIDS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6592))

Included in the following conference series:

  • 1430 Accesses

Abstract

In the metal grating production process, a cutting plan should decide how pieces of metal rectangles are allocated and cutout from plate sheets called panels. The cutting plan can generate various possible combinations of rectangle allocations within the panels in order to select the best plan that minimizes material waste. To achieve the best plan, A* algorithm of artificial Intelligence is exploited. The plan is evaluated to show how effective it is in terms of material utilization.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Groover, M.P.: Automation, Production system, and Computer Integrated Manufacturing. Prentice-Hall, Englewood Cliffs (1987)

    Google Scholar 

  2. Viswanathan, K.V., Bagchi, A.: Best-first search methods for constrained two-dimensional cutting stock problems. Operations Research 41, 768–776 (1993)

    Article  MATH  Google Scholar 

  3. Beasley, J.E.: Algorithms for unconstrained two-dimensional guillotine cutting. Journal of the Operational Research Society 36, 297–306 (1985)

    Article  MATH  Google Scholar 

  4. Kantorovich, L.V.: Mathematical method of organizing and planning production. Management Science 6, 363–442 (1960)

    Article  MathSciNet  Google Scholar 

  5. Gilmore, P.C., Gomory, R.E.: Multistage cutting stock problems of two and more dimensions. Operations Research 13, 94–120 (1965)

    Article  MATH  Google Scholar 

  6. Gilmore, P.C.: Cutting stock, linear programming, knapsacking, dynamic programming and integer programming, some interconnections. Annals of Discrete Mathematics 4, 217–235 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  7. Christofieds, N., Whitlock, C.: An algorithm for two dimensional cutting problems. Operations Research 25, 30–44 (1977)

    Article  MATH  Google Scholar 

  8. Beasley, J.E.: An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research 33, 49–64 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hifi, M., Zissimopolous, V.: Constrained two-dimensional cutting: An improvement of Christofides and Whitlock’s exact algorithm. Journal of Operation Research Society 5, 8–18 (1997)

    Google Scholar 

  10. Burke, E.K., Kendall, G., Whitwell, G.: A New Placement Heuristic for the Orthogonal Stock-Cutting Problem. Operation Research 52, 655–671 (2004)

    Article  MATH  Google Scholar 

  11. Cung, V.-D., Hifi, M., Le Cun, B.: Constrained two-dimensional cutting stock problems best-first branch-and-bound algorithm. Operations Research 7, 185–210 (2000)

    MathSciNet  Google Scholar 

  12. Daza, V.P., et al.: Exact solutions for constrained two-dimensional cutting problems. European Journal of Operations Research 84, 633–644 (1995)

    Article  MATH  Google Scholar 

  13. Wang, P.Y.: Two algorithms for constrained two-dimensional cutting stock algorithms. Operations Research 31, 573–586 (1983)

    Article  MATH  Google Scholar 

  14. Baker, B.S., Coffman Jr., E.G., Rivest, R.L.: Orthogonal packings in two dimensions. Society for Industrial and Applied Mathematics Journal of Computing 9, 846–855 (1980)

    MathSciNet  MATH  Google Scholar 

  15. Chazelle, B.: The bottom-left bin packing heuristic: An efficient implementation. IEEE Transaction on Computers 32, 697–707 (1983)

    Article  MATH  Google Scholar 

  16. Jakobs, S.: On genetic algorithms for the packing of polygons. European Journal of Operations Research 88, 165–181 (1996)

    Article  MATH  Google Scholar 

  17. Liu, D., Teng, H.: An improved BL-algorithm for genetic algorithms of the orthogonal packing of rectangles. European Journal of Operations Research 84, 539–561 (1999)

    Article  MATH  Google Scholar 

  18. Lesh, N., Marks, et al.: New Heuristic and Interactive Approaches to 2D Rectanglar Strip Packing. Journal of Experimental Algorithmics 10, 1–18 (2005)

    Article  MATH  Google Scholar 

  19. Nilsson, N.J.: Artificial Intelligence: A new synthesis. Morgan Kaufmann Publishers, San Francisco (1998)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Kyungkido, South Korea

    Jin Myoung Kim & Tae Ho Cho

Authors
  1. Jin Myoung Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tae Ho Cho
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Wroclaw University of Technology, 50-370, Wroclaw, Poland

    Ngoc Thanh Nguyen

  2. Department of Computer Engineering, Yeungnam University, Dae-Dong, 712-749, Gyeungsan, Korea

    Chong-Gun Kim

  3. Institute of Informatics, Automation and Robotics, Wroclaw University of Technology, 50-370, Wrocław, Poland

    Adam Janiak

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, J.M., Cho, T.H. (2011). A* Based Cutting Plan Generation for Metal Grating Production. In: Nguyen, N.T., Kim, CG., Janiak, A. (eds) Intelligent Information and Database Systems. ACIIDS 2011. Lecture Notes in Computer Science(), vol 6592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20042-7_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20042-7_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20041-0

  • Online ISBN: 978-3-642-20042-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation