Skip to main content
SpringerLink
Log in

Distributed Simulated Annealing for Composite Stock Cutting Problem

  • Conference paper
Parallel and Distributed Computing: Applications and Technologies (PDCAT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3320))

  • 750 Accesses

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 propose distributed simulated annealing for this composite stock cutting problem. The new cost error tolerant scheme relaxes synchronization and does move generations asynchronously in a dynamically changed stream length to keep the convergence property of the sequential annealing. This paper also proposes the efficient data structures for pattern related information.

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. Lutfiyya, H., McMillin, B., Poshyanonda, P., Dagli, C.: Composite stock cutting through simulated annealing. Mathl. Comput. Modeling 16(1), 57–74 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  2. Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Information Processing Letters 12(3), 133–137 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  3. Degraeve, Z., Vandebroek, M.: A mixed integer programming model for solving a layout problem in the fashion industry. Management Science 44, 301–310 (1998)

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Morabito, R., Arenales, M.N.: Staged and constrained two-dimensional guillotine cutting problems: An AND/OR-graph approach. European Journal of Operational Research 94, 548–560 (1996)

    Article  MATH  Google Scholar 

  6. Baker, B.S., Coffman, E.G., Rivest, R.L.: Orthogonal packings in two dimensions. SIAM Journal on Computing 9(4), 846–855 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  7. Bean, J.C.: A multiple-choice genetic algorithm for a nonlinear cutting stock problem. Computing in Science and Engineering 2(2), 80–83 (2000)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  9. Hong, C., McMillin, B.: Relaxing synchronization in distributed simulated annealing. IEEE Trans. on Parallel and Distributed Systems 16(2), 189–195 (1995)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Digital Contents, College of Electronics and Information Engineering, Sejong University, Seoul, Korea

    Wonil Kim

  2. Software School, Sangmyung University, 7 Hongji-Dong Chongro-Gu, Seoul, 110-743, Korea

    Chul-Eui Hong & Yeong-Joon Kim

Authors
  1. Wonil Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chul-Eui Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yeong-Joon Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Nanyang Centre for Supercomputing and Visualisation School of Mechanical and Production Engineering, Nanyang Technological University, 50 Nanyang Avenue, 639 798, Singapore

    Kim-Meow Liew

  2. School of Computer Science, The University of Adelaide,  

    Hong Shen

  3. Asia Pacific Science and Technology Center, Sun Microsystems Inc., 50 Nanyang Avenue, N3-1c-10, 639798, Singapore

    Simon See

  4. School of Computer Engineering, Nanyang Technological University, 639798, Singapore

    Wentong Cai

  5. Southwest Jiaotong University,  

    Pingzhi Fan

  6. Tohoku University ,  

    Susumu Horiguchi

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, W., Hong, CE., Kim, YJ. (2004). Distributed Simulated Annealing for Composite Stock Cutting Problem. In: Liew, KM., Shen, H., See, S., Cai, W., Fan, P., Horiguchi, S. (eds) Parallel and Distributed Computing: Applications and Technologies. PDCAT 2004. Lecture Notes in Computer Science, vol 3320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30501-9_52

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30501-9_52

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24013-6

  • Online ISBN: 978-3-540-30501-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation