Skip to main content
SpringerLink
Log in

Development of automatic nesting system for shipbuilding using the branch-and-bound method

  • Original article
  • Published:
Journal of Marine Science and Technology Aims and scope Submit manuscript

Abstract

This study develops a novel automatic nesting system for shipbuilding using the branch-and-bound method. The previous studies mainly discussed strip-packing problem, which is related to the arrangement of parts on the base material. In addition to the strip-packing problem, the present study also considers the bin-packing problem, which is the distribution of parts to different base materials. Therefore, the nesting problem in shipbuilding is defined as a combinatorial optimization problem that encompasses both the bin-packing and strip-packing problems. Based on the above-mentioned problem definition, the solution space of the nesting problem is greatly enhanced, and a lot of time is required to determine the optimal solution. Therefore, the branch-and-bound method is used in this study to solve the above-mentioned combinatorial optimization problem considering the trade-off relation between improving the optimality (i.e., yield rate) and reducing the computation time. This paper discusses the proposed method in detail. In addition, an actual nesting problem is solved using the proposed method to test its validity.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21

Similar content being viewed by others

References

  1. Wäscher G, Haußner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183:1109–1130

    Article  MATH  Google Scholar 

  2. Gomes M, Oliveira JF (2006) Solving irregular strip packing problems by hybridizing simulated annealing and liner programming. Eur J Oper Res 171(1):811–829

    Article  MATH  Google Scholar 

  3. Watanabe S, Hiroyasu T, Miki M (2003) The effect of evolutionary for multi-objective rectangular packing problem. IEICE Trans Commun 86(11):791–799

    Google Scholar 

  4. Yamauchi S, Tezuka K (1995) Automatic nesting system by use of genetic algorithm. J Soc Naval Archit Jpn 178:707–712 (in Japanese).

    Article  Google Scholar 

  5. Nagashima T et al (2005) Application of automatic nesting to ship hulls using the FINEST algorithm. IHI Eng Rev 38(3):38–44

    Google Scholar 

  6. Lee C-S et al (2013) Ship part nesting by pattern recognition and group arrangement. Robot Comput Integr Manuf 29:56–63

    Article  Google Scholar 

  7. Kim Y et al (2003) Automatic two-dimensional layout using a rule-based heuristic algorithm. J Mar Sci Technol 8:37–46

    Google Scholar 

  8. Jang C-D, Han Y-K (1999) An approach to efficient nesting and cutting path optimization of irregular shapes. J Ship Prod 15:129–135

    Google Scholar 

  9. Sha OP, Kumar R (2000) Nesting of two-dimensional irregular parts within an irregular boundary using genetic algorithm. J Ship Prod 16(4):222–232

    Google Scholar 

  10. Johnson DS et al (1974) Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J Comput 3:299–325

    Article  MathSciNet  MATH  Google Scholar 

  11. Umetani S et al (2009) Solving the irregular strip packing problem via guided local search for overlap minimization. Int Trans Oper Res 16(6):661–683

    Article  MathSciNet  MATH  Google Scholar 

  12. Umetani S (2009) Optimization method for cutting and packing problems. IPS2009 (in Japanese)

  13. Burke EK et al (2007) Complete and robust no-fit polygon generation for the irregular stock cutting problem. Eur J Oper Res 179:27–49

    Article  MATH  Google Scholar 

  14. Hamada K, Tokumoto H, Fujishita Y, Hase S (2012) Development of automatic nesting system for shipbuilding. In: Conference proceedings of Japan Society of Naval Architects and Ocean Engineers, vol 15, CD-ROM

  15. Fujishita A, Tokumoto H, Hamada K, Hase S (2012) Development of automatic nesting system for shipbuilding. Proceedings of TEAM 2012, pp 239–243

  16. Ikeda Y, Tokumoto H, Hamada K, Hase S (2014) Improvement of automatic nesting system for shipbuilding by using heuristic rules. Proceedings of TEAM 2014, pp 464–471

  17. Kubo M (2009) Meta-heuristic mathematics. Kyoritsu Shuppan, Tokyo, Japan

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hiroshima University, Higashi-Hiroshima, Hiroshima, Japan

    Kunihiro Hamada, Yasuhiro Ikeda & Hiroshi Tokumoto

  2. Tsuneishi Shipbuilding Co., Ltd, Fukuyama, Hiroshima, Japan

    Shinji Hase

Authors
  1. Kunihiro Hamada
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yasuhiro Ikeda
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hiroshi Tokumoto
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shinji Hase
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kunihiro Hamada.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hamada, K., Ikeda, Y., Tokumoto, H. et al. Development of automatic nesting system for shipbuilding using the branch-and-bound method. J Mar Sci Technol 24, 398–409 (2019). https://doi.org/10.1007/s00773-018-0559-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00773-018-0559-x

Keywords

Search

Navigation